Abstract
The automated verification of concurrent and distributed systems is a vibrant and successful area within Computer Science. Over the last 30 years, temporal logic [10,20] has been shown to provide a clear, concise and intuitive description of many such systems, and automata-theoretic techniques such as model checking [7,14] have been shown to be very useful in practical verification. Recently, the verification of infinite-state systems, particularly parameterised systems comprising arbitrary numbers of identical processes, has become increasingly important [5]. Practical problems of an open, distributed nature often fit into this model, for example robot swarms of arbitrary sizes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J., Saksena, M.: Regular Model Checking for LTL(MSO). In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 348–360. Springer, Heidelberg (2004)
Abdulla, P.A., Jonsson, B., Rezine, A., Saksena, M.: Proving Liveness by Backwards Reachability. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 95–109. Springer, Heidelberg (2006)
Artale, A., Franconi, E., Wolter, F., Zakharyaschev, M.: A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS, vol. 2424, pp. 98–110. Springer, Heidelberg (2002)
Bjorner, N., Browne, A., Chang, E., Colon, M., Kapur, A., Manna, Z., Sipma, H.B., Uribe, T.E.: STeP: Deductive-Algorithmic Verification of Reactive and Real-time Systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 415–418. Springer, Heidelberg (1996)
Calder, M., Miller, A.: An Automatic Abstraction Technique for Verifying Featured, Parameterised Systems. Theoretical Computer Science (to appear)
Chkliaev, D., van der Stock, P., Hooman, J.: Mechanical Verification of a Non-Blocking Atomic Commitment Protocol. In: Proc. ICDCS Workshop on Distributed System Validation and Verification, pp. 96–103. IEEE, Los Alamitos (2000)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Degtyarev, A., Fisher, M., Konev, B.: Monodic Temporal Resolution. ACM Transactions on Computational Logic 7(1), 108–150 (2006)
Delzanno, G.: Constraint-based Verification of Parametrized Cache Coherence Protocols. Formal Methods in System Design 23(3), 257–301 (2003)
Emerson, E.A.: Temporal and Modal Logic. In: Handbook of Theoretical Computer Science, pp. 996–1072. Elsevier, Amsterdam (1990)
Esparza, J., Finkel, A., Mayr, R.: On the Verification of Broadcast Protocols. In: Proc. 14th IEEE Symp. Logic in Computer Science (LICS), pp. 352–359. IEEE CS Press, Los Alamitos (1999)
Fisher, M., Konev, B., Lisitsa, A.: Practical Infinite-state Verification with Temporal Reasoning. In: Verification of Infinite State Systems and Security. NATO Security through Science Series: Information and Communication, vol. 1. IOS Press, Amsterdam (2006)
Gabelaia, D., Kontchakov, R., Kurucz, A., Wolter, F., Zakharyaschev, M.: On the Computational Complexity of Spatio-Temporal Logics. In: Proc. 16th International Florida Artificial Intelligence Research Society Conference (FLAIRS), pp. 460–464. AAAI Press, Menlo Park (2003)
Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)
Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable Fragments of First-order Temporal Logics. Annals of Pure and Applied Logic 106, 85–134 (2000)
Hustadt, U., Konev, B., Riazanov, A., Voronkov, A.: TeMP: A Temporal Monodic Prover. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS, vol. 3097, pp. 326–330. Springer, Heidelberg (2004)
Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Mechanising First-order Temporal Resolution. Information and Computation 199(1-2), 55–86 (2005)
Lichtenstein, O., Pnueli, A.: Propositional Temporal Logics: Decidability and Completeness. International Journal of the IGPL 8, 55–85
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Manna, Z., Pnueli, A.: Temporal Logic of Reactive and Concurrent Systems. Springer, Heidelberg (1992)
Owre, S., Rushby, J., Shankar, N., von Henke, F.: Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS. IEEE Transactions on Software Engineering 21, 107–122
Röckl, C.: Proving write invalidate cache coherence with bisimulations in Isabelle/HOL. In: In Proc. of FBT 2000, Shaker, pp. 69–78 (2000)
Pnueli, A., Arons, T.: TLPVS: A PVS-based LTL verification system. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 598–625. Springer, Heidelberg (2004)
Wolter, F., Zakharyaschev, M.: Axiomatizing the Monodic Fragment of First-order Temporal Logic. Annals of Pure and Applied Logic 118(1-2), 133–145 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fisher, M., Konev, B., Lisitsa, A. (2009). Temporal Verification of Fault-Tolerant Protocols. In: Butler, M., Jones, C., Romanovsky, A., Troubitsyna, E. (eds) Methods, Models and Tools for Fault Tolerance. Lecture Notes in Computer Science, vol 5454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00867-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-00867-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00866-5
Online ISBN: 978-3-642-00867-2
eBook Packages: Computer ScienceComputer Science (R0)