{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T03:21:16Z","timestamp":1776136876900,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642231773","type":"print"},{"value":"9783642231780","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23178-0_3","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T07:15:58Z","timestamp":1315638958000},"page":"23-39","source":"Crossref","is-referenced-by-count":6,"title":["On Quantitative Security Policies"],"prefix":"10.1007","author":[{"given":"Pierpaolo","family":"Degano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian-Luigi","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Mezzetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"301","volume-title":"Mathematical Foundations of Programming Semantics","author":"L. Aceto","year":"1989","unstructured":"Aceto, L., Hennessy, M.: Termination, deadlock and divergence. In: Mathematical Foundations of Programming Semantics, pp. 301\u2013318. Springer, Heidelberg (1989)"},{"key":"3_CR2","volume-title":"Probability and measure theory","author":"R. Ash","year":"2000","unstructured":"Ash, R., Dol\u00e9ans-Dade, C.: Probability and measure theory. Academic Press, London (2000)"},{"key":"3_CR3","unstructured":"Athreya, K., Lahiri, S.: Measure theory and probability theory. Springer-Verlag New York Inc. (2006)"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/343369.343402","volume":"1","author":"A. Aziz","year":"2000","unstructured":"Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous-time Markov chains. ACM Transactions on Computational Logic (TOCL)\u00a01(1), 170 (2000)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"3_CR5","unstructured":"Baeten, J.: Process algebra with explicit termination. Tech. rep. (2000)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Baeten, J., Corradini, F.: Regular expressions in process algebra. In: Proceedings of 20th Annual IEEE Symposium on Logic in Computer Science, LICS 2005, pp. 12\u201319 (2005)","DOI":"10.1109\/LICS.2005.43"},{"key":"3_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624193","volume-title":"Process algebra","author":"J. Baeten","year":"1990","unstructured":"Baeten, J., Weijland, W.: Process algebra. Cambridge University Press, Cambridge (1990)"},{"issue":"6","key":"3_CR8","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., Hermanns, H., Katoen, J.: Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR9","first-page":"57","volume-title":"CSFW","author":"M. Bartoletti","year":"2006","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L.: Types and effects for secure service orchestration. In: CSFW, pp. 57\u201369. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"5","key":"3_CR10","doi-asserted-by":"publisher","first-page":"799","DOI":"10.3233\/JCS-2009-0357","volume":"17","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.: Planning and verifying service composition. Journal of Computer Security\u00a017(5), 799\u2013837 (2009)","journal-title":"Journal of Computer Security"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TSE.2007.70740","volume":"34","author":"M. Bartoletti","year":"2008","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L., Zunino, R.: Semantics-based design for secure web services. IEEE Trans. Software Eng.\u00a034(1), 33\u201349 (2008)","journal-title":"IEEE Trans. Software Eng."},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1552309.1552313","volume":"31","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G., Zunino, R.: Local policies for resource usage analysis. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a031(6), 23 (2009)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"3_CR13","volume-title":"Handbook of process algebra","author":"J. Bergstra","year":"2001","unstructured":"Bergstra, J., Ponse, A., Smolka, S.: Handbook of process algebra. Elsevier Science Ltd., Amsterdam (2001)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-61604-7_63","volume-title":"CONCUR \u201996: Concurrency Theory","author":"M. Bernardo","year":"1996","unstructured":"Bernardo, M., Gorrieri, R.: Extended markovian process algebra. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 315\u2013330. Springer, Heidelberg (1996)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Blute, R., Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled Markov processes (1997)","DOI":"10.7146\/brics.v4i4.18783"},{"key":"3_CR16","first-page":"171","volume-title":"QEST","author":"L. Cardelli","year":"2010","unstructured":"Cardelli, L., Mardare, R.: The measurable space of stochastic processes. In: QEST, pp. 171\u2013180. IEEE Computer Society, Los Alamitos (2010)"},{"key":"3_CR17","unstructured":"Cardelli, L., Mardare, R.: Stochastic pi-calculus revisited (2010) (unpublished), http:\/\/lucacardelli.name"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-48778-6_13","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"G. Clark","year":"1999","unstructured":"Clark, G., Gilmore, S., Hillston, J.: Specifying performance measures for PEPA. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 211\u2013227. Springer, Heidelberg (1999)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"De\u00a0Nicola, R., Latella, D., Loreti, M., Massink, M.: Rate-Based Transition Systems for Stochastic Process Calculi. Automata, Languages and Programming (2009)","DOI":"10.1007\/978-3-642-02930-1_36"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Panangaden, P.: Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. Journal of Logic and Algebraic Programming\u00a056(1-2) (2003)","DOI":"10.1016\/S1567-8326(02)00068-1"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Fokkink, W.: Axiomatizations for the perpetual loop in process algebra. In: Automata, Languages and Programming, pp. 571\u2013581","DOI":"10.1007\/3-540-63165-8_212"},{"issue":"4","key":"3_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","volume":"37","author":"W. Fokkink","year":"1994","unstructured":"Fokkink, W., Zantema, H.: Basic process algebra with iteration: Completeness of its equational axioms. The Computer Journal\u00a037(4), 259 (1994)","journal-title":"The Computer Journal"},{"key":"3_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569951","volume-title":"A compositional approach to performance modelling","author":"J. Hillston","year":"1996","unstructured":"Hillston, J.: A compositional approach to performance modelling. Cambridge Univ. Pr., Cambridge (1996)"},{"key":"3_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9455-6","volume-title":"Denumerable markov chains","author":"J. Kemeny","year":"1976","unstructured":"Kemeny, J., Snell, J., Knapp, A.: Denumerable markov chains. Springer, Heidelberg (1976)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Computer Performance Evaluation: Modelling Techniques and Tools (2002)","DOI":"10.1007\/3-540-46029-2_13"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-72522-0_6","volume-title":"Formal Methods for Performance Evaluation","author":"M. Kwiatkowska","year":"2007","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Stochastic model checking. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol.\u00a04486, pp. 220\u2013270. Springer, Heidelberg (2007)"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"3_CR28","volume-title":"Markov chains","author":"J. Norris","year":"1998","unstructured":"Norris, J.: Markov chains. Cambridge Univ. Pr., Cambridge (1998)"},{"key":"3_CR29","doi-asserted-by":"publisher","DOI":"10.1142\/p595","volume-title":"Labelled Markov Processes","author":"P. Panangaden","year":"2009","unstructured":"Panangaden, P.: Labelled Markov Processes. Imperial College Press, London (2009)"},{"issue":"7","key":"3_CR30","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/comjnl\/38.7.578","volume":"38","author":"C. Priami","year":"1995","unstructured":"Priami, C.: Stochastic \u03c0-calculus. The Computer Journal\u00a038(7), 578 (1995)","journal-title":"The Computer Journal"},{"issue":"4","key":"3_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516507.1516510","volume":"31","author":"D. Sangiorgi","year":"2009","unstructured":"Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a031(4), 1\u201341 (2009)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23178-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T07:52:40Z","timestamp":1560585160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23178-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231773","9783642231780"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23178-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}