Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2571
Authors: Göller, Stefan
Lohrey, Markus
Title: Infinite state model checking of propositional dynamic logics
Issue Date: 2006
metadata.ubs.publikation.typ: Arbeitspapier
Series/Report no.: Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2006,4
URI: http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-25399
http://elib.uni-stuttgart.de/handle/11682/2588
http://dx.doi.org/10.18419/opus-2571
Abstract: Model-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.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR_2006_04.pdf333,34 kBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.