ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Electronic Notes in Theoretical Computer Science
Volume 118, 1 February 2005, Pages 57-70
Proceedings of the International Workshop on Software Verification and Validation (SVV 2003)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (300 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2004.09.032    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking

S. Gnesi1, a, E-mail The Corresponding Author, G. Lenzinia, E-mail The Corresponding Author and F. Martinellia, E-mail The Corresponding Author

Istituto di Scienze e Tecnologie Informatiche - C.N.R., Via G. Moruzzi 1, I-56100 Pisa, Italy Istituto di Informatica e Telematica - C.N.R., Via G. Moruzzi 1, I-56100 Pisa, Italy

Available online 10 February 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This paper presents a framework for a logical characterization of fault tolerance and its formal analysis based on partial model checking techniques. The framework requires a fault tolerant system to be modeled using a formal calculus, here the CCS process algebra. To this aim we propose a uniform modeling scheme in which to specify a formal model of the system, its failing behaviour and possibly its fault-recovering procedures. Once a formal model is provided into our scheme, fault tolerance - with respect to a given property - can be formalized as an equational μ-calculus formula. This formula expresses, in a logic formalism, all the fault scenarios satisfying that fault tolerance property. Such a characterization understands the analysis of fault tolerance as a form of analysis of open systems and, thank to partial model checking strategies, it can be made independent from any particular fault assumption. Moreover this logical characterization makes possible the fault-tolerance verification problem be expressed as a general μ-calculus validation problem, for solving which many theorem proof techniques and tools are available. We present several analysis methods showing the flexibility of our approach.

Keywords: Fault Tolerant Systems; Formal Verification; Partial Model Checking


Electronic Notes in Theoretical Computer Science
Volume 118, 1 February 2005, Pages 57-70
Proceedings of the International Workshop on Software Verification and Validation (SVV 2003)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.