Problems concerning fairness and temporal logic for conflict-free Petri nets
From MaRDI portal
Publication:1121023
DOI10.1016/0304-3975(89)90053-4zbMath0673.68040OpenAlexW1999917306MaRDI QIDQ1121023
Louis E. Rosier, Rodney R. Howell
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90053-4
Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) 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, Linear time analysis of properties of conflict-free and general Petri nets, Complexity results for 1-safe nets, Normal and sinkless Petri nets, On the complexity of resource-bounded logics, Global and local views of state fairness, A taxonomy of fairness and temporal logic problems for Petri nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The residue of vector sets with applications to decidability problems in 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
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
- Completeness results for conflict-free vector replacement systems
- 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
- On weak persistency of Petri nets
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- A decidability theorem for a class of vector-addition systems
- Space-bounded reducibility among combinatorial problems
- Complexity of some problems in Petri nets
- Modalities for model checking: Branching time logic strikes back
- Parallel program schemata
- An Algorithm for the General Petri Net Reachability Problem
- The complexity of propositional linear temporal logics
- Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines
- Proving Liveness Properties of Concurrent Programs
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Properties of Conflict-Free and Persistent Petri Nets
- Termination of Probabilistic Concurrent Program
- Decision problems forω-automata
