Abstract
We present an incremental algorithm for model checking in the alternation-free fragment of the modal mu-calculus, the first incremental algorithm for model checking of which we are aware. The basis for our algorithm, which we call MCI (for Model Checking Incrementally), is a linear-time algorithm due to Cleaveland and Steffen that performs global (non-incremental) computation of fixed points. MCI takes as input a set δ of change) to the labeled transition system under investigation, where a change constitutes an inserted or deleted transition; with virtually no additional cost, inserted and deleted states can also be accommodated. Like the Cleaveland-Steffen algorithm, MCI requires time linear in the size of the LTS in the worst case, but only time linear in δ in the best case. We give several examples to illustrate MCI in action, and discuss its implementation in the Concurrency Factory, an interactive design environment for concurrent systems.
Research supported in part by NSF Grants CCR-9120995 and CCR-9208585, and AFOSR Grant F49620-93-1-0250DEF.
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
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. “Incremental Evaluation of Computational Circuits”. In Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990.
H. R. Andersen. “Model Checking and Boolean Graphs”. In Proceedings of ESOP'92. LNCS 582, 1992.
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., May 1994.
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.
E. A. Emerson and C.-L. Lei. “Efficient Model Checking in Fragments of the Prepositional Mu-Calculus”. In Proc. LICS '86. IEEE Computer Society Press, 1986.
S. M. Hecht. Flow Analysis of Computer Programs. Elsevier, North Holland, 1977.
D. Kozen. “Results on the Propositional Mu-Calculus”. Theoretical Computer Science, 27:333–354, 1983.
K. G. Larsen. “Efficient Local Correctness Checking”. In Proceedings of CAV'92, 1992.
R. Milner. A Calculus of Communicating Systems. LNCS 92, 1980.
L. L. Pollock and M. L. Soffa. “An Incremental Version of Iterative Data Flow Analysis”. IEEE Trans. Software Engineering, 15(12), 1989.
G. Ramalingam. Bounded Incremental Computation. PhD thesis, Computer Sciences Dept., University of Wisconsin-Madison, 1993.
B. G. Ryder, T. J. Marlowe, and M. C. Paull. “Conditions for Incremental Iteration: Examples and Counterexamples”. Sci. Program., 11(1), 1988.
G. Ramalingam and T. Reps. “On the Computational Complexity of Incremental Algorithms”. Technical Report TR-1033, Computer Sciences Dept., University of Wisconsin-Madison, 1991.
B. Steffen. “Data Flow Analysis as Model Checking”. In Proc. TACS'91. LNCS 526, 1991.
C. Stirling and D. Walker. “Local Model Checking in the Modal Mu-Calculus”. Theoretical Computer Science, 89(1), 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokolsky, O.V., Smolka, S.A. (1994). Incremental model checking in the modal mu-calculus. In: Dill, D.L. (eds) Computer Aided Verification. CAV 1994. Lecture Notes in Computer Science, vol 818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58179-0_67
Download citation
DOI: https://doi.org/10.1007/3-540-58179-0_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58179-6
Online ISBN: 978-3-540-48469-1
eBook Packages: Springer Book Archive