Abstract
In this paper, we study a formal characterization of fault-tolerant behaviors of systems via simulation relations. This formalization makes use of particular notions of simulation and bisimulation in order to compare the executions of a system that exhibit faults with executions where no faults occur. By employing variations of standard (bi)simulation algorithms, our characterization enables us to algorithmically check fault-tolerance, i.e., to verify that a system behaves in an acceptable way even under the occurrence of faults.
Our approach has the benefit of being simple and supporting an efficient automated treatment. We demonstrate the practical application of our formalization through some well-known case studies, which illustrate that the main ideas behind most fault-tolerance mechanisms are naturally captured in our setting.
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
Alpern, B., Schneider, F.: Defining Liveness. Inf. Process. Lett. 21(4) (1985)
Milner, R.: Communication and Concurrency. PHI Series in Computer Science. Prentice-Hall (1989)
Arora, A., Gouda, M.: Closure and Convergence: A Foundation of Fault-Tolerant Computing. IEEE Trans. Soft. Eng. 19(11) (1993)
Arora, A., Kulkarni, S.: Component Based Design of Multitolerant Systems. IEEE Trans. Software Eng. 24(1) (1998)
Arora, A., Kulkarni, S.: Detectors and Correctors: A Theory of Fault-Tolerance Components. In: Proc. of ICDCS (1998)
Attie, P., Arora, A., Emerson, A.: Synthesis of fault-tolerant concurrent programs. ACM Trans. Program. Lang. Syst. 26(1) (2004)
Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)
Castro, P.F., Kilmurray, C., Acosta, A., Aguirre, N.: dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 106–121. Springer, Heidelberg (2011)
Cristian, F.: A rigorous approach to fault-tolerant programming. IEEE Trans. Software Eng. (1985)
Demasi, R., Castro, P., Maibaum, T., Aguirre, N.: Characterizing Fault-Tolerant Systems by Means of Simulation Relations, Tech. Report, http://www.cas.mcmaster.ca/~demasira/reportSimFTS.pdf
Henzinger, M., Henzinger, T., Kopke, P.: Computing Simulations on Finite and Infinite Graphs. In: Proc. of FOCS (1995)
Janowski, T.: Bisimulation and Fault-Tolerance. PhD thesis (1995)
Janowski, T.: On Bisimulation, Fault-Monotonicity and Provable Fault-Tolerance. In: Proc. of AMAST (1997)
Mead, C., Conway, L.: Introduction to VLSI systems. Addison-Wesley (1980)
Pnueli, A., Rosner, R.: On the Synthesis of a Reactive Module. In: Proc. of POPL (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demasi, R., Castro, P.F., Maibaum, T.S.E., Aguirre, N. (2013). Characterizing Fault-Tolerant Systems by Means of Simulation Relations. In: Johnsen, E.B., Petre, L. (eds) Integrated Formal Methods. IFM 2013. Lecture Notes in Computer Science, vol 7940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38613-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-38613-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38612-1
Online ISBN: 978-3-642-38613-8
eBook Packages: Computer ScienceComputer Science (R0)