Propositional Dynamic Logic with Recursive Programs - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Algebraic Programming Année : 2007

Propositional Dynamic Logic with Recursive Programs

Résumé

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.
Fichier principal
Vignette du fichier
recpdl.pdf (297.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00153571 , version 1 (11-06-2007)

Identifiants

Citer

Christof Loeding, Carsten Lutz, Olivier Serre. Propositional Dynamic Logic with Recursive Programs. Journal of Logic and Algebraic Programming, 2007, 73 (1-2), pp.51-69. ⟨10.1016/j.jlap.2006.11.003⟩. ⟨hal-00153571⟩
76 Consultations
547 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More