Propositional Dynamic Logic with Recursive Programs

  • Christof Löding
  • Olivier Serre
Conference paper

DOI: 10.1007/11690634_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3921)
Cite this paper as:
Löding C., Serre O. (2006) Propositional Dynamic Logic with Recursive Programs. In: Aceto L., Ingólfsdóttir A. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2006. Lecture Notes in Computer Science, vol 3921. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christof Löding
    • 1
  • Olivier Serre
    • 2
  1. 1.RWTH AachenGermany
  2. 2.LIAFAFrance

Personalised recommendations