{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:16:36Z","timestamp":1726038996164},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030256357"},{"type":"electronic","value":"9783030256364"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25636-4_31","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"400-407","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Does the Operational Model Capture Partition Tolerance in Distributed Systems?"],"prefix":"10.1007","author":[{"given":"Gr\u00e9goire","family":"Bonin","sequence":"first","affiliation":[]},{"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Perrin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Burckhardt, S., Gotsman, A., Morrison, A., Yang, H., Zawirski, M.: Specification and complexity of collaborative text editing. In: Symposium on Principles of Distributed Computing, pp. 259\u2013268. ACM (2016)","DOI":"10.1145\/2933057.2933090"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TPDS.2016.2556669","volume":"28","author":"H Attiya","year":"2017","unstructured":"Attiya, H., Ellen, F., Morrison, A.: Limitations of highly-available eventually-consistent data stores. IEEE Trans. Parallel Distrib. Syst. 28(1), 141\u2013155 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"31_CR3","unstructured":"Baldoni, R., Brzezinski, J., H\u00e9lary, J.M., Mostefaoui, A., Raynal, M.: Characterization of consistent global checkpoints in large-scale distributed systems. In: Workshop on Future Trends of Distributed Computing Systems, pp. 314\u2013323. IEEE (1995)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Bonin, G., Achour, M., Perrin, M.: Does the operational model capture partition tolerance in distributed systems? extended version (2019)","DOI":"10.1007\/978-3-030-25636-4_31"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: ACM Sigplan Notices, vol. 49, pp. 271\u2013284. ACM (2014)","DOI":"10.1145\/2535838.2535848"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM Sigact News 33, 51\u201359 (2002)","journal-title":"ACM Sigact News"},{"key":"31_CR7","volume-title":"Distributed Systems: Concurrency and Consistency","author":"M Perrin","year":"2017","unstructured":"Perrin, M.: Distributed Systems: Concurrency and Consistency. Elsevier, Amsterdam (2017)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Perrin, M., Mostefaoui, A., Jard, C.: Update consistency for wait-free concurrent objects. In: International Parallel and Distributed Processing Symposium, pp. 219\u2013228. IEEE (2015)","DOI":"10.1109\/IPDPS.2015.39"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/356725.356729","volume":"10","author":"B Randell","year":"1978","unstructured":"Randell, B., Lee, P., Treleaven, P.C.: Reliability issues in computing system design. ACM Comput. Surv. (CSUR) 10(2), 123\u2013165 (1978)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"6","key":"31_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0020-0190(91)90008-6","volume":"39","author":"M Raynal","year":"1991","unstructured":"Raynal, M., Schiper, A., Toueg, S.: The causal ordering abstraction and a simple way to implement it. Inf. Process. Lett. 39(6), 343\u2013350 (1991)","journal-title":"Inf. Process. Lett."},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-24550-3_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386\u2013400. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_29"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25636-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,4]],"date-time":"2019-12-04T21:23:31Z","timestamp":1575494611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25636-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030256357","9783030256364"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25636-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PaCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Computing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Almaty","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazakhstan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pact2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssd.sscc.ru\/conference\/pact2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}