{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T17:38:47Z","timestamp":1748367527982},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_23","type":"book-chapter","created":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T21:13:03Z","timestamp":1238101983000},"page":"318-332","source":"Crossref","is-referenced-by-count":11,"title":["Bisimulation for Demonic Schedulers"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gethin","family":"Norman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Parker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","first-page":"98","volume-title":"Proc. CSFW","author":"A.W. Roscoe","year":"1995","unstructured":"Roscoe, A.W.: Modelling and verifying key-exchange protocols using CSP and FDR. In: Proc. CSFW, pp. 98\u2013107. IEEE Computer Soc. Press, Los Alamitos (1995)"},{"key":"23_CR2","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.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148, 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"23_CR3","first-page":"104","volume-title":"Proceedings of POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL 2001, pp. 104\u2013115. ACM, New York (2001)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S. Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.D.: Analysis of an electronic voting protocol in the applied pi calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 186\u2013200. Springer, Heidelberg (2005)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"McLean: A general theory of composition for a class of \u201cpossibilistic\u201d properties. IEEETSE: IEEE Transactions on Software Engineering 22 (1996)","DOI":"10.1109\/32.481534"},{"key":"23_CR6","volume-title":"Proc. of 1995 IEEE Symposium on Security and Privacy","author":"B. Roscoe","year":"1995","unstructured":"Roscoe, B.: CSP and determinism in security modelling. In: Proc. of 1995 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-74407-8_4","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 42\u201358. Springer, Heidelberg (2007)"},{"key":"23_CR8","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT (1995)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Norman, G., Parker, D.: Bisimulation for demonic schedulers. Technical report (2009), http:\/\/www.win.tue.nl\/~kostas\/","DOI":"10.1007\/978-3-642-00596-1_23"},{"key":"23_CR10","unstructured":"Chatzikokolakis, K.: Probabilistic and Information-Theoretic Approaches to Anonymity. PhD thesis, Ecole Polytechnique, Paris (2007)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-61474-5_57","volume-title":"Computer Aided Verification","author":"C. Baier","year":"1996","unstructured":"Baier, C.: Polynomial-time algorithms for testing probabilistic bisimulation and simulation. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 50\u201361. Springer, Heidelberg (1996)"},{"key":"23_CR12","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)"},{"key":"23_CR13","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":"23_CR14","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: Proceedings the 8th International Workshop on Discrete Event Systems (WODES 2006), Ann Arbor, Michigan (2006)","DOI":"10.1109\/WODES.2006.1678432"},{"key":"23_CR15","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.K., Liskov, M., Lynch, N.A., 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":"23_CR16","unstructured":"Garcia, F.D., van Rossum, P., Sokolova, A.: Probabilistic anonymity and admissible schedulers, arXiv:0706.1019v1 (2007)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45251-6_8","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"J. J\u00fcrjens","year":"2001","unstructured":"J\u00fcrjens, J.: Secrecy-preserving refinement. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol.\u00a02021, p. 135. Springer, Heidelberg (2001)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Mantel, H.: Possibilistic definitions of security - an assembly kit. In: CSFW, pp. 185\u2013199 (2000)","DOI":"10.1109\/CSFW.2000.856936"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/288090.288117","volume-title":"Proceedings of the 5th ACM Conference on Computer and Communications Security","author":"P. Lincoln","year":"1998","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: Proceedings of the 5th ACM Conference on Computer and Communications Security, pp. 112\u2013121. ACM Press, New York (1998)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-61770-1_38","volume-title":"Computer Security - ESORICS 96","author":"S. Schneider","year":"1996","unstructured":"Schneider, S., Sidiropoulos, A.: CSP and anonymity. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol.\u00a01146, pp. 198\u2013218. Springer, Heidelberg (1996)"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"K. Chatzikokolakis","year":"2008","unstructured":"Chatzikokolakis, K., Knight, S., Panangaden, P.: Epistemic strategies and games on concurrent processes. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T23:52:07Z","timestamp":1558223527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}