Normal and sinkless Petri nets

DOI10.1016/0022-0000(93)90046-YzbMath0791.68124OpenAlexW2050930613MaRDI QIDQ1208921

Louis E. Rosier, Rodney R. Howell, Hsu-Chun Yen

Publication date: 16 May 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(93)90046-y

zbMATH Keywords

Petri netsconflict-free netsnormal netspersistent netssinkless nets

Mathematics Subject Classification ID

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

Related Items (5)

Bounded self-stabilizing Petri nets ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ On minimal elements of upward-closed sets ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS ⋮ A valuation-based analysis of conflict-free Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normal Petri nets
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Completeness results for conflict-free vector replacement systems
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• The decidability of persistence for vector addition systems
• Vector addition systems and regular languages
• Persistence of vector replacement systems is decidable
• On the reachability problem for 5-dimensional vector addition systems
• Petri nets and regular languages
• A decidability theorem for a class of vector-addition systems
• The polynomial-time hierarchy
• The equality problem for vector addition systems is undecidable
• Complexity of some problems in Petri nets
• The covering and boundedness problems for vector addition systems
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Parallel program schemata
• An Algorithm for the General Petri Net Reachability Problem
• The Complexity of the Finite Containment Problem for Petri Nets
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Properties of Conflict-Free and Persistent Petri Nets
• A Bound on Solutions of Linear Integer Equalities and Inequalities

This page was built for publication: Normal and sinkless Petri nets