Computation paths logic: An expressive, yet elementary, process logic
From MaRDI portal
Publication:4571972
DOI10.1007/3-540-63165-8_197zbMath1401.03058OpenAlexW1600123197MaRDI QIDQ4571972
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_197
Cites Work
- Unnamed Item
- Process logic with regular formulas
- An elementary proof of the completeness of PDL
- Process logic: Expressiveness, decidability, completeness
- Propositional dynamic logic of regular programs
- Looping vs. repeating in dynamic logic
- Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
- Propositional dynamic logic of flowcharts
This page was built for publication: Computation paths logic: An expressive, yet elementary, process logic