On weak persistency of Petri nets

DOI10.1016/0020-0190(81)90117-4zbMath0473.68058OpenAlexW2014601143MaRDI QIDQ1158764

Hideki Yamasaki

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90117-4

zbMATH Keywords

reachabilitysemilinear setspersistent Petri nets

Mathematics Subject Classification ID

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

Related Items (15)

Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ Petri Nets and Semilinear Sets (Extended Abstract) ⋮ Unnamed Item ⋮ Problems concerning fairness and temporal logic for conflict-free Petri nets ⋮ Decomposition Theorems for Bounded Persistent Petri Nets ⋮ On the teaching complexity of linear sets ⋮ Reduced state space representation for unbounded vector state spaces ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ On structural conditions for weak persistency and semilinearity of Petri nets ⋮ Learning semilinear sets from examples and via queries ⋮ On conditions for the liveness of weakly persistent nets ⋮ A decomposition theorem for finite persistent transition systems ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS ⋮ Normal Petri nets

Cites Work

• Unnamed Item
• The decidability of persistence for vector addition systems
• Persistence of vector replacement systems is decidable
• Properties of Conflict-Free and Persistent Petri Nets

This page was built for publication: On weak persistency of Petri nets