A theory for observational fault tolerance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3921 LNCS, Issue , 2006, Pages 16-31

  Francalanza, Adrian ^a   Hennessy, Matthew ^b  

^a UNIVERSITY OF MALTA   (Malta)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; COMPUTER SYSTEM RECOVERY; DEGREES OF FREEDOM (MECHANICS); DIFFERENTIATION (CALCULUS); EQUIVALENCE CLASSES; FAULT TOLERANT COMPUTER SYSTEMS; REDUNDANCY;

BISIMULATION; DISTRIBUTED PROGRAMS; PI-CALCULUS; SOFTWARE DEPENDABILITY;

COMPUTATION THEORY;

EID: 33745796110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_2     Document Type: Conference Paper

References (13)

1. Roberto M. Amadio and Sanjiva Prasad. Localities and failures. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 14, 1994.
2. Flavin Christian. Understanding fault tolerant distributed systems. Communications of the ACM, 34(2):56-78, February 1991.
3. Alberto Ciaffaglione, Matthew Hennessy, and Julian Rathke. Proof methodologies for behavioural equivalence in Dπ. Technical Report 03/2005, University of Sussex, 2005.
4. Adrian Francalanza and Matthew Hennessy. A theory for observational fault tolerance. www.cs.um.edu.mt/afran/.
5. Adrian Francalanza and Matthew Hennessy. A theory of system behaviour in the presence of node and link failures. In CONCUR, volume 3653 of Lecture Notes in Computer Science, pages 368-382. Springer, 2005.
6. Matthew Hennessy, Massimo Merro, and Julian Rathke. Towards a behavioural theory of access and mobility control in distributed systems. Theoretical Computer Science, 322:615-669, 2004.
7. Matthew Hennessy and Julian Rathke. Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science, 14:651-684, 2004.
8. Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. Information and Computation, 173:82-120, 2002.
9. K. V. S. Prasad. Combinators and Bisimulation Proofs for Restartable Systems. PhD thesis, Department of Computer Science, University of Edinburgh, December 1987.
10. James Riely and Matthew Hennessy. Distributed processes and location failures. Theoretical Computer Science, 226:693-735, 2001.
11. Davide Sangiorgi and David Walker. The π-calculus. Cambridge University Press, 2001.
12. Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. Computer Systems, 1(3):222-238, 1983.
13. Paulo Verissimo and Luis Rodrigues. Distributed Systems for System Architects. Kluwer Academic Publishers, 2001.