{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:29Z","timestamp":1759638089839},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_4","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"42-58","source":"Crossref","is-referenced-by-count":23,"title":["Making Random Choices Invisible to the Scheduler"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"327","volume-title":"Proc. of the Symp. on Foundations of Comp. Sci.","author":"M. Vardi","year":"1985","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of the Symp. on Foundations of Comp. Sci., pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"4_CR2","first-page":"102","volume-title":"Proceedings of the Symp. on Real-Time Systems","author":"H. Hansson","year":"1989","unstructured":"Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: Proceedings of the Symp. on Real-Time Systems, pp. 102\u2013111. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Yi, W., Larsen, K.: Testing probabilistic and nondeterministic processes. In: Proc. of the IFIP Symp. on Protocol Specification, Testing and Verification (1992)","DOI":"10.1016\/B978-0-444-89874-6.50010-6"},{"key":"4_CR4","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT\/LCS\/TR-676 (1995)"},{"issue":"2","key":"4_CR5","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"4_CR6","first-page":"278","volume-title":"Proc. of the Real-Time Systems Symp.","author":"H. Hansson","year":"1990","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabitilies. In: Proc. of the Real-Time Systems Symp., pp. 278\u2013287. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-48224-5_31","volume-title":"Automata, Languages and Programming","author":"E. Bandini","year":"2001","unstructured":"Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 370\u2013381. Springer, Heidelberg (2001)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Andova, S.: Probabilistic process algebra. PhD thesis, TU Eindhoven (2002)","DOI":"10.1007\/3-540-45319-9_15"},{"key":"4_CR9","series-title":"ENTCS","first-page":"7","volume-title":"Proc. of EXPRESS","author":"M. Mislove","year":"2004","unstructured":"Mislove, M., Ouaknine, J., Worrell, J.: Axioms for probability and nondeterminism. In: Proc. of EXPRESS. ENTCS, vol.\u00a096, pp. 7\u201328. Elsevier, Amsterdam (2004)"},{"issue":"2-3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2004.11.020","volume":"335","author":"C. Palamidessi","year":"2005","unstructured":"Palamidessi, C., Herescu, O.: A randomized encoding of the \u03c0-calculus with mixed choice. Theoretical Computer Science\u00a0335(2-3), 373\u2013404 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/11601548_17","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"Y. Deng","year":"2005","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 309\u2013337. Springer, Heidelberg (2005)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Validation of Stochastic Systems","author":"A. Sokolova","year":"2004","unstructured":"Sokolova, A., de Vink, E.: Probabilistic automata: system types, parallel composition and comparison. In: Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 1\u201343. Springer, Heidelberg (2004)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/B978-044482830-9\/50029-1","volume-title":"Handbook of Process Algebra","author":"B. Jonsson","year":"2001","unstructured":"Jonsson, B., Larsen, K., Yi, W.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra, pp. 685\u2013710. Elsevier, Amsterdam (2001)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11580850_9","volume-title":"Trustworthy Global Computing","author":"K. Chatzikokolakis","year":"2005","unstructured":"Chatzikokolakis, K., Palamidessi, C.: A framework for analyzing probabilistic protocols and its application to the partial secrets exchange. In: De Nicola, R., Sangiorgi, D. (eds.) TGC 2005. LNCS, vol.\u00a03705, pp. 146\u2013162. Springer, Heidelberg (2005)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Task-structured probabilistic i\/o automata. In: Proc. of WODES (2006)","DOI":"10.1109\/WODES.2006.1678432"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11864219_17","volume-title":"Distributed Computing","author":"R. Canetti","year":"2006","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Time-bounded task-PIOAs: A framework for analyzing security protocols. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 238\u2013253. Springer, Heidelberg (2006)"},{"key":"4_CR17","unstructured":"Garcia, F., van Rossum, P., Sokolova, A.: Probabilistic anonymity and admissible schedulers, arXiv:0706.1019v1 (2007)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44804-7","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, Springer, Heidelberg (2001)"},{"issue":"1-2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a034(1-2), 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:08Z","timestamp":1619519108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}