{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:41:59Z","timestamp":1743133319448,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031757778"},{"type":"electronic","value":"9783031757785"}],"license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75778-5_22","type":"book-chapter","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T12:08:59Z","timestamp":1731845339000},"page":"469-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Give Probabilities a\u00a0Fair Chance!"],"prefix":"10.1007","author":[{"given":"Boudewijn R.","family":"Haverkort","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, N.: The Aloha system\u2013another alternative for computer communications. In: Proceedings of the Fall Joint Computer Conference (AFIPS), p. 37 (1970)","DOI":"10.21236\/AD0707853"},{"issue":"3","key":"22_CR2","first-page":"199","volume":"31","author":"N Abramson","year":"1985","unstructured":"Abramson, N.: Development of the Alohanet. IEEE Trans. Inf. Theory 31(3), 199\u2013123 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7785","key":"22_CR3","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1038\/d41586-019-03572-7","volume":"575","author":"D Adam","year":"2019","unstructured":"Adam, D.: Science funders gamble on grant lotteries. Nature 575(7785), 574\u2013575 (2019)","journal-title":"Nature"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-48320-9_12","volume-title":"CONCUR\u201999 Concurrency Theory","author":"C Baier","year":"1999","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H.: Approximative symbolic model checking of continuous-time markov chains. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 146\u2013161. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48320-9_12"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/10722167_28","volume-title":"Computer Aided Verification","author":"C Baier","year":"2000","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model checking continuous-time markov chains by transient analysis. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 358\u2013372. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_28"},{"issue":"6","key":"22_CR6","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C Baier","year":"2003","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng. 29(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"10","key":"22_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1810891.1810912","volume":"53","author":"C Baier","year":"2010","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Performance evaluation and model checking join forces. Commun. ACM 53(10), 76\u201385 (2010)","journal-title":"Commun. ACM"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proceedings Sixth ACM Symposium on Principles of Distributed Computing, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"22_CR9","unstructured":"van Elk, R., Braam, A.M., Vogt, B., Windig, R.: Opties voor de Toe-kenning van Onderzoeksbeurzen. CPB Policy Brief 2018\/02 (2018). https:\/\/www.cpb.nl\/sites\/default\/files\/omnidownload\/cpb-policy-brief-2018-02-selecteren-voor-kwaliteit-beleidsopties-voor-toekenning-onderzoeksbeurzen.pdf"},{"issue":"8","key":"22_CR10","first-page":"981","volume":"12","author":"W Fokkink","year":"2006","unstructured":"Fokkink, W., Pang, J.: Variations on Itai-Rodeh leader election for anonymous rings and their analysis in PRISM. J. Univ. Comput. Sci. 12(8), 981\u20131006 (2006)","journal-title":"J. Univ. Comput. Sci."},{"issue":"10","key":"22_CR11","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/30408.30414","volume":"30","author":"KA Frenkel","year":"1987","unstructured":"Frenkel, K.A., Scherr, A.L.: Big blue\u2019s time-sharing pioneer. Commun. ACM 30(10), 824\u2013828 (1987)","journal-title":"Commun. ACM"},{"key":"22_CR12","volume-title":"Performance of Computer Communication Systems","author":"BR Haverkort","year":"1998","unstructured":"Haverkort, B.R.: Performance of Computer Communication Systems. John Wiley & Sons, Hoboken (1998)"},{"key":"22_CR13","unstructured":"Katoen, J.-P.: Approximative Symbolic Model Checking of Continuous-Time Markov Chains. RWTH Aachen, Informatik Kolloquium 99-6 (1999)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributive networks. In: Proceedings IEEE Symposium on Foundations of Computer Science, pp. 150\u2013158, IEEE Computer Society Press (1981)","DOI":"10.1109\/SFCS.1981.41"},{"key":"22_CR15","unstructured":"Jean-Claude Laprie Award for Dependable Computing. https:\/\/www.dependability.org\/?p=708"},{"issue":"5","key":"22_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1317379.1317381","volume":"41","author":"A-M Kermarrec","year":"2007","unstructured":"Kermarrec, A.-M., van Steen, M.: Gossiping in distributed systems. ACM SIGOPS Oper. Syst. Rev. 41(5), 2\u20137 (2007)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"12","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TCOM.1975.1092768","volume":"23","author":"L Kleinrock","year":"1975","unstructured":"Kleinrock, L., Tobagi, F.A.: Packet switching in radio channels: Part I-carrier sense multiple-access modes and their throughput-delay charcteristics. IEEE Trans. Commun. 23(12), 1400\u20131416 (1975)","journal-title":"IEEE Trans. Commun."},{"key":"22_CR18","volume-title":"Computer Networking; A Top-Down Approach","author":"JF Kurose","year":"2016","unstructured":"Kurose, J.F., Ross, K.W.: Computer Networking; A Top-Down Approach, 7th edn. Pearson, Boston (2016)","edition":"7"},{"key":"22_CR19","first-page":"21","volume":"4","author":"S Lam","year":"1980","unstructured":"Lam, S.: A carrier sense multiple access protocol for local networks. Comput. Netw. 4, 21\u201332 (1980)","journal-title":"Comput. Netw."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Lehman, D., Rabin, M.O.: On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In: POPL 1981: Proceedings of the 8th ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 133\u2013138 (1981)","DOI":"10.1145\/567532.567547"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"van der Meer, M., Antheunis, M.A., Haverkort, B.R.: The practicalities of a partial lottery to allocate research funding. Res. Eval. (2024). https:\/\/doi.org\/10.1093\/reseval\/rvae023","DOI":"10.1093\/reseval\/rvae023"},{"issue":"3810","key":"22_CR22","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1126\/science.159.3810.56","volume":"159","author":"RK Merton","year":"1986","unstructured":"Merton, R.K.: The matthew effect in science. Science 159(3810), 56\u201363 (1986)","journal-title":"Science"},{"issue":"7","key":"22_CR23","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/360248.360253","volume":"19","author":"RM Metcalfe","year":"1976","unstructured":"Metcalfe, R.M., Boggs, D.R.: Ethernet: Distributed packet switching of local computer networks. Commun. ACM 19(7), 395\u2013404 (1976)","journal-title":"Commun. ACM"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Niederreiter, H., Shieu, P.J. (eds.): Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Springer, Heidelberg (1995)","DOI":"10.1007\/978-1-4612-2552-2"},{"key":"22_CR26","unstructured":"Sandell, M.J.: The Tyranny of Merit 2020. Nederlanse vertaling: De Tirannie van Verdienste, Uitgeverij Ten Have (2020)"},{"key":"22_CR27","volume-title":"An Analysis of Time-Shared Computer Systems","author":"AL Scherr","year":"1966","unstructured":"Scherr, A.L.: An Analysis of Time-Shared Computer Systems. MIT Press, Cambridge (1966)"},{"issue":"12","key":"22_CR28","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1111\/medu.13698","volume":"52","author":"S Schreurs","year":"2018","unstructured":"Schreurs, S., Cleland, J., Muijtjens, A.M., Oude Egbrink, M.G., Cleutjens, K.: Does selection pay off? A cost\u2013benefit comparison of medical school selection and lottery systems. Med. Educ. 52(12), 1240\u20131248 (2018). https:\/\/doi.org\/10.1111\/medu.13698","journal-title":"Med. Educ."},{"key":"22_CR29","unstructured":"Tweede Kamer der Staten Generaal, Wijziging van de Wet op het hoger onderwijs en wetenschappelijk onderzoek in verband met het toevoegen van decentrale loting als selectiemethode voor opleidingen met capaciteitsfixus in het hoger onderwijs. Dossier 35765, in Dutch (2020\u20132021)"},{"key":"22_CR30","unstructured":"Waterdrinker, P.: De rat van Amsterdam. Nijgh & Van Ditmar (2020)"}],"container-title":["Lecture Notes in Computer Science","Principles of Verification: Cycling the Probabilistic Landscape"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75778-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T13:03:37Z","timestamp":1731848617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75778-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"ISBN":["9783031757778","9783031757785"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75778-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"18 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}