Abstract

This paper describes a method for translating a satisfaction problem of the modal μ-calculus into a problem of finding a certain marking of a boolean graph. By giving algorithms to solve the graph problem, we present a global model checking algorithm for the modal μ-calculus of alternation depth one, which has time-complexity ¦A¦¦T¦, where ¦A¦ is the size of the assertion and ¦T¦ is the size of the model (a labelled transition system). This algorithm extends to an algorithm for the full modal μ-calculus which runs in time (¦A¦¦T¦)ad, where ad is the alternation depth, improving on earlier presented algorithms. Moreover, a local algorithm is presented for alternation depth one, which runs in time ¦A¦¦T¦log(¦A¦¦T¦), improving on the earlier published algorithms that are all at least exponential.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.