On Yen’s Path Logic for Petri Nets
From MaRDI portal
Publication:3646251
DOI10.1007/978-3-642-04420-5_7zbMath1260.68255MaRDI QIDQ3646251
Mohamed Faouzi Atig, Peter Habermehl
Publication date: 19 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04420-5_7
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On selective unboundedness of VASS, Small vertex cover makes Petri net coverability and boundedness easier, Detectability of labeled weighted automata over monoids, On detectability of labeled Petri nets and finite automata, Strategic reasoning with a bounded number of resources: the quest for tractability, Energy Games in Multiweighted Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Persistence of vector replacement systems is decidable
- 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
- On the regularity of Petri net languages
- Verifying liveness for asynchronous programs