A unified approach for deciding the existence of certain petri net paths
From MaRDI portal
Publication:1184737
DOI10.1016/0890-5401(92)90059-OzbMath0753.68078OpenAlexW2044858512MaRDI QIDQ1184737
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90059-o
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (17)
A note on fine covers and iterable factors of VAS languages ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ On selective unboundedness of VASS ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ Undecidable problems in unreliable computations. ⋮ On detectability of labeled Petri nets and finite automata ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Deciding detectability for labeled Petri nets ⋮ ON YEN'S PATH LOGIC FOR PETRI NETS ⋮ On the decidability of fragments of the asynchronous π-calculus ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ Unnamed Item ⋮ On Yen’s Path Logic for Petri Nets ⋮ Energy Games in Multiweighted Automata ⋮ Detectability of labeled weighted automata over monoids
Cites Work
- The residue of vector sets with applications to decidability problems in Petri nets
- A taxonomy of fairness and temporal logic problems for Petri nets
- Normal Petri nets
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- Completeness results for conflict-free vector replacement 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
- A decidability theorem for a class of vector-addition systems
- Decidable problems on the strong connectivity of Petri net reachability sets
- The covering and boundedness problems for vector addition systems
- A multiparameter analysis of the boundedness problem for vector addition systems
- Three measures for synchronic dependence in Petri nets
- Parallel program schemata
- An Algorithm for the General Petri Net Reachability Problem
- On two-way weak counter machines
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Properties of Conflict-Free and Persistent Petri Nets
- Decidability of weak fairness in petri nets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A unified approach for deciding the existence of certain petri net paths
