Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
A calculus of mobile processes, II
Information and Computation
Communication and concurrency
Distributed systems analysis with CCS
Distributed systems analysis with CCS
An integrated framework for security and dependability
Proceedings of the 1998 workshop on New security paradigms
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Software security vulnerability testing in hostile environments
Proceedings of the 2002 ACM symposium on Applied computing
Dependability: Basic Concepts and Terminology
Dependability: Basic Concepts and Terminology
Analysis of security protocols as open systems
Theoretical Computer Science
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts
Programming Languages and Their Definition - Hans Bekic (1936-1982)
Assumption Generation for Software Component Verification
Proceedings of the 17th IEEE international conference on Automated software engineering
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Security and Dependability: Then and Now
CSDA '98 Proceedings of the Conference on Computer Security, Dependability, and Assurance: From Needs to Solutions
Partial Model Checking and Theorem Proving for Ensuring Security Properties
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
IWSSD '98 Proceedings of the 9th international workshop on Software specification and design
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Through Modeling to Synthesis of Security Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric Analysis of an Improved Fault Tolerant System
Electronic Notes in Theoretical Computer Science (ENTCS)
Design and Verification of Fault-Tolerant Components
Methods, Models and Tools for Fault Tolerance
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
dCTL: a branching time temporal logic for fault-tolerant system verification
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
| Hi-index | 0.00 |
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 @m-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 @m-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.