Abstract
We present a local algorithm for model checking in a real-time extension of the modal mu-calculus. As such, the whole state space of the real-time system under investigation need not be explored, but rather only that portion necessary to determine the truthhood of the logical formula. To the best of our knowledge, this is the first local algorithm for the verification of real-time systems to appear in the literature.
Like most algorithms dealing with real-time systems, we work with a finite quotient of the inherently infinite state space. For maximal efficiency, we obtain, on-the-fly, a quotient that is as coarse at possible in the following sense: refinements of the quotient are carried out only when necessary to satisfy clock constraints appearing in the logical formula or timed automaton used to represent the system under investigation. In this sense, our data structures are optimal with respect to the given formula and automaton.
Research supported in part by NSF Grants CCR-9120995 and CCR-9208585, and AFOSR Grant F49620-93-1-0250.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. “An Implementation of Three Algorithms for Timing Verification Based on Automata Emptiness”. In Proceedings of IEEE Real-Time Symposium. IEEE Computer Society Press, 1992.
R. Alur, C. Courcoubetis, and D. Dill. “Model-Checking for Real-Time Systems”. Information and Computation, 104(1):2–34, 1993.
R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. “Minimization of Timed Transition Systems”. In Proceedings of CONCUR'92. LNCS 630, 1992.
R. Alur and D. L. Dill. “The Theory of Timed Automata”. Theoretical Comput. Sci., 126(2), 1994.
R. Alur. Techniques for Authomatic Verification of Real-Time Systems. PhD thesis, Stanford University, 1991.
H. R. Andersen. “Model Checking and Boolean Graphs”. Theoretical Comput. Sci., 126(1), 1994.
A. Bouajjani, J.-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. “Minimal State Graph Generation”. Sci. Comput. Programming, 18(3):247–269, 1992.
O. Bernholz, M. Y. Vardi, and P. Wolper. “An Automata-Thoeretic Approach to Branching-Time Model Checking”. In Proceedings of CAV'94. LNCS 818, 1994.
P. Cousot and R. Cousot. “Constructive Versions of Tarski's Fixed Point Theorems”. Pacific J. Math., 82(1):43–57, 1979.
E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. LNCS 131, 1981.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. “Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications”. ACM Trans. Prog. Lang. Syst., 8(2), 1986.
R. Cleaveland, J. N. Gada, P. M. Lewis, S. A. Smolka, O. V. Sokolsky, and S. Zhang. “The Concurrency Factory — Practical Tools for Specification, Simulation, Verification and Implementation of Concurrent Systems”. In Proceedings of the DIMACS Workshop on Specification Techniques for Concurrent Systems, Princeton, NJ, 1994.
R. Cleaveland. “Tableau-Based Model Checking in the Propositional Mu-Calculus”. Acta Inf., 27, 1990.
R. Cleaveland, J. Parrow, and B. Steffen. “The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems”. ACM TOPLAS, 15(1), 1993.
R. Cleaveland and B. Steffen. “A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus”. Formal Methods in System Design, 2, 1993.
D. Dill. “Timing Assumptions and Verification of Finite-State Concurrent Systems”. In Proceedings of CAV'89. LNCS 407, 1989.
E. A. Emerson, C. S. Jutla, and A. P. Sistla. “On Model Checking for Fragments of μ-calculus”. In Proceedings of CAV'93. LNCS 697, 1993.
E. A. Emerson and C.-L. Lei. “Efficient Model Checking in Fragments of the Propositional Mu-Calculus”. In Proceedings LICS '86. IEEE Computer Society Press, 1986.
E. A. Emerson. “Real-Time and the Mu-Calculus”. In Real-Time: Theory in Practice. LNCS 600, 1991.
U. Holmer, K. G. Larsen, and Y. Wang. “Deciding Properties of Regular Real Timed Processes”. In Proceedings of CAV'91. LNCS 575, 1991.
T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. “Symbolic Model Checking for Real-time Systems”. Information and Computation, 111(2), 1994.
D. Kozen. “Results on the Propositional Mu-Calculus”. Theoretical Comput. Sci., 27:333–354, 1983.
K. G. Larsen. “Efficient Local Correctness Checking”. In Proceedings of CAV'92. LNCS 663, 1992.
O. Sokolsky and S. A. Smolka. “Incremental Model Checking in the Modal Mu-Calculus”. In Proceedings of CAV'94. LNCS 818, 1994.
C. Stirling and D. Walker. “Local Model Checking in the Modal Mu-Calculus”. Theoretical Comput. Sci., 89(1), 1991.
B. Vergauwen, J. Lewi, I. Avau, and A. Pote. “Efficient Computation of Nested Fix-Points, with applications to Model Checking”. In Proceedings of ICTL'94, 1st Intl. Conference on Temporal Logic. LNCS 827, 1994.
M. Y. Vardi and P. Wolper. “An Automata-Theoretic Approach to Automatic Program Verification”. In Proceedings of LICS'86, pages 322–331. IEEE Computer Society Press, 1986.
Y. Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, 1991.
M. Yannakakis and D. Lee. “An Efficient Algorithm for Minimizing Real-Time Transition Systems”. In Proceedings of CAV'93. LNCS 697, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokolsky, O.V., Smolka, S.A. (1995). Local model checking for real-time systems. In: Wolper, P. (eds) Computer Aided Verification. CAV 1995. Lecture Notes in Computer Science, vol 939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60045-0_52
Download citation
DOI: https://doi.org/10.1007/3-540-60045-0_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60045-9
Online ISBN: 978-3-540-49413-3
eBook Packages: Springer Book Archive