Abstract. Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possiblyinfinite 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 of 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.
The reachability problem for callby-name programs is an instance of the higher-order model checking, and (n−1)-EXPTIME complete for order-n programs REF .
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
LMCS 7 (4:9) 2011
Computer Science Mathematics