An Algorithm for the General Petri Net Reachability Problem
- 1 August 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (3) , 441-460
- https://doi.org/10.1137/0213029
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- The decidability of persistence for vector addition systemsInformation Processing Letters, 1980
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Remarks on blind and partially blind one-way multicounter machinesTheoretical Computer Science, 1978
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977
- Petri nets and szilard languagesInformation and Control, 1977
- Decidable problems on the strong connectivity of Petri net reachability setsTheoretical Computer Science, 1977
- Reduction of Petri-netsLecture Notes in Computer Science, 1976
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913