Decidable problems on the strong connectivity of Petri net reachability sets
- 28 February 1977
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 4 (1), 99-119
- https://doi.org/10.1016/0304-3975(77)90059-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Some decision problems related to the reachability problem for Petri netsTheoretical Computer Science, 1976
- Parallel program schemataJournal of Computer and System Sciences, 1969
- On Context-Free LanguagesJournal of the ACM, 1966
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966