[untitled]
- 期刊名称The Burlington Magazine
- 作者Review by: Richard Calvocoressi
- 卷第141卷
- 期第1154期
- 印刷ISSN0007-6287
- 文件大小724.38KB
- 发表时间1999-05
- DOI10.2307/888378
- 页码299-300
Optimal constructions for active diagnosisHaar, Stefan; Haddad, Serge; Melliti, Tarek; Schwoon, Stefan · Journal of Computer and System Sciences · 2017
Computing the reveals relation in occurrence netsHaar, Stefan; Kern, Christian; Schwoon, Stefan · Theoretical Computer Science · 2013
The Complexity of Diagnosability and Opacity Verification for Petri NetsBérard, Béatrice; Haar, Stefan; Schmitz, Sylvain; Schwoon, Stefan; van der Aalst, Wil; Best, Eike; Penczek, Wojciech · Fundamenta Informaticae · 2018
Contributing AuthorsShigemasa Takai; Toshimitsu Ushio; Eric Fabre; Albert Benveniste; Stefan Haar; Claude Jard; Alessandro Giua; Daniele Corona; Carla Seatzu · Discrete Event Dynamic Systems · 2005
Effective Verification of Weak DiagnosabilityAgarwal,, Anoopam; Madalinski,, Agnes; Haar, Stefan · IFAC Proceedings Volumes · 2012
Concurrency in Boolean networksChatain, Thomas; Haar, Stefan; Kolčák, Juraj; Paulevé, Loïc; Thakkar, Aalok · Natural Computing · 2019
Counter Equations for Timed Competition NetsBaccelli, François; Haar, Stefan · IFAC Proceedings Volumes · 2001
Forecasting Passenger Loads in Transportation NetworksHaar, Stefan; Theissing, Simon · Electronic Notes in Theoretical Computer Science · 2016