Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang & Lenore D. Zuck (1994):
Reliable Communication Over Unreliable Channels.
Journal of the ACM 41(6),
pp. 1267–1297,
doi:10.1145/195613.195651.
Roberto M. Amadio, Ilaria Castellani & Davide Sangiorgi (1998):
On Bisimulations for the Asynchronous pi-Calculus.
Theoretical Computer Science 195(2),
pp. 291–324,
doi:10.1016/S0304-3975(97)00223-5.
Roberto M. Amadio & Sanjiva Prasad (1994):
Localities and Failures (Extended Abstract).
In: Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1994),
pp. 205–216,
doi:10.1007/3-540-58715-2_126.
K. A. Bartlett, R. A. Scantebury & P.T. Wilkinson (1969):
A note on reliable full-duplex transmission over half-duplex links.
CACM 12(5),
pp. 260–261,
doi:10.1145/362946.362970.
Peter M. Chen, Edward K. Lee, Garth A. Gibson, Randy H. Katz & David A. Patterson (1994):
RAID: High-Performance, Reliable Secondary Storage.
ACM Computing Surveys 26,
pp. 145–185,
doi:10.1145/176979.176981.
A. Finkel & Ph. Schnoebelen (2001):
Well-structured Transition Systems Everywhere!.
Theoretical Computer Science 256(1-2),
pp. 63–92,
doi:10.1016/S0304-3975(00)00102-X.
Eli Gafni & Yehuda Afek (1988):
End-to-End Communication in Unreliable Networks.
In: Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing,
pp. 131–148,
doi:10.1145/62546.62570.
Joseph Y. Halpern & Lenore D. Zuck (1992):
A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols.
Journal of the ACM 39(3),
pp. 449–478,
doi:10.1145/146637.146638.
Kohei Honda & Nobuko Yoshida (1993):
On Reduction-Based Semantics.
In: Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1993),
pp. 373–387,
doi:10.1007/3-540-57529-4_70.
Tomasz Janowski (1994):
Stepwise transformations for fault-tolerant design of CCS processes.
In: Formal Description Techniques VII, Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques,
pp. 505–520.
Tomasz Janowski (1997):
On Bisimulation, Fault-Monotonicity and Provable Fault-Tolerance.
In: Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology (AMAST '97),
pp. 292–306,
doi:10.1007/BFb0000478.
Padmanabhan Krishnan (1994):
A Semantic Characterisation for Faults in Replicated Systems.
Theoretical Compututer Science 128(1-2),
pp. 159–177,
doi:10.1016/0304-3975(94)90168-6.
Kim Guldstrand Larsen & Robin Milner (1992):
A Compositional Protocol Verification Using Relativized Bisimulation.
Information and Computation 99(1),
pp. 80–108,
doi:10.1016/0890-5401(92)90025-B.
Zhiming Liu & Mathai Joseph (1992):
Transformation of Programs for Fault-Tolerance.
Formal Aspects of Computing 4(5),
pp. 442–469,
doi:10.1007/BF01211393.
Robin Milner (1992):
Functions as Processes.
Mathematical Structures in Computer Science 2(2),
pp. 119–141,
doi:10.1017/S0960129500001407.
Robin Milner & Davide Sangiorgi (1992):
Barbed Bisimulation.
In: Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92).
Springer-Verlag,
pp. 685–695,
doi:10.1007/3-540-55719-9_114.
Doron Peled & Mathai Joseph (1994):
A Compositional Framework for Fault Tolerance by Specification Transformation.
Theoretical Computer Science 128(1&2),
pp. 99–125,
doi:10.1016/0304-3975(94)90166-X.
James Riely & Matthew Hennessy (1997):
Distributed Processes and Location Failures (Extended Abstract).
In: Proceedings of the 24th International Colloquium on Automata, Languages and Programming, (ICALP'97),
pp. 471–481,
doi:10.1007/3-540-63165-8_203.
N. V. Stenning (1976):
A data transfer protocol.
Computer Networks 1,
pp. 99–110,
doi:10.1016/0376-5075(76)90015-5.