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.
Domaines
Informatique et langage [cs.CL]
Loading...