Decidable problems on the strong connectivity of Petri net reachability sets

DOI10.1016/0304-3975(77)90059-7zbMath0362.68095OpenAlexW2027710994MaRDI QIDQ1240066

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

Mathematics Subject Classification ID

Related Items (8)

Petri Nets and Semilinear Sets (Extended Abstract) ⋮ Reversible Computation vs. Reversibility in Petri Nets ⋮ On the Reversibility of Live Equal-Conflict Petri Nets ⋮ The decidability of persistence for vector addition systems ⋮ Persistence of vector replacement systems is decidable ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS ⋮ Normal Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Some decision problems related to the reachability problem for Petri nets
• The equality problem for vector addition systems is undecidable
• Semigroups, Presburger formulas, and languages
• Parallel program schemata
• On Context-Free Languages

This page was built for publication: Decidable problems on the strong connectivity of Petri net reachability sets