PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS

DOI10.1142/S0129054109006759zbMath1192.68453OpenAlexW2020720940MaRDI QIDQ3395130

Hsu-Chun Yen

Publication date: 21 August 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109006759

zbMATH Keywords

reachabilityPetri netsemilinear set

Mathematics Subject Classification ID

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

Related Items (1)

Petri Nets and Semilinear Sets (Extended Abstract)

Cites Work

• Unnamed Item
• Normal Petri nets
• 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
• On structural conditions for weak persistency and semilinearity of Petri nets
• Normal and sinkless Petri nets
• Decidable problems on the strong connectivity of Petri net reachability sets
• The covering and boundedness problems for vector addition systems
• Recent advances in formal languages and applications.
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Properties of Conflict-Free and Persistent Petri Nets

This page was built for publication: PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS