Abstract
We present an algebraic approach to the model checking of fault-tolerant systems. Fault models and fault-handling mechanisms are modelled using special-purpose process operators. Besides providing for natural models, special-purpose operators allow systems with large state spaces to be verified using systems with small state spaces. To support this verification technique we show that a kind of simulation relation on processes preserves all process operators in tyft/tyxt format.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bowen Alpern and Fred B. Schneider. Recognizing safety and liveness. Distributed Computing, 2:117–126, 1987.
Michael Barborak, Miroslaw Malek, and Anton Dahbura. The consensus problem in fault-tolerant computing. ACM Computing Surveys, 25(2):171–220, June 1993.
S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proceedings of CAV '92, LNCS 663, pages 260–273, 1992.
Bard Bloom. Structured operational semantics as a specification language. In Proceedings of LICS '94. IEEE Computer Society Press, 1994.
Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232–268, 1995.
Glenn Bruns. A case study in safety-critical design. In G.v. Bochmann and D.K. Probst, editors, Proceedings of CAV '91, LNCS 575, pages 220–233, 1991.
Glenn Bruns. Process Abstraction in the Verification of Temporal Properties. PhD thesis, University of Edinburgh, 1997.
R. Cleaveland, E. Madelaine, and S. Sims. Generating front ends for verification tools. In Proceedings of TACAS '95, LNCS 1019, pages 153–173, 1995.
R. Cleaveland and S. Sims. The NCSU concurrency workbench. In R. Alur and T. Henzinger, editors, Proceedings of CAV '96, 1996.
Rance Cleaveland, Gerard Lüttgen, V. Natarajan, and Steve Sims. Modeling and verifying distributed systems using priorities: A case study. Software Concepts and Tools, 15:50–62, 1996.
A.H. Cribbens. Solid-state interlocking (SSI): an integrated electronic signalling system for mainline railways. IEE Proceedings, 134(B3), 1987.
J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202–260, 1992.
D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, 1983.
Parag K. Lala. Fault Tolerant and Fault Testable Hardware Design. Prentice Hall, 1985.
Patrick Lincoln and John Rushby. The formal verification of an algorithm for interactive consistency under a hybrid fault model. In Proceedings of CAV '93, 1993.
Nancy A. Lynch. Multivalued possibilities mapping. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, pages 519–543, 1989. LNCS 430.
Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–320, 1990.
A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Maths, 5:285–309, 1955.
J. von Neumann. Probabilistic logics and synthesis of reliable organisms from unreliable components. Annals of Mathematical Studies, 34:43–98, 1956.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruns, G., Sutherland, I. (1997). Model checking and fault tolerance. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000462
Download citation
DOI: https://doi.org/10.1007/BFb0000462
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63888-9
Online ISBN: 978-3-540-69661-2
eBook Packages: Springer Book Archive