Decidable problems on the strong connectivity of Petri net reachability sets
From MaRDI portal
Publication:1240066
DOI10.1016/0304-3975(77)90059-7zbMATH Open0362.68095OpenAlexW2027710994MaRDI QIDQ1240066FDOQ1240066
Authors: Toshiro Araki, Tadao Kasami 
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(77)90059-7
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cites Work
- Semigroups, Presburger formulas, and languages
- Parallel program schemata
- On Context-Free Languages
- Title not available (Why is that?)
- The equality problem for vector addition systems is undecidable
- Some decision problems related to the reachability problem for Petri nets
- Title not available (Why is that?)
Cited In (8)
- Petri nets and semilinear sets (extended abstract)
- On the Reversibility of Live Equal-Conflict Petri Nets
- Reversible computation vs. reversibility in Petri nets
- The decidability of persistence for vector addition systems
- Normal Petri nets
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
- Persistence of vector replacement systems is decidable
- A unified approach for deciding the existence of certain petri net paths
This page was built for publication: Decidable problems on the strong connectivity of Petri net reachability sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240066)
