{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:29Z","timestamp":1725663389824},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516873"},{"type":"electronic","value":"9783540467502"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51687-5_35","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:13:24Z","timestamp":1330204404000},"page":"94-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Highly concurrent logically synchronous multicast"],"prefix":"10.1007","author":[{"given":"Kenneth J.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"4","key":"9_CR1","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. JACM 32(4), October, 1985, pp. 804\u2013823.","journal-title":"JACM"},{"key":"9_CR2","unstructured":"Bagrodia, R. A distributed algorithm to implement the generalized alternative command of CSP. The 6th International Conference on Distributed Computing Systems, May 1986, pp. 422\u2013427."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bagrodia, R. A distributed algorithm to implement N-party rendezvous. The 7th Conference on Foundations of Software Technology and Computer Science, Pune, India, December 1987. Lecture Notes in Computer Science 287, Springer Verlag, 1987.","DOI":"10.1007\/3-540-18625-5_48"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"K.P. Birman","year":"1987","unstructured":"Birman, K.P., and Joseph, T.A. Reliable Communication in the Presence of Failures. ACM Transactions on Computer Systems, 5(1):47\u201376, 1987.","journal-title":"ACM Transactions on Computer Systems"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bloom, B. Constructing Two-Writer Atomic Registers. 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August, 1987, pp. 249\u2013259. Also, to appear in Special Issue of IEEE Transactions on Computing, on Parallel and Distributed Algorithms.","DOI":"10.1145\/41840.41861"},{"key":"9_CR6","unstructured":"Department of Defense, Ada Programming Language, ANSI\/MIL-STD-1815A-1983."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Fekete, A., Lynch, N., and Shrira, L. A Modular Proof of Correctness for a Network Synchronizer. 2nd International Workshop on Distributed Algorithms, Amsterdam, The Netherlands, July,1987.","DOI":"10.1007\/BFb0019807"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., and Paterson, M. Impossibility of distributed consensus with one family faulty process. Journal of the ACM, 32(2):374\u2013382, 1985.","journal-title":"Journal of the ACM"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Goldman, K.J., Highly Concurrent Logically Synchronous Multicast. M.I.T. Laboratory for Computer Science Technical Memo MIT\/LCS\/TM-401, July 1989.","DOI":"10.1007\/3-540-51687-5_35"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Goldman, K.J., and Lynch, N.A. Quorum Consensus in Nested Transaction Systems. 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August, 1987.","DOI":"10.1145\/41840.41843"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Herlihy, M. Impossibility and Universality Results for Wait-Free Synchronization. In Proceedings of 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Toronto, Ontario, Canada, August, 1988, pp. 276\u2013290.","DOI":"10.1145\/62546.62593"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Hoare, C. A. R. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"issue":"7","key":"9_CR13","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. Communications of the ACM, 27(7):558\u2013565, 1978.","journal-title":"Communications of the ACM"},{"key":"9_CR14","unstructured":"Lynch, N.A., and Goldman, K.J. Distributed Algorithms. MIT Research Seminar Series MIT\/LCS\/RSS-5, May 1989."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., and Merritt, M. Introduction to the Theory of Nested Transactions. ICDT'86 International Conference on Database Theory. Rome, Italy, September, 1986, pp. 278\u2013305. Also, MIT\/LCS\/TR-367 July 1986. A revised version will appear in Theoretical Computer Science.","DOI":"10.1007\/3-540-17187-8_42"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Lynch, N., Mansour, Y., and Fekete, A. Data Link Layer: Two Impossibility Results. In Proceedings of 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Toronto, Ontario, Canada, August, 1988, pp. 149\u2013170.","DOI":"10.1145\/62546.62572"},{"key":"9_CR17","unstructured":"Lynch, N., Merritt, M., Weihl, W., and Fekete, A. Atomic Transactions. In progress."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., and Tuttle, M.R. Hierarchical Correctness Proofs for Distributed Algorithms. Master's Thesis, Massachusetts Institute of Technology, April, 1987. MIT\/LCS\/TR-387, April, 1987.","DOI":"10.1145\/41840.41852"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., and Tuttle, M.R. Hierarchical Correctness Proofs for Distributed Algorithms. In Proceedings of 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Vancouver, British Columbia, Canada, August, 1987, pp. 137\u2013151.","DOI":"10.1145\/41840.41852"},{"key":"9_CR20","unstructured":"Lynch, N.A., and Tuttle, M.R. An Introduction to Input\/Output Automata. CWI Quarterly, CWI Amsterdam, September 1989."},{"key":"9_CR21","unstructured":"Lynch, N.A., and Welch, J.L. Synthesis of Efficient Drinking Philosophers Algorithms. In progress."},{"issue":"1","key":"9_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/6462.6485","volume":"18","author":"J. Misra","year":"1986","unstructured":"Misra, J. Distributed Discrete-Event Simulation. Computing Surveys, 18(1):39\u201365, 1986.","journal-title":"Computing Surveys"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Welch, J., Lamport, L., and Lynch, N. A Lattice-Structured Proof of a Minimum Spanning Tree Algorithm. In Proceedings of 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Toronto, Ontario, Canada, August, 1988, pp. 28\u201343.","DOI":"10.21236\/ADA198312"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51687-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:00:10Z","timestamp":1640919610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}