Deciding a class of path formulas for conflict-free Petri nets

DOI10.1007/BF02679458MaRDI QIDQ1364130zbMATH OpenOpenAlexFDO

Authors Hsu-Chun Yen, Bow-Yaw Wang, Mingsheng Yang

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

zbMATH Keywords

conflict-free Petri nets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4096790
• A unified approach for deciding the existence of certain petri net paths
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• scientific article; zbMATH DE number 512938

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4096790 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A decidability theorem for a class of vector-addition systems
• A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
• A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
• A taxonomy of fairness and temporal logic problems for Petri nets
• A unified approach for deciding the existence of certain petri net paths
• An Algorithm for the General Petri Net Reachability Problem
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Completeness results for conflict-free vector replacement systems
• Complexity of some problems in Petri nets
• Normal Petri nets
• Normal and sinkless Petri nets
• On the reachability problem for 5-dimensional vector addition systems
• Properties of Conflict-Free and Persistent Petri Nets
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• The covering and boundedness problems for vector addition systems
• The decidability of persistence for vector addition systems
• The equality problem for vector addition systems is undecidable
• The polynomial-time hierarchy
• The residue of vector sets with applications to decidability problems in Petri nets
• Three measures for synchronic dependence in Petri nets
• \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems

Cited in

(8)

• A valuation-based analysis of conflict-free Petri nets
• scientific article; zbMATH DE number 5631271 (Why is no real title available?)
• On Yen’s Path Logic for Petri Nets
• scientific article; zbMATH DE number 4096790 (Why is no real title available?)
• A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
• Linear time analysis of properties of conflict-free and general Petri nets
• A unified approach for deciding the existence of certain petri net paths
• Separability in Conflict-Free Petri Nets

This page was built for publication: Deciding a class of path formulas for conflict-free Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364130)