Propositional dynamic logic of context-free programs and fixpoint logic with chop

DOI10.1016/j.ipl.2006.04.019zbMath1185.68391OpenAlexW2121147545MaRDI QIDQ845832

Rafał Somla, Martin Lange

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.019

zbMATH Keywords

program specificationformal languagesconcurrency

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Temporal Logic with Recursion. ⋮ The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of nonregular programs
• Results on the propositional \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• More on nonregular PDL: Finite models and Fibonacci-like programs
• Model checking propositional dynamic logic with all extras
• A lattice-theoretical fixpoint theorem and its applications
• Three notes on the complexity of model checking fixpoint logic with chop
• Foundations of Software Science and Computation Structures

This page was built for publication: Propositional dynamic logic of context-free programs and fixpoint logic with chop