Abstract

This paper studies the use of an equational variant of the modal ¯-calculus as a unified framework for efficient temporal logic model checking. In particular, we show how an expressive temporal logic, CTL , may be efficiently translated into the ¯-calculus. Using this translation, one may then employ ¯-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL . 1. Introduction Recent years have witnessed a surge of work on automatic approaches for establishing whether or not finite-state reactive systems satisfy specifications given in temporal logics [5, 8, 9, 14, 18, 21, 24, 26, 29]. Reactive systems typically maintain an ongoing interaction with their environments; temporal logics permit the formulation of requirements on a system's evolving behavior and hence are well-suited for specifying system properties. The task of verifying if a system satisfies ...

Citations