Skip to main content

Formal reasoning on fault coverage of fault tolerant techniques: A case study

  • Session 2: Formal methods
  • Conference paper
  • First Online:
Dependable Computing — EDCC-1 (EDCC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 852))

Included in the following conference series:

  • 129 Accesses

Abstract

In this paper we show how a formal reasoning can be applied for studying the fault coverage of a fault tolerant technique when the behaviour of a system with a set of predefined faults is considered. This method is based on process algebras and equivalence theory. The behaviour of the system in absence of faults is formally specified and faults are assumed as random events which interfere with the system by modifying its behaviour. A fault tolerant technique can be proved to tolerate the set of predefined faults iff the actual behaviour of the system is the same as the behaviour of the system in absence of faults. The approach is illustrated by considering the design of a stable storage disk.

This work was partly supported by the Italian Ministry of University and Scientific and Technologic Research (MURST-40%).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bernardeschi, C., Fantechi, A., Simoncini, L.: A formal framework for verifying fault tolerant systems. Internal Report IR-BFS1-93, Department of Information Engineering, University of Pisa (1993) (available on request from the authors)

    Google Scholar 

  2. Bolognesi, T., Brinksma, E.: Introduction to the ISO specification language LO-TOS. The Formal Description Technique LOTOS, Elsevier Science Publishers B.V., North-Holland (1989) 23–73

    Google Scholar 

  3. Bouali, A., De Simone, R.: Symbolic bisimulation minimisation. Proc. Computer Aided Verification '92, LNCS 663 (1992) 96–108

    Google Scholar 

  4. Cau, A., de Roever, W.: Specifying fault tolerance within Stark's formalism. Proc. FTCS'23, Toulouse, France (1992) 392–401

    Google Scholar 

  5. Cristian, F.: A rigorous approach to fault tolerant programming. IEEE Transaction on Software Engineering, 11 (1), (1985) 23–31

    Google Scholar 

  6. De Boer, F.S., Coenen J., Gerth R.: Exception handling in process algebra. Proc. 1st North American Process Algebra Workshop, Workshop in Computing Series, Springer-Verlag (1993)

    Google Scholar 

  7. De Nicola, R.: Extensional equivalences for transition systems. Acta Informatica 24 (1987) 211–237

    Article  Google Scholar 

  8. De Simone, R., Vergamini, D.: Aboard AUTO. Technical Report RT111, INRIA (1989)

    Google Scholar 

  9. van Eijk, P.: Tool demonstration:the Lotosphere Integrated Tool Environment LITE. Formal Description Techniques, IV, North-Holland (1992) 471–474

    Google Scholar 

  10. Laprie, J.C.(ed.):Dependability: basic concepts and terminology. Dependable Computing and Fault-Tolerant Systems, 5, Springer-Verlag (1992)

    Google Scholar 

  11. Lin, H.: A verification tool for value passing processes. Proc. Protocol Specification, Testing and Verification, XIII, North-Holland (1993) B1.1–B1.13

    Google Scholar 

  12. Liu, Z., Joseph, M.: Transformation of programs for fault tolerance. Formal Aspects of Computing, 4 (1992) 442–469

    Google Scholar 

  13. Johnson, B.: Design and analysis of fault tolerant systems. Addison-Wesley Publishing Company (1989)

    Google Scholar 

  14. Mancini, L.V., Pappalardo, G.: Towards a theory of replicated processing. Proc. Symposium on Formal Techniques in Real-time and Fault Tolerant Systems, LNCS 331 (1992) 175–192

    Google Scholar 

  15. Milner, R.: A calculus of communicating systems. LNCS 92, Springer-Verlag (1980)

    Google Scholar 

  16. Milner, R.: Communication and concurrency. Prentice-Hall International, Englewood Cliffs (1989)

    Google Scholar 

  17. Nordahl, J.: Design for dependability. In: C.E. Landwehr, B. Randell, L. Simoncini (eds.): Dependable Computing for Critical Applications 3. Dependable Computing and Fault-Tolerant Systems, 8, Springer-Verlag (1992) 65–89

    Google Scholar 

  18. Peled, D., Joseph, M.: A compositional approach for fault-tolerance using specification transformation. Proc. PARLE'93, LNCS 649 (1993) 173–184

    Google Scholar 

  19. Peleska, J.: Design and verification of fault tolerant systems with CSP. Distributed Computing, 5 (2), (1990) 95–106

    Google Scholar 

  20. Prasad, K.V.S.: Specification and proof of a simple fault tolerant system in CCS. Internal Report CSR-178-84, Department of Computer Science, University of Edinburg (1984)

    Google Scholar 

  21. Schepers, H.: Tracing fault tolerance. In: C.E. Landwehr, B. Randell, L. Simoncini (eds.): Dependable Computing for Critical Applications 3. Dependable Computing and Fault-Tolerant Systems, 8, Springer-Verlag (1992) 91–110

    Google Scholar 

  22. Schepers, H., Hooman, J.: Trace-based compositional reasoning about fault tolerant systems. Proc. PARLE'93, LNCS 649 (1993) 197–208

    Google Scholar 

  23. Schepers, H., Gerth, R.: A compositional proof theory for fault tolerant real-time distributed systems. Proc. 12th Symposium on Reliable Distributed Systems (1993) 34–43

    Google Scholar 

  24. Weber, D.G.: Formal specification of fault-tolerance and its relation to computer security. ACM Software Engineering Notes, 14 (3), (1989) 273–277

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus Echtle Dieter Hammer David Powell

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernardeschi, C., Fantechi, A., Simoncini, L. (1994). Formal reasoning on fault coverage of fault tolerant techniques: A case study. In: Echtle, K., Hammer, D., Powell, D. (eds) Dependable Computing — EDCC-1. EDCC 1994. Lecture Notes in Computer Science, vol 852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58426-9_125

Download citation

  • DOI: https://doi.org/10.1007/3-540-58426-9_125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58426-1

  • Online ISBN: 978-3-540-48785-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics