Analysis and control of discrete event systems represented by petri nets
- 18 January 2006
- book chapter
- Published by Springer Nature
- p. 115-134
- https://doi.org/10.1007/bfb0042308
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Decidability of reachability in persistent vector replacement systemsPublished by Springer Nature ,2005
- Linear system theory for discrete event systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- A new approach to the analysis of discrete event dynamic systemsAutomatica, 1983
- Persistence of vector replacement systems is decidableActa Informatica, 1981
- The decidability of persistence for vector addition systemsInformation Processing Letters, 1980
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- Circuit theoretic analysis and synthesis of marked graphsIEEE Transactions on Circuits and Systems, 1977
- Decidable problems on the strong connectivity of Petri net reachability setsTheoretical Computer Science, 1977