[AEA91]

D. Agrawal and A. El-Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst., 9(1):1-20, February 1991.

[AM G03]

R. Atreya, N. Mittal, and V. K. Garg. Detecting locally stable predicates without modifying application messages. In Proc. Intnatl. Conf. on Principles of Distributed Systems, La Martinique, France, December 2003.

[Ang80]

D. Angluin. Local and global properties in networks of processors. In Proc. of the 12th ACM Symp. on Theory of Computing, pages 82 93, 1980.

[AW98]

H. Attiya and J. Welch. Distributed Computing - Fundamentals, Simulations and Advanced Topics. McGraw Hill, Berkshire, SL6 2QL, England, 1998.

[Awe85]

B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804- 823, October 1985.

[Bar96]

V. Barbosa. An Introduction to Distributed Algorithms. The MIT Press, Cambridge, MA, 1996.

[BJ87]

K. P. Birman and T. A. Joseph. Reliable communication in the presence of failures. ACM Trans. Comput. Syst., 5(1):47-76, 1987.

[BN84]

A. D. Birrell and B. J. Nelson. Implementing remote procedure calls. ACM Trans. Comput. Syst., 2(1):39-59, February 1984.

[Bou87]

L. Bouge. Repeated snapshots in distributed systems with synchronous communication and their implementation in CSP. Theoretical Computer Science, 49:145-169, 1987.

[Bur80]

J. Burns. A formal model for message passing systems. Technical Report TR-91, Indiana University, 1980. Department of Computer Science.

[CDK94]

G. Couloris, J. Dollimore, and T. Kindberg. Distributed Systems: Concepts and Design. Addison-Wesley, Reading, MA, 1994.

[CJ97]

R. Chow and T. Johnson. Distributed Operating Systems and Algorithms. Addison-Wesley Longman, Reading, MA, 1997.

[CL85]

K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst., 3(1):63-75, February 1985.

[CM89]

K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1989.

[Com00]

D. E. Corner. Internetworking with TCP/IP: Volume 1. Principles, Protocols, and Architectures. Prentice-Hall, Upper Saddle River, NJ 07458, USA, fourth edition, 2000.

[CR79]

E. J. H. Chang and R. Roberts. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Commun. of the ACM, 22(5):281–283, 1979.

[DG96]

O. P. Damani and V. K. Garg. How to recover efficiently and asynchronously when optimism fails. In ICDCS ’96; Proc. of the 16th Intnatl. Conf. on Distributed Computing Systems; Hong Kong, pages 108-115. IEEE, May 1996.

[Dij65a]

E. W. Dijkstra. Co-operating Sequential Processes. In F. Genuys, editor, Programming Languages. Academic Press, London, 1965.

[Dij65b]

E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. of the ACM, 8(9):569, September 1965.

[Dij74]

E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. of the ACM, 17:643–644, 1974.

[Dij85]

E. W. Dijkstra. The distributed snapshot of K.M. Chandy and L. Lamport. In M. Broy, editor, Control Flow and Data Flow: Concepts of Distributed Programming, volume F14. NATO ASI Series, Springer-Verlag, New York, NY, 1985.

[Dij87]

E. W. Dijkstra. Shmuel Safra’s version of termination detection. Report EWD998-0, University of Texas at Austin, January 1987.

[DKR82]

D. Dolev, M. Klawe, and M. Rodeh. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms, 3:245-260, 1982.

[DS80]

E. W. Dijkstra and C. S Scholten. Termination detection for diffusing computations. Information Processing Letters, 11 (4):1–4, August 1980.

[DS83]

D. Dolev and H. R. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983.

[Far98]

J. Farley. Java Distributed Computing. O’Reilly, Sebastopol, CA, 1998.

[Fid89]

C. J. Fidge. Partial orders for parallel debugging. Proc. of the ACM SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, (ACM SIGPLAN Notices), 24(1):183-194, January 1989.

[FL82]

M. J. Fischer and N. A. Lynch. A lower bound on the time to assure interactive consistency. Information Processing Letters, 14(4):183-186, 1982.

[FLP85]

M. J. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.

[Gar92]

V. K. Garg. Some optimal algorithms for decomposed partially ordered sets. Information Processing Letters, 44:39-43, November 1992.

[Gar96]

V. K. Garg. Principles of Distributed Systems. Kluwer Academic Publishers, Boston, MA, 1996.

[Gar02]

V. K. Garg. Elements of Distributed Computing. Wiley, New York, NY, 2002.

[GC95]

V. K. Garg and C. Chase. Distributed algorithms for detecting conjunctive predicates. In Proc. of the IEEE Intnatl. Conf. on Distributed Computing Systems, pages 423-430, Vancouver, Canada, June 1995.

[Gif79]

D. K. Gifford. Weighted voting for replicated data. Proc. 7th Symp. on Operating Syst. Principles,, 13(5):150-162, December, 1979.

[Gos91]

A. Goscinski. Distributed Operating Systems, The Logical Design. Addison-Wesley, Reading, MA, 1991.

[GR93]

J. Gray and A. Reuter. Transaction Processing. Morgan Kaufmann Publishers, San Mateo, CA, 1993.

[Gra78]

J. N. Gray. Notes on database operating systems. In G. Goos and J. Hartmanis, editors, Operating Systems: An Advance Course, volume 60 of Lecture Notes in Computer Science, pages 393-481. Springer-Verlag, 1978.

[GW92]

V. K. Garg and B. Waldecker. Detection of unstable predicates in distributed programs. In Proc. of 12th Conf. on the Foundations of Software Technology & Theoretical Computer Science, pages 253-264. Springer Verlag, December 1992. Lecture Notes in Computer Science 652.

[HA90]

P. Hutto and M. Ahamad. Slow memory : Weakening consistency to enhance concurreny in distributed shared memories. Proc. of Tenth Intnatl. Conf. on Distributed Computing Systems, May 1990.

[Han72]

P. Brinch Hansen. Structured multi-programming. CACM, 15(7):574-578, July 1972.

[Har98]

S. J . Hartley. Concurent Programming: The Java Programming Languuge. Oxford, New York, NY, 1998.

[He189]

J. Helary. Observing global states of asynchronous distributed applications. In Workshop on Distributed Algorithms, pages 124-135. Springer Verlag, LNCS 392, 1989.

[Her88]

M. Herlihy. Impossibility and universality results for wait-free synchronization. Technical Report TR-CS-8, Carnegie-Mellon University (Pittsburg PA),, May 1988.

[HM84]

J.Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environnient. In Proc. of the ACM Symp. on Principles of Distributed Computing, pages 50 - 61, Vancouver, B.C., Canada, 1984.

[HMNR.97]

J. Helary, A. Mostefaoui, R. H. B. Netzer, and M. Raynal. Preventing useless checkpoints in distributed computations. In Symp. on Reliable Distributed Systems, pages 183–190, Durham, NC, 1997.

[HMRS95]

M. Hurfin, M. Mizuno, M. Raynal, and M. Singhal. Efficient distributed detection of conjunction of local predicates. Technical Report 2731, IRISA, Rennes, France, November 1995.

[Hoa74]

C. A. R. Hoare. Monitors: An operating system structuring concept. Commun. of the ACM, 17(10):549-557, October 1974. Erratum in Commun. ofthe ACM, Vol. 18, No. 2 (February), p. 95, 1975.

[HR82]

G. S. Ho and C. V. Ramamoorthy. Protocols for deadlock detection in distributed database systems. IEEE Trans. on Software Engineering, 8(6):554-557, November 1982.

[HS80]

D. S. Hirschberg and J. B. Sinclair. Decentralized extrema-finding in circular configurations of processors. Commun. of the ACM, 23( 11):627-628, 1980.

[HW90]

M. P. Herlihy and J. M. Wing. Linerizability: A correctness condition for atomic objects. ACM Trans. Prog. Lang. Syst., 12(3):463-492, July 1990.

[Lam74]

L. Lamport. A new solution of dijkstra’s concurrent programming program. Commun. of the ACM, 17(8), August 1974.

[Lam78]

L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. of the ACM, 21(7):558-565, July 1978.

[Lam79]

L. Lamport. How to make a correct multiprocess program execute correctly on a multiprocessor. IEEE Trans. on Computers, 28(9):690-691, 1979.

[Lam86]

L. Lamport. On interprocess communication, part 11: Algorithms. Distributed Computing, 1:86-101, 1986.

[Lea99]

D. Lea. Concurrent Programming in Java: Design principles and Putterns. The Java Series. Addison Wesley, Reading, MA, 2nd edition, 1999.

[Lov73]

L. Lovasz. Coverings and colorings of hypergraphs. In 4th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, pages 3-12, 1973.

[LSP82]

L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. on Programming Languages and Systems, 4(3):382-401, July 1982.

[Lub85]

M. Luby. A simple parallel algorithm for the maximal independent set problem. In ACM, editor, Proc. of the 17th annual ACM Symp. on Theory of Computing, Providence, RI, pages 1-10, May 1985.

[LY 87]

T. H. Lai and T. H. Yang. On distributed snapshots. Information Processing Letters, pages 153-158, May 1987.

[Lyn96]

N. A. Lynch. Distributed Algorithms. Morgan Kaufmann series in data management systems. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, 1996.

[Mae85]

M. Maekawa. A square root N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst., 3(2):145-159, May 1985.

[Mat89]

F. Mattern. Virtual time and global states of distributed systems. In Parallel and Distributed Algorithms: Proc. of the Intnatl. Workshop on Parallel and Distributed Algorithms, pages 215-226. Elsevier Science Publishers B.V. (North-Holland), 1989.

[Mat93]

F. Mattern. Efficient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing, pages 423--434, August 1993.

[MG95]

V. V. Murty and V. K. Garg. An algorithm to guarantee synchronous ordering of messages. In Proc. of Second Intnatl. Symp. on Autonomous Decentralized Systems, pages 208 214. IEEE Computer Society Press, 1995.

[MG98]

N. Mittal and V. K. Garg. Consistency conditions for multi-object distributed operations. In Proc. of the 18th Int’l Conf. on Distributed Computing Systems (ICDCS-18), pages 582-589, May 1998.

[MS94]

K. Marzullo and L. S. Sabel. Efficient detection of a class of stable properties. Distributed Computing, 8(2):81-91, 1994.

[NX95]

R. H. B. Netzer and J. Xu. Necessary and sufficent conditions for consistent global snapshots. IEEE Trans. on Parallel and Distributed Systems, 6(2):165-169, February 1995.

[Pet81]

G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3): 115–116, June 1981.

[Pet82]

G. Peterson. unidirectional algorithm for the circular extrema problem. ACM Trans. on Programming Languages and Systems, 4:758-762, 1982.

[PKR82]

J . K. Pachl, E. Korach, and D. Rotem. A technique for proving lower bounds for distributed maximum-finding algorithms. In ACM Symp. on Theory of Computing, pages 378-382, 1982.

[PSLSO]

M. Pease, R. Shostak, and L. Lamport. Reaching agreements in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.

[PW95]

D. Peleg and A. Wool. Crumbling walls: a class of practical and efficient quorum systems. In Proc. of the 14th Annual ACM Symp. on Principles of Distributed Computing (PODC ’95), pages 120-129, New York, August 1995. ACM.

[RAN]

G. Ricart and A. K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. Commun. of the ACM, 24(1):9 – 17, 1981.

[Ray 88]

M. Raynal. Distributed Algorithms and Protocols. John Wiley & Sons, 1988.

[Ray89]

K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst., 7(1):61-77, February 1989.

[RH90]

M. Raynal and J. M. Helary. Synchronization and Control of Distributed Systems and Programs. Wiley, Chichester, UK, 1990.

[RST91]

M. Raynal, A. Schiper, and S. Toueg. The causal ordering abstraction and a simple way to implement it. Information Processing Letters, 39(6):343-350, July 1991.

[SK85]

I. Suzuki and T. Kasami. A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst., 3(4):344-349, November 1985.

[SK86]

M. Spezialetti and P. Kearns. Efficient distributed snapshots. In Proc. of the 6th Intnatl. Conf. on Distributed Computing Systems, pages 382-388, 1986.

[Ske82]

D. Skeen. Crash Recovery in Distributed Database System. PhD Dissertation, EECS Department, University of California at Berkeley, 1982.

[SL87]

S. Sarin and N. A. Lynch. Discarding obsolete information in a replicated database system. IEEE Trans. on Software Engineering, SE-13( 1):39-47, January 1987.

[SM94]

ed. S. Mullender. Distributed Systems. Addison-Wesley, Reading, MA, 1994.

[SS94]

M. Singhal and N. G. Shivaratri. Advanced Concepts in Operating Systems. McGraw Hill, New York, NY, 1994.

[SS95]

S. D. Stoller and F. B. Schneider. Faster possibility detection by combining two approac:hes. In Proc. of the 9th Intnatl. Workshop on Distributed Algorithms, pages 318-332, France, September 1995. Springer-Verlag.

[SY85]

R. E. Strom and S. Yemeni. Optimistic recovery in distributed systems. ACM Trans. Comput. Syst., 3(3):204-226, 1985.

[Tay83]

R. N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19(1):57-84, April 1983.

[Tay89

K. Taylor. The role of inhibition in asynchronous consistent-cut protv cols. In Workshop on Distributed Algorithms, pages 280-291. Springer Verlag, LNCS 392, 1989.

[Tel94]

G. Tel. Introduction to Distributed Algorithms. Cambridge IJniversity Press, Cambridge, England, 1994.

[TG93]

A. I. Tomlinson and V. K. Garg. Detecting relational global predicates in distributed systems. In PTOC. of the Workshop on Parallel and Distributed Debugging, pages 21-31, San Diego, CA, May 1993.

[Tho79]

R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Tram. on Database Systems, 4(2):180-209, June 1979.

[TvS02]

A. S. Tanenbaum and M. van Steen. Distributed systems: principles and paradigms. Prentice Hall, 2002.

[VD92]

S. Venkatesan and B. Dathan. Testing and debugging distributed programs using global predicates. In 30th Annual Allerton Conf. on Commun., Control and Computing, pages 137-146, Allerton, Illinois, October 1992.

[Wan 97]

Y. M. Wang. Consistent global checkpoints that contain a given set of local checkpoints. IEEE Transactions on Computers, 46(4), April 1997.

[YM94]

Z. Yang and T. A. Marsland. Introduction. In Z. Yang and T. A. Marsland, editors, Global State and Time in Distributed Systems. IEEE Coniputer Society Press, 1994.