论文信息 - Verifying fault-tolerant behavior of state machines

Verifying fault-tolerant behavior of state machines

Fault tolerant behavior is an important non functional requirement for systems that involve high criticality. We present a framework which allows the analysis of fault tolerant behavior to be undertaken. This framework is based on the notion of state machines and tolerance relations. Results concerning fault tolerant behavior of finite state machines are presented and an illustrative example is discussed. Various kinds of fault tolerant behavior (masking, fail-stop, t-fail-stop, degradable, etc.) are modeled.

Mario Dal Cin | M. D. Cin

[1] David Harel,et al. Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[2] Gunther Schmidt,et al. Relational Methods in Computer Science , 1999, Inf. Sci..

[3] Henri Poincaré,et al. The Value of Science , 1905 .

[4] T. S. Perraju,et al. Specifying fault tolerance in mission critical systems , 1996, Proceedings. IEEE High-Assurance Systems Engineering Workshop (Cat. No.96TB100076).

[5] J. C. Laprie. Dependability modeling and evaluation of computing systems: dependable computing: concepts and terminology , 1992 .

[6] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[7] John M. Rushby. Reconfiguration and transient recovery in state machine architectures , 1996, Proceedings of Annual Symposium on Fault Tolerant Computing.

[8] Michael A. Arbib,et al. Tolerance automata , 1967, Kybernetika.

[9] Dino Mandrioli,et al. Formal Methods for Real-Time Computing: an Overview , 1996 .

[10] Allen Buckroyd,et al. Fault tolerance: principles and practice: Anderson, T and Lee, P.A., Prentice-Hall Internation, New Jersey, USA (1981) 369 pp, £16.95 , 1982, Microprocessors and microsystems.