Propositional Dynamic Logic with Recursive ProgramsReport as inadecuate

Propositional Dynamic Logic with Recursive Programs - Download this document for free, or read online. Document in PDF available to download.

1 Lehrstuhl für Informatik VII 2 Institute for Theoretical Computer Science 3 LIAFA - Laboratoire d-informatique Algorithmique : Fondements et Applications

Abstract : We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata Alur, Madhusudan 2004. We show that the satisfiability problem for this extension remains decidable, generalising known decidability results for extensions of PDL by non-regular programs. Our decision procedure establishes a 2-ExpTime upper complexity bound, and we prove a matching lower bound that applies already to rather weak extensions of PDL with non-regular programs. Thus, we also show that such extensions tend to be more complex than standard PDL.

Keywords : Propositional Dynamic Logic Visibly Pushdown Automata

Author: Christof Loeding - Carsten Lutz - Olivier Serre -



Related documents