K. V. S. Prasad. Specification and proof of a simple fault tolerant system in CCS. Internal Report CSR--178--84, University of Edinburgh, December 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Formal Reasoning on Fault Coverage of Fault Tolerant .. - Bernardeschi.. (1994) (1 citation) (Correct)
....fault tolerant technique is applied to design a system that recovers from the faulty behaviour hiding the effect of faults to an external observer. Equivalence theories based on the reactions of systems to stimuli from the outside world can therefore be used in the design of fault tolerant systems [6, 20]. In particular, the relationship between the system and the fault tolerant system can be studied by using the notion of observational equivalence. Observational equivalence, first introduced in [15] is based on the idea that the behaviour of the system is determined by the way it interacts with ....
....then observational equivalence is checked between the process corresponding to the system specification in absence of faults and that corresponding to the fault tolerant system where fault occurrences are constrained by the fault hypothesis. Observational equivalence has been first used in [20] to compare the correct behaviour of a system with the behaviour of the fault tolerant system in presence of faults; in [6] the authors define new process algebra operators to describe the behaviour of a faulty system, still using observational equivalence to relate the system and its fault ....
[Article contains additional citation context not shown here]
Prasad, K.V.S.: Specification and proof of a simple fault tolerant system in CCS. Internal Report CSR-178-84, Department of Computer Science, University of Edinburg (1984)
Combinators and Bisimulation Proofs for Restartable Systems - Prasad (1991) (6 citations) Self-citation (Prasad) (Correct)
....should not be taken to suggest wider applicability of our techniques. That is of course to be hoped for, but at present we can say no more than that. 1.1.3 Bisimulation proofs for restartable systems The message switching application lends itself well to modelling in CCS. This was carried out in [Pra84], important design decisions on the way being how Combinators and Bisimulation Proofs for Restartable Systems 5 to model failure, and how to detect the failure. These decisions have survived unchanged upto the present; we describe them in detail in the next section. With the modelling done, the ....
....survived unchanged upto the present; we describe them in detail in the next section. With the modelling done, the problem was formulated thus: Is the restartable system (called FTS ) equivalent to a perfect system that never fails And if so, what is the equivalence The answer, also reported in [Pra84], is that the two systems are in a weak bisimulation, a form of bisimulation that ignores internal moves, such as the secret feeding back of messages to the quarantined recovering process. This means that an observer can see no difference between the two, thus agreeing with our experience with the ....
[Article contains additional citation context not shown here]
K. V. S. Prasad. Specification and proof of a simple fault tolerant system in CCS. Internal Report CSR--178--84, University of Edinburgh, December 1984.
Combinators and Bisimulation Proofs for Restartable Systems - Prasad Doctor Of (1991) (6 citations) Self-citation (Prasad) (Correct)
....That is of course to be hoped for, but at present we can say no more than that. Combinators and Bisimulation Proofs for Restartable Systems 5 1.1.3 Bisimulation proofs for restartable systems The message switching application lends itself well to modelling in CCS. This was carried out in [Pra84], important design decisions on the way being how to model failure, and how to detect the failure. These decisions have survived unchanged upto the present; we describe them in detail in the next section. With the modelling done, the problem was formulated thus: Is the restartable system (called ....
....survived unchanged upto the present; we describe them in detail in the next section. With the modelling done, the problem was formulated thus: Is the restartable system (called FTS ) equivalent to a perfect system that never fails And if so, what is the equivalence The answer, also reported in [Pra84], is that the two systems are in a weak bisimulation, a form of bisimulation that ignores internal moves, such as the secret feeding back of messages to the quarantined recovering process. This means that an observer can see no difference between the two, thus agreeing with our experience with the ....
[Article contains additional citation context not shown here]
K. V. S. Prasad. Specification and proof of a simple fault tolerant system in CCS. Internal Report CSR--178--84, University of Edinburgh, December 1984.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC