Reachability in reversible free choice systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 480 LNCS, Issue , 1991, Pages 384-397

  Desel, Jörg ^a   Esparza, Javier ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

BOUNDEDNESS; FREE-CHOICE PETRI NETS; LIVENESS; POLYNOMIAL-TIME; REACHABILITY; REACHABILITY PROBLEM; REACTIVE SYSTEM;

PETRI NETS;

EID: 85008529510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0020814     Document Type: Conference Paper

References (11)

1. E. Best, L. Cherkasova, J. Desel and J. Esparza: Characterisation of Home States in Free Choice Systems. Hildesheimer Informatikberichte Nr. 9/90 (1990).
2. E. Best and J. Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol. 2 No. 2, 123-138 (1990).
3. F. Commoner, A.W. Holt, S. Even and A. Pnueli: Marked Directed Graphs. Journal of Computer and System Science Vol. 5, 511-523 (1971).
4. J. Desel and J. Esparza: Reachability in Reversible Free Choice Systems. SFB-Bericht Nr. 342/11/90 A, Technische Universität München (1990).
5. J. Esparza and M. Silva: Top-down synthesis of live and bounded Free Choice nets. Proceedings of the 11th International Conference on Applications and Theory of Petri nets 63-83 (1990).
6. H.J. Genrich and K. Lautenbach: Synchronisationsgraphen. Acta Informatica Vol. 2, 143-161 (1973).
7. M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972).
8. D. Hillen: Relationship between Deadlock-freeness and Liveness in Free Choice Nets. Newsletter of the GI Special Interest Group in Petri Nets and Related System Models, No. 19, 28-32 (1985).
9. S.R. Kosaraju: Decidability of reachability in vector addition systems. Proceedings of the 14th Annual Symposium of the Theory of Computing, 267-281 (1982).
10. E.W. Mayr: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, Vol. 13, 441-460 (1984).
11. M. Minoux and K. Barkaoui: Polynomial Time Proof or Disproof of Commoner's Structural Property in Petri Nets. Proceedings of the 9th European Workshop on Applications and Theory of Petri Nets, Venice, 113-125 (1989).