{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:29:02Z","timestamp":1648992542999},"reference-count":14,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1080\/10637199608915541","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T06:52:07Z","timestamp":1183791127000},"page":"3-19","source":"Crossref","is-referenced-by-count":1,"title":["EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS"],"prefix":"10.1080","volume":"8","author":[{"given":"JOSYULA R.","family":"RAO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/1780.1804"},{"key":"CIT0002","volume-title":"Parallel Program Design A Foundation","author":"Chandy K. M.","year":"1988"},{"key":"CIT0003","volume-title":"Hierarchical Ordering of Sequential Processes","author":"Dijkstra E. W.","year":"1972"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90185-Z"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1145\/174666.174667"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90107-9"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon , Token management schemes and random walks yield self-stabilizing mutual exclusion . In Proceedings of the 9th Annual ACM SIGACT-SIGOPS Symposium on the Principles of Distributed Computing , Quebec City , Quebec , Canada , August 1990 . ACM, New York, August 1990 .","DOI":"10.1145\/93385.93409"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90103-5"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"D. Lehmann and M. O. Rabin , On the advantages of free choice A symmetric and fully distributed solution to the dining philosophers problem (extended abstract) . In Conference Record of the 8th Annual ACM Symposium on Principles of Programming Languages , Williamsburg , VA , 1981 , ACM, New York, 133\u2013138 .","DOI":"10.1145\/567532.567547"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843570"},{"key":"CIT0013","first-page":"21","volume-title":"Probabilistic Algorithms","author":"Rabin M. O.","year":"1976"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"J. R. Rao , Reasoning about probabilistic algorithms . In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing , 1990 .","DOI":"10.1145\/93385.93427"},{"key":"CIT0015","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1981150100471","volume":"15","author":"Tchucnte M.","year":"1981","journal-title":"RAIRO Inf. Theory"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10637199608915541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T07:02:38Z","timestamp":1556607758000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10637199608915541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1080\/10637199608915541"],"URL":"https:\/\/doi.org\/10.1080\/10637199608915541","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}