Göller, StefanLohrey, Markus2006-02-102016-03-312006-02-102016-03-312006261199080http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-25399http://elib.uni-stuttgart.de/handle/11682/2588http://dx.doi.org/10.18419/opus-2571Model-checking problems for propositional dynamic logic (PDL) and its extension PDL$^\cap$ (which includes the intersection operator on programs) over various classes of infinite state systems (BPP, BPA, pushdown systems, prefix-recognizable systems) are studied. Precise upper and lower bounds are shown for the data/expression/combined complexity of these model-checking problems.eninfo:eu-repo/semantics/openAccessUnendlicher Zustandsraum , Model checking , Dynamische Aussagenlogik004pushdown system , prefix-recognizable system , basic process algebraworkingPaper2013-07-08