{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:38:19Z","timestamp":1753274299428,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020423","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"39-52","source":"Crossref","is-referenced-by-count":18,"title":["Primary partition \u201cVirtually-synchronous communication\u201d harder than consensus"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Schiper","sequence":"first","affiliation":[]},{"given":"Alain","family":"Sandoz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"4_CR1","first-page":"292","volume":"647","author":"Y. Amir","year":"1992","unstructured":"Y. Amir, D. Dolev, S. Kramer, and D. Malki. Membership Algorithms for Multicast Communication Groups. In 6 th Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (LCNS, 647), pages 292\u2013312, November 1992.","journal-title":"LCNS"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Y. Amir, L.E. Moser, P.M. Melliar-Smith, D.A. Agarwal, and P.Ciarfella. Fast Message Ordering and Membership Using a Logical Token-Passing Ring. In IEEE 13 th Intl. Conf. Distributed Computing Systems, pages 551\u2013560, May 93.","DOI":"10.1109\/ICDCS.1993.287668"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"K. Birman. The Process Group Approach to Reliable Distributed Computing. Comm. ACM, 36(l2):37\u201353, December 93.","DOI":"10.1145\/163298.163303"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/128738.128742","volume":"9","author":"K. Birman","year":"1991","unstructured":"K. Birman, A. Schiper, and P. Stephenson. Lightweight Causal and Atomic Group Multicast. ACM Trans. Comput. Syst., 9(3):272\u2013314, August 1991.","journal-title":"ACM Trans. Comput. Syst."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"T. D. Chandra, V. Hadzilacos, and S. Toueg. The Weakest Failure Detector for Solving Consensus. In proc. 11th annual ACM Symposium on Principles of Distributed Computing, pages 147\u2013158, 1992.","DOI":"10.21236\/ADA253611"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Tushar D. Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Technical Report 93-1374, Department of Computer Science, Cornell University, August 1993. A preliminary version appeared in the Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, pages 325\u2013340. ACM Press, August 1991.","DOI":"10.1145\/112600.112627"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy and L. Lamport. Distributed snapshots: determining global states of distributed systems. ACM Trans. Comp. Syst., 3(1):63\u201375, February 1985.","journal-title":"ACM Trans. Comp. Syst."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. J. ACM, 32:374\u2013382, April 1985.","journal-title":"J. ACM"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Comm. ACM, 21(7):558\u2013565, July 78.","DOI":"10.1145\/359545.359563"},{"key":"4_CR10","unstructured":"P. M. Melliar-Smith, L. E. Moser, and V. Agrawala. Membership Algorithms for Asynchronous Distributed Systems. In IEEE 11th Intl. Conf. Distributed Computing Systems, pages 480\u2013488, May 91."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"A. M. Ricciardi and K. P. Birman. Using Process Groups to Implement Failure Detection in Asynchronous Environments. In proc. annual ACM Symposium on Principles of Distributed Computing, pages 341\u2013352, August 1991.","DOI":"10.1145\/112600.112628"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"A. Schiper and A. Ricciardi. Virtually-Synchronous Communication Based on a Weak Failure Suspector. In IEEE 23rd Int Symp on Fault-Tolerant Computing (FTCS-23), pages 534\u2013542, June 93.","DOI":"10.21236\/ADA264352"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"A. Schiper and A. Sandoz. Uniform Reliable Multicast in a Virtually Synchronous Environment. In IEEE 13th Intl. Conf. Distributed Computing Systems, pages 561\u2013568, May 93.","DOI":"10.1109\/ICDCS.1993.287667"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:01:39Z","timestamp":1736082099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0020423","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}