A taxonomy of fairness and temporal logic problems for Petri nets

DOI10.1016/0304-3975(91)90228-TzbMath0728.68090OpenAlexW2053421425WikidataQ127436291 ScholiaQ127436291MaRDI QIDQ805257

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

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90228-t

zbMATH Keywords

fairnessPetri netsmodel checkingtemporal logic

Mathematics Subject Classification ID

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

Related Items

Fair Petri nets and structural induction for rings of processes ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Constrained properties, semilinear systems, and Petri nets ⋮ DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ ON YEN'S PATH LOGIC FOR PETRI NETS

Cites Work

• The residue of vector sets with applications to decidability problems in Petri nets
• Fairness and conspiracies
• Decidability of a temporal logic problem for Petri nets
• Proof rules and transformations dealing with fairness
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• The method of forced enumeration for nondeterministic automata
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• The equality problem for vector addition systems is undecidable
• The covering and boundedness problems for vector addition systems
• A multiparameter analysis of the boundedness problem for vector addition systems
• Modalities for model checking: Branching time logic strikes back
• An Algorithm for the General Petri Net Reachability Problem
• The complexity of propositional linear temporal logics
• Nondeterministic Space is Closed under Complementation
• Decision problems forω-automata
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item