Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
- 30 June 2005
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 94 (6), 241-245
- https://doi.org/10.1016/j.ipl.2005.03.002
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Concurrent transition systemsTheoretical Computer Science, 1989
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- Persistence of vector replacement systems is decidableActa Informatica, 1981
- The decidability of persistence for vector addition systemsInformation Processing Letters, 1980
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978