Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

Details Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

2011-09-24

arxiv.org/abs/1109.5267v2

LMCS 7 (4:9) 2011

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-7(4:9)2011

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 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.

Affiliated with

Also associated with

No associations

Rating

Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602655