Abstract
In this methodological paper we present a coherent framework for symbolic model checking verification of linear-time temporal logic (ltl) properties of reactive systems, taking full fairness into consideration. We use the computational model of a fair Kripke structure (fks) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model checking problem into the question of whether a given FKS is feasible (i.e. has at least one computation).
The contribution of the paper is twofold: On the methodological level, it presents a direct self-contained exposition of full ltl symbolic model checking without resorting to reductions to either ctl or automata. On the technical level, it extends previous methods by dealing with compassion at the algorithmic level instead of adding it to the specification, and providing the first symbolic method for checking feasibility of fks's (equivalently, symbolically checking for the emptiness of Streett automata).
The presented algorithms can also be used (with minor modifications) for symbolic model-checking of ctl formulas over fair Kripke structures with compassion requirements.
This research was supported in part by an infra-structure grant from the Israeli Ministry of Science and Art and a gift from Intel.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142–170, 1992.
E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, volume 131 of Lect. Notes in Comp. Sci., pages 52–71. Springer-Verlag, 1981.
E.M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at ltl model checking. In D. L. Dill, editor, Proc. 6th Conference on Computer Aided Verification, volume 818 of Lect. Notes in Comp. Sci., pages 415–427. Springer-Verlag, 1994.
E.A. Emerson and C.L. Lei. Modalities for model checking: Branching time strikes back. In Proc. 12th ACM Symp. Princ. of Prog. Lang., pages 84–96, 1985.
N. Francez. Fairness. Springer-Verlag, 1986.
D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. Princ. of Prog. Lang., pages 163–173, 1980.
R. H. Hardin, R. P. Kurshan, S. K. Shukla, and M. Y. Vardi. A new heuristic for bad cycle detection using BDDs. In O. Grumberg, editor, Proc. 9th Intl. Conference on Computer Aided Verification (CAV'97), Lect. Notes in Comp. Sci., pages 268–278. Springer-Verlag, 1997.
M. R. Henzinger and J. A. Telle. Faster algorithms for the nonemptiness of street automata and for communication protocol prunning. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, pages 10–20, 1996.
O. Lichtenstein. Decidability, Completeness, and Extensions of Linear Time Temporal Logic. PhD thesis, Weizmann Institute of Science, 1991.
O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symp. Princ. of Prog. Lang., pages 97–107, 1985.
D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In Proc. 8th Int. Colloq. Aut. Lang. Prog., volume 115 of Lect. Notes in Comp. Sci., pages 264–277. Springer-Verlag, 1981.
O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Proc. Conf. Logics of Programs, volume 193 of Lect. Notes in Comp. Sci., pages 196–218. Springer-Verlag, 1985.
Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83(1):97–130, 1991.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In R. Alur and T. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification (CAV'96), Lect. Notes in Comp. Sci., pages 184–195. Springer-Verlag, 1996.
J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in cesar. In M. Dezani-Ciancaglini and M. Montanari, editors, International Symposium on Programming, volume 137 of Lect. Notes in Comp. Sci., pages 337–351. Springer-Verlag, 1982.
F.A. Stomp, W.-P. de Roever, and R.T. Gerth. The Μ-calculus as an assertion language for fairness arguments. Inf. and Comp., 82:278–322, 1989.
M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 332–344, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kesten, Y., Pnueli, A., Raviv, Lo. (1998). Algorithmic verification of linear temporal logic specifications. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055036
Download citation
DOI: https://doi.org/10.1007/BFb0055036
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive