Abstract
We present a polytime computable state equivalence that is defined with respect to a given CTL formula. Since it does not attempt to preserve all CTL formulas, like bisimulation does, we can expect to compute coarser equivalences. This equivalence can be used to reduce the complexity of model checking a system of interacting FSMs. Additionally, we show that in some cases our techniques can detect if a formula passes or fails, without forming the entire product machine. The method is exact and fully automatic, and handles full CTL.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Aziz, T.R. Shiple, V. Singhal, and A.L. Sangiovanni-Vincentelli, “Formula-dependent equivalence for compositional CTL model checking,” in Proc. of the Computer Aided Verification Conf, 1994.
A. Aziz, V. Singhal, and R.K. Brayton, “Verifying interacting finite state machines,” Technical Report UCB/ERL M93/52, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, 1993.
A. Bouajjani, J. Fernandez, and N. Halbwachs, “Minimal model generation,” in E. Clarke and R. Kurshan (Eds.), Proc. of CAV 1990, Vol. 531 of Lecture Notes in Computer Science, 1990.
M.C. Browne, E.M. Clarke, and O. Grumberg, “Characterizing finite Kripke structures in propositional temporal logic,” Theoretical Computer Science, Vol. 59, pp. 115–131, 1988.
M. Chiodo, T.R. Shiple, and A.L. Sangiovanni-Vincentelli, “Automatic compositional minimization in CTL model checking,” in Proc. Intl. Conf. on Computer-Aided Design, 1992, pp. 172–178.
E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,” ACM Transactions on Programming Languages and Systems, Vol. 8, No. 2, pp. 244–263, 1986.
E.M. Clarke, D.E. Long, and K.L. McMillan, “Compositional model checking,” in 4th Annual Symposium on Logic in Computer Science. Asilomar, CA, 1989.
D. Dams, O. Grümberg, and R. Gerth, “Generation of reduced models for fragments of CTL,” in Proc. of the Computer Aided Verification Conf, 1993.
C. Eisner, D. Geist, I. Beer, and R. Gerwitzmann, “Industrial strength formal verification,” in Computer Aided Verification, Vol. 818 of Lecture Notes in Computer Science, 1994.
E.A. Emerson, “Temporal and modal logic,” in J. van Leeuwen (Ed.), Formal Models and Semantics, Vol. B of Handbook of Theoretical Computer Science. Elsevier Science, 1990, pp. 996–1072.
E.A. Emerson and C.L. Lei, “Modalities for model checking: Branching time strikes back,” in Proc. ACM Symposium on Principles of Programming Languages, 1985, pp. 84–96.
O. Grumberg and D. Long, “Model checking and modular verification,” ACM Transactions on Programming Languages and Systems, Vol. 16, No. 3, pp. 843–871, 1994.
O. Grumberg and D.E. Long, “Model checking and modular verification,” in J.C.M. Baeten and J.F. Groote (Eds.), Proc. ofCONCUR'91: 2nd Inter. Conf. on Concurrency Theory,Vol. 527 of Lecture Notes in Computer Science, 1991.
R. Milner, Communication and Concurrency, New York, Prentice Hall, 1989.
T.R. Shiple, R. Hojati, A.L. Sangiovanni-Vincentelli, and R.K. Brayton, “Heuristic minimization of BDDs using don't cares,” in Proc. of the Design Automation Conf., San Diego, CA, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aziz, A., Shiple, T., Singhal, V. et al. Formula-Dependent Equivalence for Compositional CTL Model Checking. Formal Methods in System Design 21, 193–224 (2002). https://doi.org/10.1023/A:1016043502772
Issue Date:
DOI: https://doi.org/10.1023/A:1016043502772