On weak persistency of Petri nets

DOI10.1016/0020-0190(81)90117-4zbMath0473.68058MaRDI 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

reachability; semilinear sets; persistent Petri nets

Mathematics Subject Classification ID

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

Related Items

Reduced state space representation for unbounded vector state spaces, On conditions for the liveness of weakly persistent nets, A decomposition theorem for finite persistent transition systems, Normal Petri nets, Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, Problems concerning fairness and temporal logic for conflict-free 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, Learning semilinear sets from examples and via queries, On the teaching complexity of linear sets, Minimal output unstable configurations in chemical reaction networks and deciders, Petri Nets and Semilinear Sets (Extended Abstract), Unnamed Item, PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS, Decomposition Theorems for Bounded Persistent 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