Abstract
We introduce a necessary test for the claims about provable fault-tolerance: having proved to tolerate several faults, we must tolerate (provably) any combination of them. One notable failure to pass this test is bisimulation. The paper presents a class of bisimulations which are fault-monotonic and within CCS support compositional design of component specifications by stepwise refinement, each step increasing or at least preserving the current level of fault-tolerance.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. LNCS, 372:1–17, 1989.
A. Borjesson, K.G. Larsen, and A. Skou. Generality in design and compositional verification using TAV. Formal Methods in System Design, 6(3):239–258, 1995.
G. Bruns. Applying process refinement to a safety-relevant system. Technical report, Lab. for Foundations of Computer Science, University of Edinburgh, 1994.
K.M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, 1988.
F. Cristian. A rigorous approach to fault-tolerant programming. IEEE Transactions on Software Engineering, 11(1):23–31, 1985.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, 1985.
T. Janowski. Stepwise transformations for fault-tolerant design of CCS processes. In Proc. 7th Int. Conference on Formal Description Techniques, pages 505–520. Chapman and Hall, 1994.
T. Janowski. Bisimulation and Fault-Tolerance. PhD thesis, Department of Computer Science, University of Warwick, 1995.
T. Janowski and M. Joseph. Dynamic scheduling in the presence of faults: Specification and verification. In Proc. 4rd Int. Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 1135 of LNCS, pages 279–297, 1996.
He Jifeng and C.A.R. Hoare. Algebraic specification and proof of a distributed recovery algorithm. Distributed Computing, 2:1–12, 1987.
K.G. Larsen and R. Milner. A compositional protocol verification using relativized bisimulation. Information and Computation, 99:80–108, 1992.
Z. Liu. Fault-Tolerant Programming by Transformations. PhD thesis, University of Warwick, 1991.
Z. Liu and M. Joseph. Transformations of programs for fault-tolerance. Formal Aspects of Computing, 4:442–469, 1992.
R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
K. Paliwoda and J.W. Sanders. An incremental specification of the sliding-window protocol. Distributed Computing, 5:83–94, 1991.
D. Park. Concurrency and automata on infinite sequences. LNCS, 104, 81.
J. Peleska. Design and verification of fault tolerant systems with CSP. Distributed Computing, 5:95–106, 1991.
K.V.S. Prasad. Combinators and Bisimulation Proofs for Restartable Systems. PhD thesis, Department of Computer Science, University of Edinburgh, 1987.
H. Schepers. Fault Tolerance and Timing of Distributed Systems. PhD thesis, Eindhoven University of Technology, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janowski, T. (1997). On bisimulation, fault-monotonicity and provable fault-tolerance. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000478
Download citation
DOI: https://doi.org/10.1007/BFb0000478
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63888-9
Online ISBN: 978-3-540-69661-2
eBook Packages: Springer Book Archive