{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T10:51:55Z","timestamp":1673434315049},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01187073","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:19:50Z","timestamp":1108736390000},"page":"21-39","source":"Crossref","is-referenced-by-count":13,"title":["A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment"],"prefix":"10.1007","volume":"26","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, On Achieving Consensus Using a Shared Memory,Proc. 7th ACM Symp. on Principles of Distributed Computing, pp. 291?302, 1988.","DOI":"10.1145\/62546.62594"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"J. Aspnes and M. Herlihy, Fast Randomized Consensus Using Shared Memory,Journal of Algorithms,11, 441?461, 1990.","journal-title":"Journal of Algorithms"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an Asynchronous Environment,Journal of the ACM,37, 524?548, 1990.","journal-title":"Journal of the ACM"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"H. Attiya, D. Dolev, and N. Shavit. Bounded Polynomial Randomized Consensus,Proc. 8th ACM Symp. on Principles of Distributed Computing, pp. 281?293, 1989.","DOI":"10.21236\/ADA213808"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols,Proc. 2nd ACM Symp. on Principles of Distributed Computing, pp. 27?30, 1983.","DOI":"10.1145\/800221.806707"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"O. Biran, S. Moran, and S. Zaks, A Combinatorial Characterization of the Distributed Tasks Which are Solvable in the Presence of One Faulty Processor,Proc. 7th ACM Symp. on Principles of Distributed Computing, pp. 263?275, 1988.","DOI":"10.1145\/62546.62590"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"M. F. Bridgland and R. J. Watro, Fault-Tolerant Decision Making in totally Asynchronous Distributed Systems,Proc. 6th ACM Symp. on Principles of Distributed Computing, pp. 52?63, 1987.","DOI":"10.1145\/41840.41845"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and M. Li, On Processor Coordination Using Asynchronous Hardware,Proc. 6th ACM Symp on Principles of Distributed Computing, pp. 86?97, 1987.","DOI":"10.1145\/41840.41848"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B. Chor","year":"1989","unstructured":"B. Chor, M. Merritt, and D. Shmoys, Simple Constant-Time Consensus Protocols in Realistic Failure Models,Journal of the ACM,36, 591?614, 1989.","journal-title":"Journal of the ACM"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"B. Chor and L. Moscovici, Solvability in Asynchronous Environments,Proc. 30th Symp. on Foundations of Computer Science, pp. 422?427, 1989.","DOI":"10.1109\/SFCS.1989.63513"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, and L. Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus,Journal of the ACM,34, 77?97, 1987.","journal-title":"Journal of the ACM"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"D. Dolev and N. Shavit, Bounded Concurrent Time-Stamp Systems are Constructible,Proc. 21st ACM SIGACT Symp. on Theory of Computing, 1989.","DOI":"10.21236\/ADA213853"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the Presence of Partial Synchrony,Journal of the ACM,35, 288?323, 1988.","journal-title":"Journal of the ACM"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"C. Dwork, D. Shmoys, and L. Stockmeyer, Flipping Persuasively in Constant Expected Time,Proc. 27th Symp. on Foundations of Computer Science, pp. 222?232, 1986.","DOI":"10.1109\/SFCS.1986.20"},{"key":"CR15","unstructured":"P. Feldman, Private communication."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, The Consensus Problem in Unreliable Distributed Systems (a Brief Survey), YALEU\/DCS\/RR-273, June 1983.","DOI":"10.1007\/3-540-12689-9_99"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of Distributed Consensus with One Faulty Processor,Journal of the ACM,32, 374?382, 1985.","journal-title":"Journal of the ACM"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallagher","year":"1983","unstructured":"R. G. Gallagher, P. A. Humblet, and P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees,ACM Transactions on Programming Languages and Systems,5, 66?77, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy, Impossibility and Universality Results for Wait-Free Synchronization,Proc. 7th ACM Symp. on Principles of Distributed Computing, pp. 276?290, 1988.","DOI":"10.1145\/62546.62593"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Li, Bounded Time-Stamps,Proc. 28th Symp. on Foundations of Computer Science, pp. 371?382, 1987.","DOI":"10.1109\/SFCS.1987.10"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, On Interprocess Communication, Part I and II,Distributed Computing,1, 77?101, 1986.","journal-title":"Distributed Computing"},{"key":"CR22","first-page":"163","volume":"4","author":"M. G. Loui","year":"1987","unstructured":"M. G. Loui and H. Abu-Amara, Memory Requirements for Agreement Among Unreliable Asynchronous Processes,Advances in Computing Research,4, 163?183, 1987.","journal-title":"Advances in Computing Research"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, and L. Lamport, Reaching Agreement in the Presence of Faults,Journal of the ACM,27, 228?234, 1980.","journal-title":"Journal of the ACM"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187073.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187073\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:07:23Z","timestamp":1586120843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01187073"],"URL":"https:\/\/doi.org\/10.1007\/bf01187073","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}