{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081032,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_100","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"1214-1226","source":"Crossref","is-referenced-by-count":2,"title":["On Randomization Versus Synchronization in Distributed Systems"],"prefix":"10.1007","author":[{"given":"Hagen","family":"V\u00f6lzer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"100_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02242712","volume":"6","author":"P.C. Attie","year":"1993","unstructured":"Attie, P.C., Francez, N., Grumberg, O.: Fairness and hyperfairness in multiparty interactions. Distributed Computing\u00a06, 245\u2013254 (1993)","journal-title":"Distributed Computing"},{"key":"100_CR2","first-page":"27","volume-title":"Proc. 2nd PoDC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proc. 2nd PoDC, pp. 27\u201330. ACM, New York (1983)"},{"key":"100_CR3","volume-title":"Parallel Program Design: A Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)"},{"key":"100_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf.\u00a01, 115\u2013138 (1971)","journal-title":"Acta Inf."},{"issue":"2","key":"100_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. of the ACM"},{"issue":"3","key":"100_CR6","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/2166.357214","volume":"5","author":"S. Hart","year":"1983","unstructured":"Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent programs. ACM ToPLaS\u00a05(3), 356\u2013380 (1983)","journal-title":"ACM ToPLaS"},{"key":"100_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(97)00033-1","volume":"62","author":"E. Kindler","year":"1997","unstructured":"Kindler, E., Walter, R.: Mutex needs fairness. IPL\u00a062, 31\u201339 (1997)","journal-title":"IPL"},{"key":"100_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science\u00a013, 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"100_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/3-540-63165-8_209","volume-title":"Automata, Languages and Programming","author":"W. Vogler","year":"1997","unstructured":"Vogler, W.: Efficiency of asynchronous systems and read arcs in Petri nets. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 538\u2013548. Springer, Heidelberg (1997)"},{"key":"100_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-44685-0_13","volume-title":"CONCUR 2001 - Concurrency Theory","author":"H. V\u00f6lzer","year":"2001","unstructured":"V\u00f6lzer, H.: Randomized non-sequential processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 184\u2013201. Springer, Heidelberg (2001)"},{"key":"100_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/3-540-45694-5_36","volume-title":"CONCUR 2002 - Concurrency Theory","author":"H. V\u00f6lzer","year":"2002","unstructured":"V\u00f6lzer, H.: Refinement-robust fairness. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 547\u2013561. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:51Z","timestamp":1619998251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_100","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}