Towards reasoning about Petri nets: a propositional dynamic logic based approach
From MaRDI portal
Publication:1786561
DOI10.1016/j.tcs.2018.01.007zbMath1401.68220OpenAlexW2784333464MaRDI QIDQ1786561
Edward Hermann Haeusler, Bruno D. Lopes, Mario R. F. Benevides
Publication date: 24 September 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.007
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) 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
Uses Software
Cites Work
- Extending propositional dynamic logic for Petri nets
- A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic
- DAL -- a logic for data analysis
- Communication in concurrent dynamic logic
- Executions: A new partial-order semantics of Petri nets
- Parallel action: Concurrent dynamic logic with independent modalities
- Propositional dynamic logic of regular programs
- Syntactic codes and grammar refinement
- Propositional dynamic logic with recursive programs
- Towards Reasoning in Dynamic Logics with Rewriting Logic: The Petri-PDL Case
- Deciding Properties of Nonregular Programs
- Propositional Dynamic Logic for Petri Nets with Iteration
- A Propositional Dynamic Logic for CCS Programs
- PDL with intersection of programs: a complete axiomatization
- Concurrent dynamic logic
- Propositional dynamic logic for Petri nets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item