{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:37Z","timestamp":1763467837988},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76637-7_12","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T02:47:52Z","timestamp":1195526872000},"page":"175-190","source":"Crossref","is-referenced-by-count":27,"title":["A Probabilistic Applied Pi\u2013Calculus"],"prefix":"10.1007","author":[{"given":"Jean","family":"Goubault-Larrecq","sequence":"first","affiliation":[]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[]},{"given":"Angelo","family":"Troina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/360204.360213","volume-title":"POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: POPL 2001, pp. 104\u2013115. ACM Press, New York (2001)"},{"issue":"1","key":"12_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), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/JCS-2004-12202","volume":"12","author":"A. Aldini","year":"2004","unstructured":"Aldini, A., Bravetti, M., Gorrieri, R.: A Process-algebraic Approach for the Analysis of Probabilistic Non Interference. Journal of Computer Security\u00a012, 191\u2013245 (2004)","journal-title":"Journal of Computer Security"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/941350.941368","volume-title":"WSNA 2003","author":"C.L. Barrett","year":"2003","unstructured":"Barrett, C.L., Eidenbenz, S.J., Kroc, L., Marathe, M., Smith, J.P.: Parametric Probabilistic Sensor Network Routing. In: WSNA 2003, pp. 122\u2013131. ACM Press, New York (2003)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","first-page":"19","volume-title":"ESOP 2007","author":"M.G. Buscemi","year":"2007","unstructured":"Buscemi, M.G., Montanari, U.: CC\u2013pi: A Constraint\u2013based Language for Specifying Service Level Agreements. In: ESOP 2007. LNCS, vol.\u00a04421, pp. 19\u201332. Springer, Heidelberg (2007)"},{"key":"12_CR6","first-page":"20","volume-title":"IPSN 2005","author":"Q. Cao","year":"2005","unstructured":"Cao, Q., Abdelzaher, T., He, T., Stankovic, J.: Towards Optimal Sleep Scheduling in Sensor Networks for Rare-event Detection. In: IPSN 2005, pp. 20\u201327. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Trans. Program. Lang. Syst.\u00a015(1), 36\u201372 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1\u20132","key":"12_CR8","first-page":"2","volume":"367","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Abadi, M.: Deciding Knowledge in Security Protocols under Equational Theories. Theoretical Computer Science\u00a0367(1\u20132), 2\u201332 (2006)","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","first-page":"243","volume":"B","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. Handbook of Theoretical Computer Science. Formal Models and Sematics (B)\u00a0B, 243\u2013320 (1990)","journal-title":"Handbook of Theoretical Computer Science. Formal Models and Sematics (B)"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.3233\/JCS-2004-12103","volume":"12","author":"A. Pierro Di","year":"2004","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate Non-Interference. Journal of Computer Security\u00a012, 37\u201382 (2004)","journal-title":"Journal of Computer Security"},{"issue":"12","key":"12_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the Security of Public Key Protocols. IEEE Transactions on Information Theory\u00a029(12), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A Randomized protocol for Signing Contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J.A. Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial Algebra Semantics and Continuous Algebras. Journal of the ACM\u00a024(1), 68\u201395 (1977)","journal-title":"Journal of the ACM"},{"key":"12_CR14","series-title":"ENTCS","volume-title":"Proc. of Workshop on Computation and Approximation","author":"A. Jung","year":"1998","unstructured":"Jung, A., Tix, R.: The Troublesome Probabilistic Powerdomain. In: Proc. of Workshop on Computation and Approximation. ENTCS, vol.\u00a013, Elsevier, Amsterdam (1998)"},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.3233\/JCS-1998-61-204","volume":"6","author":"G. Lowe","year":"1998","unstructured":"Lowe, G.: Casper: A compiler for the analysis of security protocols. Journal of Computer Security\u00a06, 53\u201384 (1998)","journal-title":"Journal of Computer Security"},{"key":"12_CR16","series-title":"ENTCS","first-page":"7","volume-title":"EXPRESS 2003","author":"M.W. Mislove","year":"2004","unstructured":"Mislove, M.W., Ouakine, J., Worrell, J.: Axioms for Probability and Nondeterminism. In: EXPRESS 2003, 96th edn. ENTCS, pp. 7\u201328. Elsevier, Amsterdam (2004)","edition":"96"},{"key":"12_CR17","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"12_CR18","volume-title":"Communicating and Mobile Systems: the \u03c0\u2013Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0\u2013Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"12_CR19","volume-title":"Foundations for Programming Languages","author":"J.C. Mitchell","year":"1996","unstructured":"Mitchell, J.C.: Foundations for Programming Languages. MIT Press, Cambridge (1996)"},{"issue":"1\u20133","key":"12_CR20","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2005.10.044","volume":"353","author":"J.C. Mitchell","year":"2006","unstructured":"Mitchell, J.C., Ramanathan, A., Scedrov, A., Teague, V.: Polynomial-time Process Calculus for the Analysis of Cryptographic Protocols. Theoretical Computer Science\u00a0353(1\u20133), 118\u2013164 (2006)","journal-title":"Theoretical Computer Science"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-60688-2_43","volume-title":"ACSC","author":"J. Niehren","year":"1995","unstructured":"Niehren, J., Mueller, M.: Constraints for Free in Concurrent Computation. In: Kanchanasut, K., Levy, J.-J. (eds.) ACSC. LNCS, vol.\u00a01023, pp. 171\u2013186. Springer, Heidelberg (1995)"},{"key":"12_CR22","unstructured":"Rabin, M.O.: How to Exchange Secrets by Oblivious Transfer. Unpublished manuscript (1981)"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978) Previously released as an MIT \u201cTechnical Memo\u201d in April 1977","journal-title":"Communications of the ACM"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/99583.99627","volume-title":"POPL 1991","author":"V.A. Saraswat","year":"1991","unstructured":"Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic Foundations of Concurrent Constraint Programming. In: POPL 1991, pp. 333\u2013352. ACM Press, New York (1991)"},{"key":"12_CR25","unstructured":"Schneider, S.: Security properties and CSP. In: Proc. of the IEEE Symposium on Security and Privacy (1996)"},{"key":"12_CR26","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Laboratory for Computer Science (1995)"},{"issue":"2","key":"12_CR27","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":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/3-540-58179-0_73","volume-title":"Computer Aided Verification","author":"B. Victor","year":"1994","unstructured":"Victor, B., Moller, F.: The Mobility Workbench - A Tool for the pi-Calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 428\u2013440. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:20Z","timestamp":1619506580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766360"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_12","relation":{},"subject":[]}}