Propositional dynamic logic of flowcharts
From MaRDI portal
Cited in
(6)- Concurrent program schemes and their logics
- Computation paths logic: An expressive, yet elementary, process logic
- Complexity results for two-way and multi-pebble automata and their logics
- The complexity of PDL with interleaving
- Computation paths logic: an expressive, yet elementary, process logic
- Complexity results for multi-pebble automata and their logics
This page was built for publication: Propositional dynamic logic of flowcharts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694683)