TR-COSC 11/93We describe a process algebraic approach to the semantics of replicated systems. We extend a subset of CCS with a replication operator to model systems with replicated synchronous majority voting. Based on an operational semantics, we define a bisimulation semantics. As the bisimulation semantics does not characterise fault tolerance we define preorders which introduces a hierarchy of faulty processes and fault tolerant processes. We then show how a similar ordering on modal- formulae can characterise the fault preorders
We present a compositional network proof theory to specify and verify safety properties of fault tol...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
This chapter presents the fundamentals and applications of the State Machine Replication (SMR) techn...
AbstractWe describe a process algebraic approach to the semantics of replicated systems. We extend a...
A process algebraic approach to the specication of fault tolerant systems is de-scribed. As replicat...
TR-COSC 06/92We describe a process algebraic approach to the semantics of robust systems. We extend ...
We describe a process algebraic approach to the semantics of robust systems. We extend a subset of C...
We provide three methods of verifying concurrent systems which are tolerant of faults in their opera...
AbstractConsistency between a process and its specification expressed in CSP is typically presented ...
We introduce a necessary test for the claims about provable fault-tolerance: having proved to tolera...
AbstractThere are two quite distinct approaches commonly used when giving meaning to process algebra...
The possibility of partial failure occuring at any stage of computation complicates rigorous formal ...
AbstractThere are two quite distinct approaches commonly used when giving meaning to process algebra...
During recent years, calculi for reasoning about concurrent systems have been developed; examples ar...
System availability is improved by the replication of data objects in a distributed database system....
We present a compositional network proof theory to specify and verify safety properties of fault tol...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
This chapter presents the fundamentals and applications of the State Machine Replication (SMR) techn...
AbstractWe describe a process algebraic approach to the semantics of replicated systems. We extend a...
A process algebraic approach to the specication of fault tolerant systems is de-scribed. As replicat...
TR-COSC 06/92We describe a process algebraic approach to the semantics of robust systems. We extend ...
We describe a process algebraic approach to the semantics of robust systems. We extend a subset of C...
We provide three methods of verifying concurrent systems which are tolerant of faults in their opera...
AbstractConsistency between a process and its specification expressed in CSP is typically presented ...
We introduce a necessary test for the claims about provable fault-tolerance: having proved to tolera...
AbstractThere are two quite distinct approaches commonly used when giving meaning to process algebra...
The possibility of partial failure occuring at any stage of computation complicates rigorous formal ...
AbstractThere are two quite distinct approaches commonly used when giving meaning to process algebra...
During recent years, calculi for reasoning about concurrent systems have been developed; examples ar...
System availability is improved by the replication of data objects in a distributed database system....
We present a compositional network proof theory to specify and verify safety properties of fault tol...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
This chapter presents the fundamentals and applications of the State Machine Replication (SMR) techn...