{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T13:49:25Z","timestamp":1673704165372},"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\/bf01187075","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:19:50Z","timestamp":1108736390000},"page":"103-129","source":"Crossref","is-referenced-by-count":7,"title":["The Failure Discovery problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Vassos","family":"Hadzilacos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02277665","volume":"5","author":"E. S. Amdur","year":"1992","unstructured":"Amdur, E. S., S. M. Weber, and V. Hadzilacos. On the Message Complexity of Binary Byzantine Agreement Under Crash Failures.Distributed Computing,5:175?186, 1992.","journal-title":"Distributed Computing"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., N. A. Lynch, and N. Shavit. Are Wait-Free Algorithms Fast? InProc. 31st Symp. on Foundations of Computer Science, pp. 55?64, October 1990.","DOI":"10.1109\/FSCS.1990.89524"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., D. Dolev, C. Dwork, and H. R. Strong. Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. InProc. 6th ACM Symp. on Principles of Distributed Computing, pp. 42?51, August 1987.","DOI":"10.1145\/41840.41844"},{"key":"CR4","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P. A. Bernstein","year":"1987","unstructured":"Bernstein, P. A., V. Hadzilacos, and N. Goodman.Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, 1987."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Chandra, T. D., and S. Toueg. Unreliable Failure Detectors for Asynchronous Systems. InProc. 10th ACM Symp. on Principles of Distributed Computing, pp. 325?340, August 1991.","DOI":"10.1145\/112600.112627"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D. The Byzantine Generals Strike Again.Journal of Algorithms,3(1): 14?30, January 1982.","journal-title":"Journal of Algorithms"},{"key":"CR7","first-page":"213","volume-title":"Lecture Notes in Computer Science, Vol. 486","author":"C. Dwork","year":"1990","unstructured":"Dwork, C. Strong Verifiable Secret Sharing. InProc. 4th Internat. Workshop on Distributed Algorithms, pp. 213?227. Lecture Notes in Computer Science, Vol. 486. Springer-Verlag, Berlin, 1990."},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/319989.319992","volume":"8","author":"D. L. Eager","year":"1983","unstructured":"Eager, D. L., and K. C. Sevcik. Achieving Robustness in Distributed Database Systems.A CM Transactions on Database Systems,8(3): 354?381, September 1983.","journal-title":"A CM Transactions on Database Systems"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Fischer, M. J. The Consensus Problem in Unreliable Distributed Systems. Research Report RR-273, Department of Computer Science, Yale University, June 1983.","DOI":"10.1007\/3-540-12689-9_99"},{"key":"CR10","unstructured":"Hadzilacos, V. Issues of Fault-Tolerance in Concurrent Computations. Ph.D. dissertation, Aiken Computation Laboratory, Harvard University, June 1984."},{"key":"CR11","volume-title":"Proceedings published as Lecture Notes in Computer Science, Vol. 448","author":"V. Hadzilacos","year":"1990","unstructured":"Hadzilacos, V. On the Relationship Between the Atomic Commitment and Consensus Problems. Workshop on Fault Tolerant Distributed Computing, March 17?19, 1986, Pacific Grove, CA. (Proceedings published as Lecture Notes in Computer Science, Vol. 448 (B. Simons and A. Spector, eds.), Springer-Verlag, Berlin 1990.)"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V., and J. Y. Halpern. Message-Optimal Protocols for Byzantine Agreement.Mathematical Systems Theory, this issue, pp. 41?102, 1993.","DOI":"10.1007\/BF01187074"},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J. Y. Halpern","year":"1990","unstructured":"Halpern, J. Y., and Y. Moses. Knowledge and Common Knowledge in a Distributed Environment.Journal of the ACM,37(3):549?587, 1990. (Preliminary version inProc. 3rd ACM Symp. on Principles of Distributed Computing, pp. 50?61, August 1984.)","journal-title":"Journal of the ACM"},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L. The Weak Generals Problem.Journal of the ACM,30(3):668?676, July 1983.","journal-title":"Journal of the ACM"},{"key":"CR15","unstructured":"Lamport, L., and M. J. Fischer. Byzantine Generals and Transaction Commit Protocols. Technical Report Op. 62, SRI International, April 1982."},{"issue":"3","key":"CR16","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., R. Shostak, and M. Pease. The Byzantine Generals Problem.ACM Transactions on Programming Languages and Systems,4(3):382?401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Moses, Y., and O. Waarts. Coordinate Traversal:(t + l)-Round Byzantine Agreement in Polynomial Time. InProc. 29th Symp. on Foundations of Computer Science, pp. 246?255, October 1988.","DOI":"10.1109\/SFCS.1988.21941"},{"issue":"3","key":"CR18","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., and S. Toueg. Automatically Increasing the Fault-Tolerance of Distributed Algorithms.Journal of Algorithms,11(3): 374?419, September 1990.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"CR19","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults.Journal of the ACM,27(2):228?234, April 1980.","journal-title":"Journal of the ACM"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Ricciardi, A. M., and K. P. Birman. Using Process Groups To Implement Failure Detection in Asynchronous Environments. InProc. 10th ACM Symp. on Principles of Distributed Computing, pp. 341?351, August 1991.","DOI":"10.1145\/112600.112628"},{"key":"CR21","unstructured":"Skeen, M. D. Crash Recovery in a Distributed Database System. Ph.D. dissertation, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1982."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T. K. Srikanth","year":"1987","unstructured":"Srikanth, T. K., and S. Toueg. Simulating Authenticated Broadcasts To Derive Simple Fault-Tolerant Algorithms.Distributed Computing,2:80?94, 1987.","journal-title":"Distributed Computing"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Zwaenepoel, W. Protocols for Large Data Transfers over Local Area Networks. InProc. 9th Data Communications Symposium, pp. 22?32, Sept. 1985.","DOI":"10.1145\/318951.319001"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:07:28Z","timestamp":1586120848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01187075"],"URL":"https:\/\/doi.org\/10.1007\/bf01187075","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}