{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:57Z","timestamp":1725490197093},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678977"},{"type":"electronic","value":"9783540446187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_39","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:38:51Z","timestamp":1188311931000},"page":"552-565","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting Safety and Liveness in the Context of Failures"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anindya","family":"Basu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"issue":"4","key":"39_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21(4):181\u2013185, 1985.","journal-title":"Information Processing Letters"},{"unstructured":"H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Mc Graw Hill, 1998.","key":"39_CR2"},{"unstructured":"B. Charron-Bost and Andr\u00e9 Schiper. Uniform consensus is harder than consensus. Technical report, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, April 2000.","key":"39_CR3"},{"doi-asserted-by":"crossref","unstructured":"Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685\u2013722, July 1996. An extended abstract appeared in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, August, 1992, 147\u2013158.","key":"39_CR4","DOI":"10.21236\/ADA253611"},{"doi-asserted-by":"crossref","unstructured":"Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77\u201397, January 1987.","key":"39_CR5","DOI":"10.1145\/7531.7533"},{"doi-asserted-by":"crossref","unstructured":"Cynthia Dwork, Nancy A. Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288\u2013323, April 1988.","key":"39_CR6","DOI":"10.1145\/42282.42283"},{"doi-asserted-by":"crossref","unstructured":"Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","key":"39_CR7","DOI":"10.1145\/3149.214121"},{"unstructured":"Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: proceedings of the IFIP 9th World Congress, pages 657\u2013668. IFIP, North-Holland, September 1983.","key":"39_CR8"},{"unstructured":"Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996.","key":"39_CR9"},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374\u2013419, 1990.","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Amir Pnueli. The temporal logic of programs. In Proceedings of the 18th Symposium on Foundations of Computer Science, pages 46\u201357. IEEE Computer Society Press, 1977.","key":"39_CR11","DOI":"10.1109\/SFCS.1977.32"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:09:42Z","timestamp":1556816982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}