ON YEN'S PATH LOGIC FOR PETRI NETS

DOI10.1142/S0129054111008428zbMath1230.68153MaRDI QIDQ3016216

Mohamed Faouzi Atig, Peter Habermehl

Publication date: 14 July 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

reachabilityPetri netsEXPSPACE-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Forward analysis and model checking for trace bounded WSTS ⋮ On selective unboundedness of VASS ⋮ 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 ⋮ Unnamed Item

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
• Persistence of vector replacement systems is decidable
• Petri nets and regular languages
• A unified approach for deciding the existence of certain petri net paths
• A structure to decide reachability in Petri nets
• The covering and boundedness problems for vector addition systems
• A note on fine covers and iterable factors of VAS languages
• Three measures for synchronic dependence in Petri nets
• On the regularity of Petri net languages

This page was built for publication: ON YEN'S PATH LOGIC FOR PETRI NETS