Improved Algorithm of Global Model-Checking for Propositional μ-Calculus
2012 ◽
Vol 263-266
◽
pp. 2314-2319
Keyword(s):
Based on the research of the author when he was a Ph.D. student, he deeply studied the proposition of μ-Calculus, and used solving the partial ordering relation in formula μ-Calculus to solve formula μ-Calculus quickly. This paper improves and perfects the algorithm in reference [11]. The time complexity of the algorithm in this paper is O((2n+1)^(d/2+1)), its space complexity is O(dn), where n is the number of states in the transition system and d is the nesting depth of fixpoint operators in the formula of proposition μ-Calculus.
Keyword(s):
Keyword(s):
2014 ◽
Vol 644-650
◽
pp. 1891-1894
Keyword(s):
2012 ◽
Vol 38
(6)
◽
pp. 294-303
◽
Keyword(s):
2008 ◽
Vol 18
(05)
◽
pp. 683-712
◽
Keyword(s):