In this paper we give some abstractions that preserve sublanguages of the universal part of the branching-time µ-calculus Lµ. We first extend some results by Loiseaux et al. by using a different abstraction for the universal fragments of Lµ which are treated in their work. We show that this leads to a more elegant theoretical treatment and more practical verification methodology. After that, we define an abstraction for a universal fragment of Lµ in which the formulas can contain the -operator only under an even number of negations. The abstraction we propose is inspired by the work of Loiseaux et al., and Kesten and Pnueli. From the former we use the approach based on Galois connections, while from the latter we borrow the idea of "rewriting" the original formula using contracting/expanding abstractions. We argue that, besides removing some unnecessary syntactic restrictions, our approach leads to more compact and practical solutions to the abstraction problems.
Keywords: abstraction, property preservation, mu-calculus, model checking.
|Title of host publication||FM 2005: Formal Methods (International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005, Proceedings)|
|Editors||J. Fitzgerald, I.J. Hayes, A. Tarlecki|
|Place of Publication||Berlin|
|Publication status||Published - 2005|
|Name||Lecture Notes in Computer Science|