{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:05:37Z","timestamp":1765112737618},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:22Z","timestamp":1330253782000},"page":"153-165","source":"Crossref","is-referenced-by-count":19,"title":["A continuum of failure models for distributed computing"],"prefix":"10.1007","author":[{"given":"Juan A.","family":"Garay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth J.","family":"Perry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"11_CR1","unstructured":"R. Bazzi and G. Neiger. Optimally simulating crash failures. In Proceedings of the Fifth International Workshop on Distributed Algorithms. Springer-Verlag, 1991."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"P. Berman, J.A. Garay, and K.J. Perry. Towards optimal distributed consensus. In Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science, pages 410\u2013415. IEEE Computer Society Press, 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"D. Dolev. The byzantine generals strike again. Journal of Algorithms, 3(1):14\u201330, 1982.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"11_CR4","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"D. Dolev, R. Reischuk, and H.R. Strong. Early stopping in byzantine agreement. Journal of the ACM, 37(4):720\u2013741, 1990.","journal-title":"Journal of the ACM"},{"key":"11_CR5","unstructured":"V. Hadzilacos. Issues of fault tolerance in concurrent computations. Ph.D. Dissertation, Harvard University, 1984."},{"issue":"3","key":"11_CR6","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. The weak byzantine generals problem. Journal of the ACM, 30(3):668\u2013676, 1983.","journal-title":"Journal of the ACM"},{"key":"11_CR7","unstructured":"L. Lamport and M. Fischer. Byzantine generals and transaction commit protocols. Technical Report Opus 62, SRI, 1982."},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R.E. Shostak, and M. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"G. Neiger and S. Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374\u2013419, 1990.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"11_CR10","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R.E. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228\u2013234, 1980.","journal-title":"Journal of the ACM"},{"issue":"3","key":"11_CR11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K.J. Perry","year":"1986","unstructured":"K.J. Perry and S. Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477\u2013482, 1986.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"11_CR12","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"K.J. Perry","year":"1987","unstructured":"K.J. Perry S. Toueg and T.K. Srikanth. Fast distributed agreement. SIAM Journal of Computing, 16(3):445\u2013457, 1987.","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"11_CR13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"T.K. Srikanth and S. Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80\u201394, 1987.","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:39Z","timestamp":1619570919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}