Reproducibility of the empty marking

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

Volumn 2360 LNCS, Issue , 2002, Pages 237-253

  Lautenbach, Kurt ^a  

^a University of Koblenz Landau ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MODELING PROCESS; REPRODUCIBILITIES; T-INVARIANT;

PETRI NETS;

EID: 84879116125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48068-4_15     Document Type: Conference Paper

References (5)

1. J. M. Couvreur, Ezpeleta and M. Silva. A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri Nets. Advances in Petri Nets, 1993.
2. F. Commoner. Deadlocks in Petri nets. Report #CA-7206-2311, Applied Data Research, Inc., Wakefield, 1972.
3. T. Murata. Petri Nets: Properties, Analysis and Applications. Proceedings 77(4), IEEE, 1989.
4. J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981.
5. W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science vol. Springer Verlag, New York, 1985.