Un problema de conjuntos en computación distribuida

Referencias

1] Baldoni, Roberto y Michel Raynal. Fundamentals of Distributed Systems: A practical tour of Vector Clocks Systems. IEEE Distributed Systems Online, Febrero, 2002. [2] Cormen, Thomas et al. Introduction to Algorithms. 2nda edición. The MIT Press: Estados Unidos, 2001. [3] Davey, B.A. y H.A. Prestley. Introduction to Lattices and Order. Cambridge University Press: Gran Bretaña, 1990. [4] Fidge,Colin.LogicalTimeinDistributedComputingSystems.Computer.Vol 24(8): 28-33. Agosto, 1991. [5] Garey, Michael y David Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company: Estados Uni- dos, 1979. [6] Lamport, Leslie. Time, Clocks, and the Ordering of Events in a Distributed System . Communications of the ACM. Vol 21(7):558-565. Julio, 1978. [7] Lynch,Nancy.DistributedAlgorithms.Morgan-KaufmannPublishers,1996. [8] Mattern,Friedemann.VirtualTimeandGlobalStatesofDistributedSystems. Proceedings of the International Workshop on Parallel and Distributed Algo- rithms, 215-226, 1989. [9] Meneses, Esteban y Francisco J. Torres-Rojas. Possible and Impossible Vec- tor Clock Sets. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA ’04. Junio, 2004. [10] Schwarz, R. y Friedemann Mattern. Detecting Causal Relationships in Dis- tributed Systems: In Search of the Holy Grail. Distributed Computing, 1994. [11] Torres-Rojas, Francisco J. y Esteban Meneses. Algunas Propiedades Intere- santes de los Relojes Vectoriales. Jornadas Chilenas de Computación, 2003. [12] Yang, Z. y T.A. Marsland. (editores) Global States and Time in Distributed Systems. IEEE Computer Society Press, Los Alamos California, 1994.