Extending propositional dynamic logic for Petri nets
DOI10.1016/j.entcs.2014.06.006zbMath1335.68175OpenAlexW2035169146WikidataQ113317870 ScholiaQ113317870MaRDI QIDQ281154
Mario R. F. Benevides, Edward Hermann Haeusler, Bruno D. Lopes
Publication date: 10 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.06.006
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending propositional dynamic logic for Petri nets
- A probabilistic dynamic logic
- Decidability of finite probabilistic propositional dynamic logics
- Propositional dynamic logic with local assignments
- A probabilistic PDL
- Parallel action: Concurrent dynamic logic with independent modalities
- Propositional dynamic logic of regular programs
- Combining deduction and model checking into tableaux and algorithms for converse-PDL.
- Model checking propositional dynamic logic with all extras
- Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
- Infinite State Model-Checking of Propositional Dynamic Logics
- A decidable propositional dynamic logic with explicit probabilities
- Stochastic Petri Nets
This page was built for publication: Extending propositional dynamic logic for Petri nets