ON YEN'S PATH LOGIC FOR PETRI NETS

DOI10.1142/S0129054111008428MaRDI QIDQ3016216zbMATH OpenFDO

Authors Mohamed Faouzi Atig, Peter Habermehl

Publication date 14 July 2011

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

Full work available at URL https://doi.org/10.1142/S0129054111008428

zbMATH Keywords

reachabilityPetri netsEXPSPACE-completeness

Mathematics Subject Classification ID

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

Recommendations

• On Yen’s Path Logic for Petri Nets
• scientific article; zbMATH DE number 3992937
• Towards reasoning about Petri nets: a propositional dynamic logic based approach
• PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
• scientific article; zbMATH DE number 3974312
• Propositional dynamic logic for Petri nets
• A logical approach of Petri net languages
• The logical view on continuous Petri nets
• On the rationality of Petri net languages
• A unified approach for deciding the existence of certain petri net paths

Cites work

• A note on fine covers and iterable factors of VAS languages
• A structure to decide reachability in Petri nets
• A taxonomy of fairness and temporal logic problems for Petri nets
• A unified approach for deciding the existence of certain petri net paths
• On the regularity of Petri net languages
• Persistence of vector replacement systems is decidable
• Petri nets and regular languages
• The covering and boundedness problems for vector addition systems
• The residue of vector sets with applications to decidability problems in Petri nets
• Three measures for synchronic dependence in Petri nets

Cited in

(9)

• Deciding detectability for labeled Petri nets
• Forward analysis and model checking for trace bounded WSTS
• Forward analysis for WSTS. III: Karp-Miller trees
• On Yen’s Path Logic for Petri Nets
• Unboundedness problems for languages of vector addition systems
• Separability in Büchi VASS and singly nonlinear systems of inequalities
• On selective unboundedness of VASS
• A unified approach for deciding the existence of certain petri net paths
• Deciding fast termination for probabilistic VASS with nondeterminism

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

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