Normal Petri nets

DOI10.1016/0304-3975(84)90038-0zbMath0562.68047OpenAlexW2046665182MaRDI QIDQ1057065

Hideki Yamasaki

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90038-0

zbMATH Keywords

reachability sets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Petri Nets and Semilinear Sets (Extended Abstract) ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ On reachability equivalence for BPP-nets ⋮ The complexity of problems involving structurally bounded and conservative Petri nets ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ On structural conditions for weak persistency and semilinearity of Petri nets ⋮ Normal and sinkless Petri nets ⋮ On minimal elements of upward-closed sets ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS

Cites Work

• Unnamed Item
• The decidability of persistence for vector addition systems
• Persistence of vector replacement systems is decidable
• On the reachability problem for 5-dimensional vector addition systems
• On weak persistency of Petri nets
• The equality problem for vector addition systems is undecidable
• Decidable problems on the strong connectivity of Petri net reachability sets
• Semigroups, Presburger formulas, and languages
• Marked directed graphs
• Properties of Conflict-Free and Persistent Petri Nets

This page was built for publication: Normal Petri nets