Infinite State ModelChecking of Propositional Dynamic Logics.pdfVIP

Infinite State Model-Checking of Propositional Dynamic Logics Stefan G¨oller and Markus Lohrey FMI, Universit¨at Stuttgart, Germany {goeller, lohrey}@informatik.uni-stuttgart.de Abstract. Model-checking problems for PDL (propositional dynamic logic) and its extension PDL∩ (which includes the intersection operator on programs) over various classes of infinite state systems (BPP, BPA, pushdown systems, prefix-recognizable systems) are studied. Precise up- per and lower bounds are shown for the data/expression/combined com- plexity of these model-checking problems. 1 Introduction Propositional Dynamic Logic (PDL) was introduced by Fischer and Ladner in 1979 as a modal logic for reasoning about programs [10]. In PDL, there are two syntactic entities: formulas and programs. Formulas are interpreted in nodes of a Kripke structure and can be built up from atomic propositions using boolean connectives. Programs are interpreted by binary relations over the node set of a Kripke structure and can be built up from atomic programs using the operations of union, composition, and Kleene hull (reflexive transitive closure). PDL con- tains two means for connecting formulas and programs: Programs may appear in modalities in front of formulas, i.e., if π is a program and ϕ is a formula, then πϕ is true in a node u if there exists a node v , where ϕ holds and which can be reached from u via the program π . Moreover, PDL allows to construct programs from formulas using the test operator: If ϕ is a formula, then the program ϕ? is the identity relation on the node set restricted to those nodes where ϕ holds. Since its invention, many different extensions of PDL were proposed, mainly by allowing further operators on programs, like for instance the co