Bibliograph. Daten | Göller, Stefan; Lohrey, Markus: Fixpoint logics on hierarchical structures. Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Technischer Bericht Informatik Nr. 2005/04. 38 Seiten, englisch.
|
CR-Klassif. | F.1.3 (Complexity Measures and Classes) F.4.1 (Mathematical Logic)
|
Keywords | parity games; mu-calculus; hierarchical structures; lfp; mlfp; model checking |
Kurzfassung | Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions also allow to specify graphs of exponential size using polynomial size descriptions. In many cases, this succinctness increases the computational complexity of decision problems. In this paper, the model-checking problem for the modal $\mu$-calculus and (monadic) least fixpoint logic on hierarchically defined input graphs is investigated. In order to analyze the modal $\mu$-calculus, parity games on hierarchically defined input graphs are investigated. In most cases precise upper and lower complexity bounds are derived. A restriction on hierarchical graph definitions that leads to more efficient model-checking algorithms is presented.
|
Volltext und andere Links | PDF (321585 Bytes) PostScript (702529 Bytes)
|
Kontakt | goeller@informatik.uni-stuttgart.de lohrey@informatik.uni-stuttgart.de |
Abteilung(en) | Universität Stuttgart, Institut für Formale Methoden der Informatik, Theoretische Informatik
|
Eingabedatum | 24. Juni 2005 |
---|