We provide three methods of verifying concurrent systems which are tolerant of faults in their operating environment - algebraic, logical and transformational. The first is an extension of the bisimulation equivalence, the second is rooted in the Hennessy-Milner logic, and the third involves transformations of CCS processes. Based on the common semantic model of labelled transition systems, which is also used to model faults, all three methods are proved equivalent for certain classes of faults
AbstractThis paper presents a framework for a logical characterization of fault tolerance and its fo...
This thesis addresses the problems of defining and proving translation correctness for programming ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
We introduce a necessary test for the claims about provable fault-tolerance: having proved to tolera...
AbstractWe describe a process algebraic approach to the semantics of replicated systems. We extend a...
A basic concept in modeling fault tolerant systems is that anticipated faults, being obviously outsi...
The possibility of partial failure occuring at any stage of computation complicates rigorous formal ...
The possibility of partial failure occuring at any stage of computation complicates rigorous formal ...
Proving that a program suits its specification and thus can be called correct has been a research su...
AbstractWe propose a language for testing concurrent processes and examine its strength in terms of ...
During recent years, calculi for reasoning about concurrent systems have been developed; examples ar...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
Abstract. Distributed Algorithms are hard to prove correct. In settings with process failures, thing...
Over the past fifteen years, there has been intensive study of formal systems that can model concurr...
TR-COSC 11/93We describe a process algebraic approach to the semantics of replicated systems. We ext...
AbstractThis paper presents a framework for a logical characterization of fault tolerance and its fo...
This thesis addresses the problems of defining and proving translation correctness for programming ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
We introduce a necessary test for the claims about provable fault-tolerance: having proved to tolera...
AbstractWe describe a process algebraic approach to the semantics of replicated systems. We extend a...
A basic concept in modeling fault tolerant systems is that anticipated faults, being obviously outsi...
The possibility of partial failure occuring at any stage of computation complicates rigorous formal ...
The possibility of partial failure occuring at any stage of computation complicates rigorous formal ...
Proving that a program suits its specification and thus can be called correct has been a research su...
AbstractWe propose a language for testing concurrent processes and examine its strength in terms of ...
During recent years, calculi for reasoning about concurrent systems have been developed; examples ar...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
Abstract. Distributed Algorithms are hard to prove correct. In settings with process failures, thing...
Over the past fifteen years, there has been intensive study of formal systems that can model concurr...
TR-COSC 11/93We describe a process algebraic approach to the semantics of replicated systems. We ext...
AbstractThis paper presents a framework for a logical characterization of fault tolerance and its fo...
This thesis addresses the problems of defining and proving translation correctness for programming ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...