Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
verfasst von : Naoki Kobayashi, C. -H. Luke Ong
Erschienen in: Automata, Languages and Programming
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees generated by order-
n
recursion schemes is
n
-EXPTIME complete. We consider two subclasses of APT and investigate the complexity of the respective acceptance problems. The main results are that, for APT with a single priority, the problem is still
n
-EXPTIME complete; whereas, for APT with a disjunctive transition function, the problem is (
n
− 1)-EXPTIME complete. This study was motivated by Kobayashi’s recent work showing that the resource usage verification for functional programs can be reduced to the model checking of recursion schemes. As an application, we show that the resource usage verification problem is (
n
− 1)-EXPTIME complete.