The Two-Phase Commitment Protocol in an Extended π-Calculus

Aziz Abdulla, 1996, Verifying programs with unreliable channels, Journal of Information and Computation, 127, 91, 10.1006/inco.1996.0053

Roberto M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proc. of COORDINATION 97, volume 1282 of Incs. Springer Verlag, Berlin, 1997. Also Rapport Interne 216 LIM February 1997, and INRIA Research Report 3109.

Martin Berger. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2000. To appear.

Martin Berger and Kohei Honda. Atomic commitment protocols in extended π-calculi (1). Available upon request from the authors, May 2000.

Bergstra, 1985, Algebra of communicating processes, TCS, 37, 77, 10.1016/0304-3975(85)90088-X

Bernstein, 1987

Elmootazbellah N. Elnozahy, David B. Johnson, and Yi-Min Wang. A survey of rollback-recovery protocols in message-passing systems. Technical Report CMU-CS-96-181, School of Computer Science, Carnegie Mellon University, 1996.

Cédric Fournet and Georges Gonthier. A hierarchy of equivalences for asynchronous calculi. In Proceedings of ICALP 1998, 1998.

Fournet, 1996, A calculus of mobile agents, 406

Cedric Fournet and Cosimo Laneve. Bisimulations in the join-calculus. To appear in Theoretical Computer Science.

J. Gray. Notes on data base operating systems, 1979.

Jim Gray and Andreas Reuter. Transaction processing: concepts and techniques. Morgan Kaufmann, 1993.

M. Hennessy. Timed process algebras: a tutorial, 1992.

Richard Hoare, 1985

Kohei Honda and Mario Tokoro. An object calculus for asynchronous communication. In Proceedings of ECOOP'91, volume 512 of LNCS, pages 133-147. Springer-Verlag, 1991.

Honda, 1991, A small calculus for concurrent objects, OOPS Messenger, 10.1145/127070.127079

Honda, 1995, On reduction-based process semantics, Theoretical Computer Science, 151, 437, 10.1016/0304-3975(95)00074-7

Lamport, 1978, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, 21, 558, 10.1145/359545.359563

Lamport, 1982, The byzantine generals problem, ACM Transactions on Programming Languages and Systems, 4, 382, 10.1145/357172.357176

Lampson, 1975, Sturgis. Reflections on an operating system design, Fifth ACM Symposium on Operating Systems Principles, 19

Milner, 1989

Robin Milner. The polyadic π-calculus: A tutorial. Technical Report 91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.

Milner, 1992, A calculus of mobile processes, parts I and II, Information and Computation, 100, 1, 10.1016/0890-5401(92)90008-4

J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proceedings of LICS'98, 1998.

Riely, 1997, Distributed processes and location failures, 471

D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher Order Paradigms. PhD thesis, University of Edinburgh, 1992.

Schneider, 1983, Fail-stop processors: An approach to designing fault-tolerant computing systems, ACM Transactions on Programming Languages and Systems, 1, 222

Dale Skeen. Non-blocking commit protocols. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 133-142, 1981.

Spiro, 1991, Designing an optimized transaction commit protocol, Digital Technical Journal, 3

Vasco Vasconcelos. Typed concurrent objects. In Proceedings of ECOOP'94, pages 100-117. Springer Verlag, 1994.