Fifth International Conference on Information Technology: New Generations (itng 2008)
An Improved Algorithm for the Evaluation of Alternating Fixpoint Expressions in the mu-Calculus
April 07-April 09
ISBN: 978-0-7695-3099-4
Based on the function monotonicity in the mu-calculus formula, this paper presents a global model-checking algorithm for calculating the alternating nesting mu- calculus formula, whose time complexity is O((2n+1)^((d+3)/4+(d+2)/4)) and space complexity is O(dn). It is the first known algorithm whose space complexity is O(dn)and the exponent part of time complexity is d/2 for a global model-checking algorithm in the full calculus formula at present.
Index Terms:
Model Checking, mu-Calculus, calculation complexity, NP and co-NP problem
Citation:
Hua Jiang, Xiang Li, "An Improved Algorithm for the Evaluation of Alternating Fixpoint Expressions in the mu-Calculus," itng, pp.1245-1248, Fifth International Conference on Information Technology: New Generations (itng 2008), 2008