Deciding a class of path formulas for conflict-free Petri nets
From MaRDI portal
Publication:1364130
DOI10.1007/BF02679458zbMath0876.68078OpenAlexW2032159944MaRDI QIDQ1364130
Hsu-Chun Yen, Ming-Sheng Yang, Bow-Yaw Wang
Publication date: 24 August 1997
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02679458
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The residue of vector sets with applications to decidability problems in Petri nets
- A taxonomy of fairness and temporal logic problems for Petri nets
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
- 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
- The decidability of persistence for vector addition systems
- On the reachability problem for 5-dimensional vector addition systems
- A unified approach for deciding the existence of certain petri net paths
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
- Normal and sinkless Petri nets
- 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
- Three measures for synchronic dependence in Petri nets
- An Algorithm for the General Petri Net Reachability Problem
- Properties of Conflict-Free and Persistent Petri Nets
