{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:00:15Z","timestamp":1768399215265,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"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":[[2014,2]]},"DOI":"10.1007\/s00446-013-0199-7","type":"journal-article","created":{"date-parts":[[2013,10,31]],"date-time":"2013-10-31T05:14:38Z","timestamp":1383196478000},"page":"55-77","source":"Crossref","is-referenced-by-count":3,"title":["Tolerating permanent and transient value faults"],"prefix":"10.1007","volume":"27","author":[{"given":"Zarko","family":"Milosevic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hutle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schiper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,1]]},"reference":[{"issue":"5","key":"199_CR1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00446-005-0151-6","volume":"18","author":"I Abraham","year":"2006","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos: optimal resilience with byzantine shared memory. Distrib. Comput. 18(5), 387\u2013408 (2006)","journal-title":"Distrib. Comput."},{"key":"199_CR2","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Consensus with byzantine failures and little system synchrony. In: Dependable Systems and Networks (DSN 2006), pp. 147\u2013155 (2006)","DOI":"10.1109\/DSN.2006.22"},{"key":"199_CR3","doi-asserted-by":"crossref","unstructured":"Anagnostou, E., Hadzilacos, V.: Tolerating transient and permanent failures (extended abstract). In: Proceedings of the 7th International Workshop on Distributed Algorithms, WDAG \u201993, pp. 174\u2013188. Springer, Berlin (1993)","DOI":"10.1007\/3-540-57271-6_35"},{"key":"199_CR4","doi-asserted-by":"crossref","unstructured":"Biely, M., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper, A., Widder, J.: Tolerating corrupted communication. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201907). ACM Press (2007)","DOI":"10.1145\/1281100.1281136"},{"issue":"40","key":"199_CR5","doi-asserted-by":"crossref","first-page":"5602","DOI":"10.1016\/j.tcs.2010.09.032","volume":"412","author":"M Biely","year":"2011","unstructured":"Biely, M., Schmid, U., Weiss, B.: Synchronous consensus under hybrid process and link failures. Theor. Comput. Sci. 412(40), 5602\u20135630 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"199_CR6","doi-asserted-by":"crossref","unstructured":"Borran, F., Hutle, M., Schiper, A.: Timing analysis of leader-based and decentralized byzantine consensus algorithms. In: LADC, pp. 166\u2013175 (2011)","DOI":"10.1109\/LADC.2011.12"},{"key":"199_CR7","doi-asserted-by":"crossref","unstructured":"Borran, F., Schiper, A.: A leader-free byzantine consensus algorithm. In: ICDCN, pp. 67\u201378 (2010)","DOI":"10.1007\/978-3-642-11322-2_11"},{"issue":"2","key":"199_CR8","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TDSC.2011.48","volume":"9","author":"F Borran","year":"2012","unstructured":"Borran, F., Hutle, M., Santos, N., Schiper, A.: Quantitative analysis of consensus algorithms. IEEE Trans. Dependable Secur. Comput. 9(2), 236\u2013249 (2012)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"199_CR9","doi-asserted-by":"crossref","unstructured":"Brasileiro, F.V., Greve, F., Most\u00e9faoui, A., Raynal, M.: Consensus in one communication step. In: Proceedings of the 6th International Conference on Parallel Computing Technologies, PaCT \u201901, pp. 42\u201350. Springer, London (2001)","DOI":"10.1007\/3-540-44743-1_4"},{"issue":"4","key":"199_CR10","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"199_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distributed Comput. 22(1), 49\u201371 (2009)","journal-title":"Distributed Comput."},{"issue":"2","key":"199_CR12","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"199_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"199_CR14","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: Proceeding of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201998), pp. 143\u2013152. ACM Press, Puerto Vallarta (1998)","DOI":"10.1145\/277697.277724"},{"key":"199_CR15","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Byzantizing paxos by refinement. In: Proceedings of the 25th International Conference on Distributed Computing, DISC\u201911, pp. 211\u2013224. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-24100-0_22"},{"key":"199_CR16","unstructured":"Lamport, L.: Fast paxos. Tech. Rep. MSR-TR-2005-12, Microsoft Research (2005)"},{"issue":"3","key":"199_CR17","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"199_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16, 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"199_CR19","doi-asserted-by":"crossref","unstructured":"Lampson, B.: The abcd\u2019s of paxos. In: Proceeding of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201901), p. 13. ACM Press (2001)","DOI":"10.1145\/383962.383969"},{"issue":"3","key":"199_CR20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"JP Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast byzantine consensus. Trans Dependable Secur. Comput. 3(3), 202\u2013214 (2006)","journal-title":"Trans Dependable Secur. Comput."},{"key":"199_CR21","doi-asserted-by":"crossref","unstructured":"Milosevic, Z., Hutle, M., Schiper, A.: Unifying Byzantine consensus algorithms with weak interactive consistency. In: 12th International Conference on Principles of Distributed Systems (OPODIS 2009) (2009)","DOI":"10.1007\/978-3-642-10877-8_24"},{"issue":"2","key":"199_CR22","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"199_CR23","doi-asserted-by":"crossref","unstructured":"Pedone, F., Schiper, A., Urb\u00e1n, P., Cavin, D.: Solving agreement problems with weak ordering oracles. In: Proceedings of the 4th European Dependable Computing Conference on Dependable Computing, EDCC-4, pp. 44\u201361. Springer, London (2002)","DOI":"10.1007\/3-540-36080-8_5"},{"key":"199_CR24","unstructured":"Pinter, S.S., Shinahr, I.: Distributed agreement in the presence of communication and process failures. In: Proceedings of the 14th IEEE Convention of Electrical & Electronics Engineers in Israel. IEEE (1985)"},{"key":"199_CR25","doi-asserted-by":"crossref","unstructured":"Rutti, O., Milosevic, Z., Schiper, A.: Generic construction of consensus algorithms for benign and byzantine faults. In: 2010 IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 343\u2013352. IEEE Computer Society, Los Alamitos (2010)","DOI":"10.1109\/DSN.2010.5544299"},{"key":"199_CR26","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Proceedings of the 6th Annual Symposium on Theor. Aspects of Computer Science (STACS\u201989), LNCS, vol. 349, pp. 304\u2013313. Springer, Paderborn (1989)","DOI":"10.1007\/BFb0028994"},{"issue":"2\u20133","key":"199_CR27","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.tcs.2007.04.036","volume":"384","author":"N Santoro","year":"2007","unstructured":"Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2\u20133), 232\u2013249 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"199_CR28","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s004460050016","volume":"9","author":"HM Sayeed","year":"1995","unstructured":"Sayeed, H.M., Abu-Amara, M., Abu-Amara, H.: Optimal asynchronous agreement and leader election algorithm for complete networks with byzantine faulty links. Distrib. Comput. 9, 147\u2013156 (1995)","journal-title":"Distrib. Comput."},{"key":"199_CR29","doi-asserted-by":"crossref","unstructured":"Schmid, U., Weiss, B., Rushby, J.: Formally verified byzantine agreement in presence of link faults. In: 22nd International Conference on Distributed Computing Systems (ICDCS\u201902), pp. 608\u2013616. Austria, Vienna (2002)","DOI":"10.1109\/ICDCS.2002.1022311"},{"key":"199_CR30","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1109\/71.667895","volume":"9","author":"HS Siu","year":"1998","unstructured":"Siu, H.S., Chin, Y.H., Yang, W.P.: Byzantine agreement in the presence of mixed faults on processors and links. IEEE Trans. Parallel Distrib. Syst. 9, 335\u2013345 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"199_CR31","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/69.142017","volume":"4","author":"KQ Yan","year":"1992","unstructured":"Yan, K.Q., Chin, Y.H., Wang, S.C.: Optimal agreement protocol in malicious faulty processors and faulty links. IEEE Trans. Knowl. Data Eng. 4(3), 266\u2013280 (1992)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0199-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-013-0199-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0199-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T19:08:38Z","timestamp":1746040118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0199-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["199"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0199-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,1]]}}}