Abstract
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.
On leave from the Institute of Mathematics, University of Gdańsk, Poland
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Aceto and M. Hennessy. Termination, deadlock and divergence. Journal of ACM, 39(1):147–187, 1992.
F. Cristian. A rigorous approach to fault-tolerant programming. IEEE Transactionsn 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.
He Jifeng and C.A.R. Hoare. Algebraic specification and proof of a distributed recovery algorithm. Distributed Computing, 2:1–12, 1987.
R. Keller. Formal verification of parallel programs. Communications of ACM, 19(7):561–572, 1976.
K.G. Larsen. A context dependent equivalence between processes. Theoretical Computer Science, 49:185–215, 1987.
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, 1991.
N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. Technical report, MIT Laboratory for Computer Science, 87.
K.G. Larsen and B. Thomsen. A modal process logic. In Proc. 3rd Annual Symposium on Logic in Computer Science, pages 203–210, 88.
R. Milner. A calculus of communicating systems. LNCS, 92, 1980.
R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume 1. Springer-Verlag, 1991.
J. Nordahl. Specification and Design of Dependable Communicating Systems. PhD thesis, Technical University of Denmark, 1992.
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.
D. Peled and M. Joseph. A compositional approach for fault-tolerance using specification transformation. LNCS, 694, 1993.
G. Plotkin. A structural approach to operational semantics. Technical report, Computer Science Department, Aarhus University, 81.
V. Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33–71, 1986.
K.V.S. Prasad. Combinators and Bisimulation Proofs for Restartable Systems. PhD thesis, Department of Computer Science, University of Edinburgh, 1987.
H. Schepers. Tracing fault-tolerance. In Proc. 3rd IFIP Working Conference on Dependable Computing for Critical Applications. Springer-Verlag, 1993.
D.J. Walker. Bisimulation and divergence. Information and Computation, 85:202–241, 90.
G. Winskel. An introduction to event structures. LNCS, 354:364–397, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janowski, T. (1994). Fault-tolerant bisimulation and process transformations. In: Langmaack, H., de Roever, WP., Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT ProCoS 1994 1994. Lecture Notes in Computer Science, vol 863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58468-4_174
Download citation
DOI: https://doi.org/10.1007/3-540-58468-4_174
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58468-1
Online ISBN: 978-3-540-48984-9
eBook Packages: Springer Book Archive