Computing the reveals relation in occurrence nets

Theoretical Computer Science

Volumn 493, Issue , 2013, Pages 66-79

  Haar, Stefan ^a   Kern, Christian ^b   Schwoon, Stefan ^c  

^a INRIA   (France)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Automatic analysis; Partial order theory of concurrency; Structure and behavior of Petri nets

Indexed keywords

AUTOMATIC ANALYSIS; CONCISE REPRESENTATIONS; FINITE PREFIX; OCCURRENCE NET; PARTIAL-ORDER THEORY OF CONCURRENCY; PARTIALLY OBSERVABLE SYSTEMS; PETRI NET UNFOLDINGS; STATE-SPACE EXPLOSION;

ALGORITHMS; DATA STRUCTURES;

PETRI NETS;

EID: 84879239149     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2013.04.028     Document Type: Conference Paper

References (22)

1. J.L. Peterson Petri Net Theory and the Modeling of Systems 1981 Prentice-Hall
2. T. Murata Petri nets: properties, analysis and applications Proc. IEEE 77 4 1989 541 580
3. K.L. McMillan Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits Proc. CAV LNCS vol. 663 1992 Springer 164 177
4. J. Esparza, S. Römer, and W. Vogler An improvement of McMillan's unfolding algorithm Form. Method. Syst. Des. 20 3 2002 285 310
5. V. Khomenko, M. Koutny, and W. Vogler Canonical prefixes of Petri net unfoldings Acta Inform. 40 2 2003 95 118
6. E. Fabre, and A. Benveniste Partial order techniques for distributed discrete event systems: why you cannot avoid using them Discrete Event Dyn. Syst. 17 3 2007 355 403
7. U. Goltz Synchronic distance Advances in Petri Nets 1986, Part I on Petri Nets: Central Models and their Properties 1987 Springer-Verlag London, UK 338 358
8. W. Reisig Petri Nets: An Introduction Monographs in Theoretical Computer Science. An EATCS Series vol. 4 1985 Springer
9. W. Zhao, Y. Huang, C.-Y. Yuan, Synchronic distance based workflow logic specification, in: Proc. HPCC, 2008, pp. 819-824.
10. S. Haar Unfold and cover: qualitative diagnosability for Petri nets Proc. CDC 2007 IEEE 1886 1891
11. S. Haar Types of asynchronous diagnosability and the reveals-relation in occurrence nets IEEE Trans. Automat. Control 55 10 2010 2310 2320
12. S. Balaguer, T. Chatain, and S. Haar Building tight occurrence nets from reveals relations B. Caillaud, J. Carmona, Proceedings of the 11th International Conference on Application of Concurrency to System Design ACSD'11 2011 IEEE Computer Society Press Newcastle upon Tyne, UK 44 53
13. S. Haar Qualitative diagnosability of labeled Petri nets revisited Proc. CDC 2009 IEEE 1248 1253
14. J. Engelfriet Branching processes of Petri nets Acta Inform. 28 6 1991 575 591
15. P. Gastin, and D. Kuske Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces Inform. Comput. 208 7 2010 797 816
16. V. Diekert, and P. Gastin Pure future local temporal logics are expressively complete for Mazurkiewicz traces Inform. Comput. 204 11 2006 1597 1619
17. V. Diekert, and P. Gastin From local to global temporal logics over Mazurkiewicz traces Theoret. Comput. Sci. 356 1-2 2006 126 135
18. A. Benveniste, E. Fabre, S. Haar, and C. Jard Diagnosis of asynchronous discrete-event systems: a net unfolding approach IEEE Trans. Automat. Control 48 5 2003 714 727
19. E. Fabre, A. Benveniste, S. Haar, and C. Jard Distributed monitoring of concurrent and asynchronous systems Discrete Event Dyn. Syst. 15 1 2005 33 84
20. J. Esparza Decidability and complexity of Petri net problems - an introduction Lectures on Petri Nets I: Basic Models. Advances in Petri Nets Lecture Notes in Computer Science vol. 1491 1998 374 428
21. B. Grahlmann The PEP tool Computer Aided Verification LNCS vol. 1254 1997 440 443
22. S. Schwoon, The Mole tool. http://www.lsv.ens-cachan.fr/schwoon/tools/ mole/.