{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:30:15Z","timestamp":1742387415759},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424970"},{"type":"electronic","value":"9783540446859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44685-0_11","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:16:21Z","timestamp":1186740981000},"page":"152-168","source":"Crossref","is-referenced-by-count":13,"title":["Probabilistic Information Flow in a Process Algebra"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Aldini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,22]]},"reference":[{"key":"11_CR1","volume-title":"Tech. Rep. UBLCS-2001-06","author":"A. Aldini","year":"2001","unstructured":"A. Aldini, \u201cProbabilistic Information Flow in a Process Algebra\u201d, Tech. Rep. UBLCS-2001-06, University of Bologna, Italy, 2001"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"A. Aldini, M. Bernardo, R. Gorrieri, M. Roccetti, \u201cComparing the QoS of Internet Audio Mechanisms via Formal Methods\u201d, ACM Transactions on Modelling and Computer Simulation, ACM Press, Vol. 11, N. 1, 2001","DOI":"10.1145\/379525.379526"},{"key":"11_CR3","unstructured":"A. Aldini, M. Bravetti, \u201cAn Asynchronous Calculus for Generative-Reactive Probabilistic Systems\u201d, in Proc. of 8th Int. Workshop on Process Algebra and Performance Modeling, pp. 119\u2013138, 2000"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1995.1135","volume":"121","author":"J.C.M. Baeten","year":"1995","unstructured":"J.C.M. Baeten, J.A. Bergstra, S.A. Smolka, \u201cAxiomatizing Probabilistic Processes: ACP with Generative Probabilities\u201d, in Information and Comp. 121:234\u2013255, 1995","journal-title":"Information and Comp."},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Proc. of CAV\u201997","author":"C. Baier","year":"1997","unstructured":"C. Baier and H. Hermanns, \u201cWeak Bisimulation for Fully Probabilistic Processes\u201d, in Proc. of CAV\u201997, Springer LNCS 1254, pp. 119\u2013130, 1997"},{"key":"11_CR6","series-title":"Tech. Rep. UBLCS-2000-03","volume-title":"Theoretical Computer Science","author":"M. Bravetti","year":"2001","unstructured":"M. Bravetti, A. Aldini, \u201cDiscrete Time Generative-reactive Probabilistic Processes with Different Advancing Speeds\u201d, Tech. Rep. UBLCS-2000-03, University of Bologna, Italy, to appear in Theoretical Computer Science, 2001"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of 28th International Colloquium on Automata, Languages and Programming","author":"F. Breugel van","year":"2001","unstructured":"F. van Breugel, J. Worrell, \u201cTowards Quantitative Verification of Probabilistic Systems (extended abstract)\u201d, to appear in Proc. of 28th International Colloquium on Automata, Languages and Programming, Springer LNCS, 2001"},{"key":"11_CR8","unstructured":"D. Clark, C. Hankin, S. Hunt, R. Nagarajan, \u201cPossibilistic Information Flow is safe for Probabilistic Non-Interference\u201d, in Work. on Issues in the Theory of Security, 2000"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"A. Di Pierro, C. Hankin, H. Wiklicky, \u201cProbabilistic Security Analysis in a Declarative Framework\u201d, in Work. on Issues in the Theory of Security, 2000","DOI":"10.1016\/S1571-0661(04)00152-5"},{"issue":"4","key":"11_CR10","first-page":"489","volume":"9","author":"A. Durante","year":"2000","unstructured":"A. Durante, R. Focardi, R. Gorrieri, \u201cA Compiler for Analysing Cryptographic Protocols Using Non-Interference\u201d, in ACM TOSEM, special issue on Software Engineering & Security, Volume 9(4), pages 489\u2013530, 2000","journal-title":"ACM TOSEM, special issue on Software Engineering & Security"},{"key":"11_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/10722599_14","volume-title":"Proc. Symposium on Research in Computer Security","author":"N. Evans","year":"2000","unstructured":"N. Evans, S. Schneider, \u201cAnalysing Time Dependent Security Properties in CSP Using PVS\u201d, in Proc. Symposium on Research in Computer Security, pp. 222\u2013237, Springer LNCS 1895, 2000"},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","volume":"3","author":"R. Focardi","year":"1995","unstructured":"R. Focardi, R. Gorrieri, \u201cA Classification of Security Properties\u201d, Journal of Computer Security, 3(1):5\u201333, 1995","journal-title":"Journal of Computer Security"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/32.629493","volume":"27","author":"R. Focardi","year":"1997","unstructured":"R. Focardi, R. Gorrieri, \u201cThe Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties\u201d, IEEE Trans. Sof. Eng., 27:550\u2013571, 1997","journal-title":"IEEE Trans. Sof. Eng."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, F. Martinelli, \u201cInformation Flow Analysis in a Discrete-Time Process Algebra\u201d, in Proc. of 13th IEEE Computer Security Foundations Work., pp. 170\u2013184, 2000","DOI":"10.1109\/CSFW.2000.856935"},{"key":"11_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45022-X_31","volume-title":"Proc. of 27th International Colloquium on Automata, Languages and Programming","author":"R. Focardi","year":"2000","unstructured":"R. Focardi, R. Gorrieri, F. Martinelli, \u201cNon Interference for the Analysis of Cryptographic Protocols\u201d, in Proc. of 27th International Colloquium on Automata, Languages and Programming, Springer LNCS 1853, pp. 354\u2013372, 2000"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.J. Glabbeek van","year":"1995","unstructured":"R.J. van Glabbeek, S.A. Smolka, B. Steffen, \u201dReactive, Generative and Stratified Models of Probabilistic Processes\u201d, in Information and Comp. 121:59\u201380, 1995","journal-title":"Information and Comp."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, J. Meseguer, \u201cSecurity Policy and Security Models\u201d, in Proc. IEEE Symposium on Security and Privacy, pp. 11\u201320, IEEE CS Press, 1982","DOI":"10.1109\/SP.1982.10014"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.3233\/JCS-1992-13-405","volume":"1","author":"J.W. Gray III","year":"1992","unstructured":"J.W. Gray III, \u201cToward a Mathematical Foundation for Information Flow Security\u201d, Journal of Computer Security, 1:255\u2013294, 1992","journal-title":"Journal of Computer Security"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"J.W. Gray III, P.F. Syverson, \u201cA Logical Approach to Multilevel Security of Probabilistic Systems\u201d, in Proc. IEEE Computer Society Symposium on Research in Security and Privacy, pp. 164\u2013176, 1992","DOI":"10.1109\/RISP.1992.213263"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"P.R. Halmos, \u201cMeasure Theory\u201d, Springer-Verlag, 1950","DOI":"10.1007\/978-1-4684-9440-2"},{"key":"11_CR21","unstructured":"R.A. Howard, \u201cDynamic Probabilistic Systems\u201d, John Wiley & Sons, 1971"},{"key":"11_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/3-540-44618-4_29","volume-title":"Proc. of Int. Conf. on Concurrency Theory","author":"J. J\u00fcrjens","year":"2000","unstructured":"J. J\u00fcrjens, \u201cSecure information flow for concurrent processes\u201d, in Proc. of Int. Conf. on Concurrency Theory, Springer LNCS 1877, pp. 395\u2013409, 2000"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"J. McLean, \u201cSecurity Models and Information Flow\u201d, in Proc. of IEEE Symp. on Research in Security and Privacy, pp. 180\u2013187, 1990","DOI":"10.21236\/ADA462529"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"J.K. Millen, \u201cHookup Security for Synchronous Machines\u201d, in Proc. of 3rd IEEE Computer Security Foundations Work., pp. 84\u201390, 1990","DOI":"10.1109\/CSFW.1990.128188"},{"key":"11_CR25","unstructured":"R. Milner, \u201cCommunication and Concurrency\u201d, Prentice Hall, 1989"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"A.W. Roscoe, \u201cCSP and Determinism in Security Modelling\u201d, in Proc. of IEEE Symposium on Security and Privacy, pp. 114\u2013127, 1995","DOI":"10.1109\/SECPRI.1995.398927"},{"key":"11_CR27","unstructured":"A.W. Roscoe, G.M. Reed, R. Forster, \u201cThe successes and failures of behavioural models\u201d, in Millenial Perspectives in Computer Science, 2000"},{"key":"11_CR28","series-title":"Lect Notes Comput Sci","first-page":"33","volume-title":"Proc. European Symposium on Research in Computer Security","author":"A. W. Roscoe","year":"1994","unstructured":"A. W. Roscoe, J.C.P. Woodcock, L. Wulf, \u201cNoninterference through Determinism\u201d, in Proc. European Symposium on Research in Computer Security, pp. 33\u201353, Springer LNCS 875, 1994"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"P.Y.A. Ryan, S. Schneider, \u201cProcess Algebra and Noninterference\u201d, in Proc. of 12th IEEE Computer Security Foundations Work., pp. 214\u2013227, 1999","DOI":"10.1109\/CSFW.1999.779775"},{"key":"11_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-49099-X_4","volume-title":"Proc. of 8th European Symposium on Programming","author":"A. Sabelfeld","year":"1999","unstructured":"A. Sabelfeld, D. Sands, \u201cA Per Model of Secure Information Flow in Sequential Programs\u201d, in Proc. of 8th European Symposium on Programming, Springer LNCS 1576, pg. 40\u201358, 1999"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"A. Sabelfeld, D. Sands, \u201cProbabilistic Noninterference for Multi-threaded Programs\u201d, in Proc. of 13th IEEE Computer Security Foundations Work., 2000","DOI":"10.1109\/CSFW.2000.856937"},{"key":"11_CR32","unstructured":"S. Schneider, \u201cConcurrent and Real-Time Systems: the CSP Approach\u201d, J. Wiley & Sons, Inc., 1999"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"J.T. Wittbold, D.M. Johnson, \u201cInformation Flow in Nondeterministic Systems\u201d, in Proc. of IEEE Symp. on Research in Security and Privacy, pp. 144\u2013161, 1990","DOI":"10.1109\/RISP.1990.63846"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2001 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44685-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:02:38Z","timestamp":1684004558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44685-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424970","9783540446859"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-44685-0_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}