μ-Calculus Model Checking in Maude

Abstract

In this paper, a rewrite theory for checking μ-calculus properties is developed. We use the same framework proposed in [Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth International Workshop on Rewriting Logic, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002] 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 [Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth International Workshop on Rewriting Logic, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002] in theory. We also develop a CTL to μ-calculus translator to help users write CTL specifications more easily. However, the corresponding LTL to μ-calculus translator is missing. The LTL model checker in [Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth International Workshop on Rewriting Logic, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002] is still preferred in practice.