{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T12:01:29Z","timestamp":1757592089334},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01784720","type":"journal-article","created":{"date-parts":[[2005,6,20]],"date-time":"2005-06-20T02:05:39Z","timestamp":1119233139000},"page":"189-207","source":"Crossref","is-referenced-by-count":9,"title":["Highly concurrent logically synchronous multicast"],"prefix":"10.1007","volume":"4","author":[{"given":"Kenneth J.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01784720_CR1","unstructured":"Ada programming language. Tech Rep ANSI\/MIL-STD-1815A-1983, Department of Defense"},{"issue":"4","key":"BF01784720_CR2","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B Awerbuch","year":"1985","unstructured":"Awerbuch B: Complexity of network synchronization. J ACM 32(4): 804\u2013823 (1985)","journal-title":"J ACM"},{"issue":"4","key":"BF01784720_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/48022.48023","volume":"10","author":"RJR Back","year":"1988","unstructured":"Back RJR, Kurki-Suonio R: Distributed cooperation with action systems. ACM Trans Program Lang Syst 10(4): 513\u2013554 (1988)","journal-title":"ACM Trans Program Lang Syst"},{"key":"BF01784720_CR4","volume-title":"On the design of high performance distributed systems","author":"R Bagrodia","year":"1987","unstructured":"Bagrodia R: On the design of high performance distributed systems. Ph.D. dissertation, University of Texas, Austin, 1987"},{"issue":"1","key":"BF01784720_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"KP Birman","year":"1987","unstructured":"Birman KP, Joseph TA: Reliable communication in the presence of failures. ACM Trans Comput Syst 5(1): 47\u201376 (1987)","journal-title":"ACM Trans Comput Syst"},{"issue":"12","key":"BF01784720_CR6","first-page":"1506","volume":"37","author":"B Bloom","year":"1988","unstructured":"Bloom B: Constructing two-writer atomic registers. IEEE Trans Comput (Special Issue on Parallel and Distributed Algorithms) 37(12): 1506\u20131514 (1988). Also in 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 1987, pp 249\u2013259","journal-title":"IEEE Trans Comput (Special Issue on Parallel and Distributed Algorithms)"},{"issue":"2","key":"BF01784720_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/69624.357208","volume":"5","author":"GN Buckley","year":"1983","unstructured":"Buckley GN, Silberschatz A: An effective implementation for the generalized input-output construct of CSP. ACM Trans Program Lang Syst 5(2): 223\u2013235 (1983)","journal-title":"ACM Trans Program Lang Syst"},{"issue":"1","key":"BF01784720_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev D, Dwork C, Stockmeyer L: On the minimal synchronism needed for distributed consensus. J ACM 34(1): 77\u201397 (1987)","journal-title":"J ACM"},{"key":"BF01784720_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BFb0039061","volume-title":"CONCUR'90, Theories of concurrency: unification and extension","author":"A Fekete","year":"1990","unstructured":"Fekete A, Lynch N: The need for headers: an impossibility result for communication over unreliable channels. In Goos G, Hartmanis J (eds) CONCUR'90, Theories of concurrency: unification and extension. (Lect Notes Comput Sci, vol 458) Springer, Berlin Heidelberg New York 1990, pp 199\u2013216"},{"key":"BF01784720_CR10","unstructured":"Fekete A, Lynch N, Mansour Y, Spinelli J: The data link layer: the impossibility of implementation in face of crashes. Tech Memo MIT\/LCS\/TM-355.b, MIT Laboratory for Computer Science, August 1989 (submitted for publication)"},{"key":"BF01784720_CR11","doi-asserted-by":"crossref","unstructured":"Fekete A, Lynch N, Shrira L: A modular proof of correctness for a network synchronizer. In: The 2nd International Workshop on Distributed Algorithms, July 1987: Amsterdam, The Netherlands","DOI":"10.1007\/BFb0019807"},{"issue":"2","key":"BF01784720_CR12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374\u2013382 (1985)","journal-title":"J ACM"},{"key":"BF01784720_CR13","doi-asserted-by":"crossref","unstructured":"Goldman K, Lynch N: Modelling shared state in a shared action model. In: Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, June 1990","DOI":"10.21236\/ADA221279"},{"key":"BF01784720_CR14","doi-asserted-by":"crossref","unstructured":"Goldman KJ: Distributed algorithm simulation using Input\/Output automata. Tech Rep MIT\/LCS\/TR-490, MIT Laboratory for Computer Science, July 1990. Ph.D. Thesis","DOI":"10.21236\/ADA228113"},{"key":"BF01784720_CR15","doi-asserted-by":"crossref","unstructured":"Goldman KJ, Lynch NA: Quorum consensus in nested transaction systems. In: Proceedings of the 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp 27\u201341, August 1987. A full version is available as MIT Tech Rep MIT\/LCS\/TR-390","DOI":"10.1145\/41840.41843"},{"key":"BF01784720_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy M: Impossibility and universality results for wait-free synchronization. In: Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Prinicples of Distributed Computing, pp 276\u2013290, August 1988","DOI":"10.1145\/62546.62593"},{"key":"BF01784720_CR17","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR: Communicating sequential processes, Prentice-Hall, Englewood Cliffs, New Jersey, 1985"},{"key":"BF01784720_CR18","doi-asserted-by":"crossref","unstructured":"Joseph TA, Birman KP: Reliable broadcast protocols. In: Mullender (ed) An advanced course on distributed computing, chap 14. ACM Press, 1989","DOI":"10.1145\/90417.90750"},{"issue":"7","key":"BF01784720_CR19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"27","author":"L Lamport","year":"1978","unstructured":"Lamport L: Time, clocks, and the ordering of events in a distributed system. Commun ACM, 27(7): 558\u2013565 (1978)","journal-title":"Commun ACM"},{"key":"BF01784720_CR20","doi-asserted-by":"crossref","unstructured":"Lynch N, Merritt M: Introduction to the theory of nested transactions. In: International Conference on Database Theory, pp 278\u2013305, Rome, Italy, September 1986. Also, expanded version in Tech Rep, MIT\/LCS\/TR-367, MIT Laboratory for Computer Science, July 1986. Revised version in Theor Comput Sci 62(1988): 123\u2013185","DOI":"10.1016\/0304-3975(86)90014-9"},{"key":"BF01784720_CR21","unstructured":"Lynch N, Merritt M, Weihl W, Fekete A: Atomic transactions. (in progress)"},{"key":"BF01784720_CR22","unstructured":"Lynch N, Goldman KJ: Distributed algorithms. Tech Rep MIT\/LCS\/RSS-5, MIT Laboratory for Computer Science, May 1989. MIT Research Seminar Series"},{"key":"BF01784720_CR23","doi-asserted-by":"crossref","unstructured":"Lynch N, Mansour Y, Fekete A: Data link layer: two impossibility results. In: Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp 149\u2013170, August 1988","DOI":"10.21236\/ADA200983"},{"key":"BF01784720_CR24","doi-asserted-by":"crossref","unstructured":"Lynch NA, Tuttle MR: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp 137\u2013151, August 1987. A full version is available as MIT Tech Rep MIT\/LCS\/TR-387","DOI":"10.1145\/41840.41852"},{"key":"BF01784720_CR25","unstructured":"Lynch NA Tuttle MR: An introduction to input\/output automata. CWI-Quarterly 2(3) (1989)"},{"issue":"18","key":"BF01784720_CR26","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/6462.6485","volume":"1","author":"J Misra","year":"1986","unstructured":"Misra J: Distributed discrete-event simulation. Comput Surv 1(18): 39\u201365 (1986)","journal-title":"Comput Surv"},{"key":"BF01784720_CR27","unstructured":"Modugno F, Merritt M, Tuttle MR: Time constrained automata. Unpublished manuscript, November 1988"},{"issue":"4","key":"BF01784720_CR28","first-page":"179","volume":"2","author":"FB Schneider","year":"1982","unstructured":"Schneider FB: Synchronization in distributed programs. ACM Trans Program Lang Syst 2(4): 179\u2013195 (1982)","journal-title":"ACM Trans Program Lang Syst"},{"key":"BF01784720_CR29","doi-asserted-by":"crossref","unstructured":"Welch J, Lamport L, Lynch N: A lattice-structured proof of a minimum spanning tree algorithm. In: Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp 28\u201343, August 1988","DOI":"10.21236\/ADA198312"},{"key":"BF01784720_CR30","doi-asserted-by":"crossref","unstructured":"Welch J, Lynch NA: Synthesis of efficient drinking philosophers algorithms. Tech Rep MIT\/LCS\/TM-417, MIT, Laboratory for Computer Science, November 1989 (submitted for publication)","DOI":"10.21236\/ADA216390"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784720.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01784720\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T21:07:26Z","timestamp":1586293646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01784720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01784720"],"URL":"https:\/\/doi.org\/10.1007\/bf01784720","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}