Abstract
We address the problem of relating the result of model checking a partial state space of a system to the properties actually possessed by the system. We represent incomplete state spaces as partial Kripke structures, and give a 3-valued interpretation to modal logic formulas on these structures. The third truth value ? means “unknown whether true or false”. We define a preorder on partial Kripke structures that reflects their degree of completeness. We then provide a logical characterization of this preorder. This characterization thus relates properties of less complete structures to properties of more complete structures. We present similar results for labeled transition systems and show a connection to intuitionistic modal logic. We also present a 3-valued CTL model checking algorithm, which returns ? only when the partial state space lacks information needed for a definite answer about the complete state space.
Chapter PDF
Similar content being viewed by others
References
S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proceedings of CAV’ 92, LNCS 663, pages 260–273, 1992.
[BCM+90]_ J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the 5th Symposium on Logic in Computer Science, pages 428–439, Philadelphia, June 1990.
E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer-Verlag, 1981.
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, 8(2):244–263, January 1986.
Rance Cleaveland and Bernhard Steffen. When is “partial” adequate? A logic-based proof technique using partial specifications. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1990.
E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier/MIT Press, Amsterdam/Cambridge, 1990.
Melvin Fitting. Many-valued modal logics II. Fundamenta Informaticae, 17:55–73, 1992.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, 1985.
Stephen Cole Kleene. Introduction to Metamathematics. North Holland, 1987.
D. Kozen. Results on the Propositional Mu-Calculus. Theoretical Computer Science, 27:333–354, 1983.
R. Milner. A Modal Characterization of Observable Machine Behavior. In Proc. CAAP’81, volume 112 of Lecture Notes in Computer Science, pages 25–34. Springer-Verlag, 1981.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30(1):130–137, 1989.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
D. M. R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1981.
T. Sasao. Ternary Decision Diagrams-A Survey. In Proc. IEEE International Symposium on Multiple-Valued Logic, pages 241–250, Nova Scotia, May 1997.
Krister Segerberg. Some modal logics based on a three-valued logic. Theoria, 33:53–71, 1967.
Colin Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:331–347, 1987.
M.Y. Vardi. Why is modal logic so robustly decidable? In Proceedings of DIMACS Workshop on Descriptive Complexity and Finite Models. AMS, 1997.
J. van Bentham. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic Vol. II. Reidel, 1984.
D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202–241, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruns, G., Godefroid, P. (1999). Model Checking Partial State Spaces with 3-Valued Temporal Logics. In: Halbwachs, N., Peled, D. (eds) Computer Aided Verification. CAV 1999. Lecture Notes in Computer Science, vol 1633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48683-6_25
Download citation
DOI: https://doi.org/10.1007/3-540-48683-6_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66202-0
Online ISBN: 978-3-540-48683-1
eBook Packages: Springer Book Archive