Complexity of some problems in Petri nets
- 1 June 1977
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 4 (3), 277-299
- https://doi.org/10.1016/0304-3975(77)90014-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- A note on transition systemsInformation Sciences, 1976
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Termination Properties of Generalized Petri NetsSIAM Journal on Computing, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- A Petri Net model of the CDC 6400Published by Association for Computing Machinery (ACM) ,1971
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961