μ-Calculus Model Checking in Maude

Bow-Yaw Wang
2005 Electronical Notes in Theoretical Computer Science  
In this paper, a rewrite theory for checking µ-calculus properties is developed. We use the same framework proposed in [11] and demonstrate how rewriting logic can be used as a unified formalism from model specification to verification algorithm implementation. Furthermore, since µ-calculus is more expressive than LTL, this work can be seen as an extension to [11] in theory. We also develop a CTL to µ-calculus translator to help users write CTL specifications more easily. However, the
more » ... ing LTL to µ-calculus translator is missing. The LTL model checker in [11] is still preferred in practice.
doi:10.1016/j.entcs.2004.06.025 fatcat:v3pyfjcb5bh5pd755t3hd26izi