{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:31:21Z","timestamp":1733290281134,"version":"3.30.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0304-3975(00)00042-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:07:20Z","timestamp":1027606040000},"page":"35-91","source":"Crossref","is-referenced-by-count":64,"title":["Revisiting the paxos algorithm"],"prefix":"10.1016","volume":"243","author":[{"given":"Roberto De","family":"Prisco","sequence":"first","affiliation":[]},{"given":"Butler","family":"Lampson","sequence":"additional","affiliation":[]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00042-6_BIB1","unstructured":"T.D. Chandra, V. Hadzilacos, S. Toueg, The weakest failure detector for solving consensus, J. ACM 43 (2) (1996) 685\u2013722. A preliminary version appeared in the Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 1992, pp. 147\u2013158."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB2","unstructured":"T.D. Chandra, S. Toueg, Unreliable failure detector for asynchronous distributed systems, J. ACM 43 (2) (1996) 225\u2013267. A preliminary version appeared in the Proc. 10th Annual ACM Symp. on Principles of Distributed Computing, August 1991, pp. 325\u2013340."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB3","doi-asserted-by":"crossref","unstructured":"E.C. Cooper, Replicated distributed programs, UCB\/CSD 85\/231, University of California, Berkeley, CA, May 1985.","DOI":"10.1145\/323647.323635"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB4","unstructured":"F. Cristian, C. Fetzer, The timed asynchronous system model, Dept. of Computer Science, UCSD, La Jolla, CA. Tech. Rep. CSE97-519."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB5","doi-asserted-by":"crossref","unstructured":"R. De Prisco, Revisiting the Paxos algorithm, M.S. Thesis, Massachusetts Institute of Technology, Lab. for Computer Science, Cambridge, MA, June 1997. Tech. Rep. MIT-LCS-TR-717, Lab. for Computer Science, MIT.","DOI":"10.1007\/BFb0030679"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB6","doi-asserted-by":"crossref","unstructured":"R. De Prisco, B. Lampson, N. Lynch, Revisiting the Paxos algorithm, in Proc. 11th Internat. Workshop on Distributed Algorithms, Saarbr\u00fccken, Germany, September 1997, pp. 111\u2013125.","DOI":"10.1007\/BFb0030679"},{"issue":"1","key":"10.1016\/S0304-3975(00)00042-6_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","article-title":"On the minimal synchrony needed for distributed consensus","volume":"34","author":"Dolev","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB8","doi-asserted-by":"crossref","unstructured":"D. Dolev, R. Friedman, I. Keidar, D. Malkhi, Failure detectors in omission failure environments, in Proc. 16th Annual ACM Symp. on Principles of Distributed Systems, Santa Barbara, CA, August 1997, p. 286. Also TR 96-1608, Department of Computer Science, Cornell University, September, 1996 and TR CS96-13, Institute of Computer Science, The Hebrew University of Jerusalem.","DOI":"10.1145\/259380.259501"},{"issue":"2","key":"10.1016\/S0304-3975(00)00042-6_BIB9","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","article-title":"Consensus in the presence of partial synchrony","volume":"35","author":"Dwork","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB10","doi-asserted-by":"crossref","unstructured":"A. El Abbadi, D. Skeen, F. Cristian, An efficient fault-tolerant protocol for replicated data management, Proc. 4th ACM SIGACT\/SIGMOD Conf. on Principles of Database Systems, 1985.","DOI":"10.1145\/325405.325443"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB11","doi-asserted-by":"crossref","unstructured":"A. El Abbadi, S. Toueg, Maintaining availability in partitioned replicated databases, Proc. 5th ACM SIGACT\/SIGMOD Conf. on Principles of Data Base Systems, 1986.","DOI":"10.1145\/6012.15418"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB12","doi-asserted-by":"crossref","unstructured":"A. Fekete, N. Lynch, A. Shvartsman, Specifying and using a partitionable group communication service, in Proc. 16th Annual ACM Symp. on Principles of Distributed Computing, August 1997, pp. 53\u201362.","DOI":"10.1145\/259380.259422"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB13","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, The consensus problem in unreliable distributed systems (a brief survey). Rep. YALEU\/DSC\/RR-273. Dept. of Computer Science, Yale Univ., New Have, Conn., June 1983.","DOI":"10.1007\/3-540-12689-9_99"},{"issue":"2","key":"10.1016\/S0304-3975(00)00042-6_BIB14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/S0304-3975(00)00042-6_BIB15","first-page":"150","article-title":"Weighted voting for replicated data, Proc. 7th ACM Symp. on Oper. Systems Principles","volume":"13","author":"Gifford","year":"1979","journal-title":"SIGOPS Oper. Systems Rev."},{"issue":"1","key":"10.1016\/S0304-3975(00)00042-6_BIB16","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/6306.6308","article-title":"A quorum-consensus replication method for abstract data types","volume":"4","author":"Herlihy","year":"1986","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB17","doi-asserted-by":"crossref","unstructured":"I. Keidar, D. Dolev, Efficient message ordering in dynamic networks, in Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, May 1996, pp. 68\u201376.","DOI":"10.1145\/248052.248062"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB18","doi-asserted-by":"crossref","unstructured":"I. Keidar, D. Dolev, Increasing the resilience of distributed and replicated database systems, J. Comput. System Sci. (JCSS), special issue with selected papers from PODS 1995, 57 (3) (1998) 309\u2013324.","DOI":"10.1006\/jcss.1998.1566"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB19","unstructured":"L. Lamport, The part-time parliament, ACM Trans. Comput. Systems 16 (2) (1998) 133\u2013169. Also Research Report 49, Digital Equipment Corporation Systems Research Center, Palo Alto, CA, September 1989."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB20","doi-asserted-by":"crossref","unstructured":"B. Lampson, How to build a highly available system using consensus, in Proc. 10th Internat. Workshop on Distributed Algorithms, Bologna, Italy, 1996, pp. 1\u201315.","DOI":"10.1007\/3-540-61769-8_1"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB21","unstructured":"B. Lampson, W. Weihl, U. Maheshwari, Principle of Computer Systems: Lecture Notes for 6.826, Fall 1992, Research Seminar Series MIT-LCS-RSS 22, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, July 1993."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB22","doi-asserted-by":"crossref","unstructured":"E.K. Lee, C.A. Thekkath, Petal: distributed virtual disks, in Proc. 7th Internat. Conf. on Architectural Support for Programming Languages and Operating Systems, Cambridge, MA, October 1996, pp. 84\u201392.","DOI":"10.1145\/237090.237157"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB23","doi-asserted-by":"crossref","unstructured":"B. Liskov, B. Oki, Viewstamped replication: A new primary copy method to support highly-available distributed systems, in Proc. 7th Annual ACM Symp. on Principles of Distributed Computing, August 1988, pp. 8\u201317.","DOI":"10.1145\/62546.62549"},{"year":"1996","series-title":"Distributed Algorithms","author":"Lynch","key":"10.1016\/S0304-3975(00)00042-6_BIB24"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB25","unstructured":"N. Lynch, M.R. Tuttle, An introduction to I\/O automata, CWI-Quart. 2 (3) 219\u2013246. CWI, Amsterdam, The Netherlands, Sep 89. Technical Memo MIT-LCS-TM-373, Lab. for Computer Science, MIT, Cambridge, MA, USA, Nov 88."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB26","doi-asserted-by":"crossref","unstructured":"N. Lynch, F. Vaandrager, Forward and backward simulations for timing-based systems. in Real-Time: Theory in Practice, Lecture Notes in Computer Science, Vol. 600, Springer, Berlin, 1992, pp. 397\u2013446.","DOI":"10.1007\/BFb0032002"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB27","doi-asserted-by":"crossref","unstructured":"N. Lynch, F. Vaandrager, Forward and backward simulations \u2013 Part II: Timing-based systems, Technical Memo MIT-LCS-TM-487.b, Lab. for Computer Science, MIT, Cambridge, MA, USA, April 1993.","DOI":"10.1007\/BFb0032002"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB28","unstructured":"N. Lynch, F. Vaandrager, Actions transducers and timed automata, Technical Memo MIT-LCS-TM-480.b, Lab. for Computer Science, MIT, Cambridge, MA, USA, October 1994."},{"key":"10.1016\/S0304-3975(00)00042-6_BIB29","doi-asserted-by":"crossref","unstructured":"M. Merritt, F. Modugno, M.R. Tuttle, Time constrained automata. CONCUR 91: 2nd Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 527, Springer, Berlin, 1991, pp. 408\u2013423.","DOI":"10.1007\/3-540-54430-5_103"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB30","doi-asserted-by":"crossref","unstructured":"B. Oki, Viewstamped replication for highly-available distributed systems, Ph.D. Thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, 1988.","DOI":"10.1145\/62546.62549"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB31","doi-asserted-by":"crossref","unstructured":"B. Patt-Shamir, A theory of clock synchronization, Ph.D. Thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, October 1994.","DOI":"10.1145\/195058.195466"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB32","doi-asserted-by":"crossref","unstructured":"B. Patt-Shamir, S. Rajsbaum, A theory of clock synchronization, in Proc. 26th Symp. on Theory of Computing, May 1994.","DOI":"10.1145\/195058.195466"},{"issue":"2","key":"10.1016\/S0304-3975(00)00042-6_BIB33","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB34","doi-asserted-by":"crossref","unstructured":"D. Skeen, Nonblocking Commit Protocols, Proc. ACM SIGMOD Internat. Conf. on Management of Data, May 1981, pp. 133\u2013142.","DOI":"10.1145\/582338.582339"},{"key":"10.1016\/S0304-3975(00)00042-6_BIB35","doi-asserted-by":"crossref","unstructured":"D. Skeen, D.D. Wright, Increasing availability in partitioned database systems, TR 83-581, Dept. of Computer Science, Cornell University, Mar 1984.","DOI":"10.1145\/588011.588054"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000426?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000426?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T01:15:10Z","timestamp":1733274910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397500000426"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00042-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}