Abstract
A model checker is described that supports proving logical properties of concurrent systems. The logical properties can be described in different action-based logics (variants of Hennessy-Milner logic). The tools is based on the EMC model checker for the logic CTL. It therefore employs a set of translation functions from the considered logics to CTL, as well as a model translation function from labeled transition systems (models of the action-based logics) to Kripke structures (models for CTL). The obtained tool performs model checking in linear time complexity, and its correctness is guaranteed by the proof that the set of translation functions, coupled with the model translation function, preserves satisfiability of logical formulae.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.A. Emerson, and J. Halpern. “Sometime” and “not never” revisited: On branching versus linear time temporal logic.Journal of ACM, 33(1): pp. 151–178, January 1986.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency.Journal of ACM, 32, (1): 137–161, January, 1985.
Z. Manna and A. Pnueli. The anchored version of the temporal framework. InLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency, J. de Bakker, P. de Roever, and G. Rozenberg (eds.).Lecture Notes in Computer Science, 354: 201–284, 1989.
M.C. Browne, E.M. Clarke, and O. Grümberg. Characterizing finite Kripke structures in propositional temporal logic.Theoretical Computer, Science, 59: 115–131, 1988.
E.A. Emerson and J. Srinivasan. Branching time temporal logic. InLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency, J. de Bakker, P. de Roever, and G. Rozenberg (eds.)Lecture Notes in Computer Science, 354: 123–172, 1989.
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2): 244–263, April 1986.
A. Boujani, S. Graf, and J. Sifakis: A logic for the description of behaviors and properties of concurrent systems. InLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency, J. de Bakker, P. de Roever, and G. Rozenberg, (eds.).Lecture Notes in Computer Science 354: 398–410, 1989.
C. Stirling. An introduction to modal and temporal logics for CCS. InConcurrency: Theory, Language, and Architecture, A. Yonezawa and T. Ito (eds.).Lecture Notes in Computer Science, 491: 2–20, 1990.
R. De Nicola and F. Vaandrager. Three logics for branching bisimulations.Proceedings of the 5th Annual Symposium on Logic in Computer Science (LICS ′90) Philadelphia, PA, June, 1990. IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 118–129. To appear also inJournal of ACM.
R. De Nicola and F. Vaandrager. Action versus state based logics for transition systems.Proceedings Ecole de Printemps on Semantics of Concurrency, April 1990, I. Guessarian (ed.).Lecture Notes in Computer Science, 469: 407–419, 1990.
K.G. Larsen. Proof systems for satisfiability in Hennessy-Milner logic with recursion.Theoretical Computer Science, 72(2): 265–288, 1990.
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench. InAutomatic Verification Methods for Finite State Systems, J. Sifakis (ed.).Lecture Notes in Computer Science, 407: 24–37, 1990.
R. Cleaveland, and B. Steffen. A linear-time model checking algorithm, for the alternation free modal mu-calculus.Formal Methods in System Design, 2: 121–147, 1993.
D. Park. Concurrency and automata on infinite sequences.Proceedings 5th GI Conference. Lecture Notes in Computer Science 104: 167–183, 1981.
R. Milner. A calculus of communicating systems.Lecture Notes in Computer Science, 92, 1980.
R. Milner. Calculi for synchrony and asynchrony.Theoretical Computer Science, 25(3): 267–310, 1983.
R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. InInformation Processing ′89, G.X. Ritter (ed.). North Holland, Amsterdam, 1989, pp. 613–618.
B. Jonsson, A.H. Khan and J. Parrow. Implementing a model checking algorithm, by adapting existing automated tools. InAutomatic Verification Methods for Finite State Systems, J. Sifakis (ed.). Lecture Notes in Computer Science, 407: 179–188, 1990.
R. De Nicola, A. Fantechi, S. Gnesi, and G. Ristori. An action-based framework for verifying logical and behavioral properties of concurrent systems.Computer Networks and ISDN Systems, 25: 761–778, 1993.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond.Proceedings of the 5th Annual Symposium on Logic in Computer Science (LICS ′90), Philadelphia, USA, June 1990 IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 428–439.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fantechi, A., Gnesi, S. & Ristori, G. Model checking for action-based logics. Form Method Syst Des 4, 187–203 (1994). https://doi.org/10.1007/BF01384084
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01384084