{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:51:47Z","timestamp":1725537107589},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"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-04081-8_20","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T16:27:08Z","timestamp":1251736028000},"page":"289-304","source":"Crossref","is-referenced-by-count":2,"title":["A Demonic Approach to Information in Probabilistic Systems"],"prefix":"10.1007","author":[{"given":"Jos\u00e9e","family":"Desharnais","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Laviolette","sequence":"additional","affiliation":[]},{"given":"Am\u00e9lie","family":"Turgeon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probablistic testing. Information and Computation\u00a094, 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 481\u2013496. Springer, Heidelberg (1994)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Blute, R., Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled Markov processes. In: Proc. of LICS 1997, Warsaw, Poland (1997)","DOI":"10.1109\/LICS.1997.614943"},{"key":"20_CR4","unstructured":"Danos, V., Desharnais, J., Laviolette, F., Panangaden, P.: Almost sure bisimulation in labelled Markov processes, 38 pages (2005), http:\/\/www2.ift.ulaval.ca\/~jodesharnais\/Publications\/almostSureDDLP05.pdf"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D. Kozen","year":"1985","unstructured":"Kozen, D.: A probabilistic PDL. Journal of Computer and Systems Sciences\u00a030(2), 162\u2013178 (1985)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"20_CR6","series-title":"Cambridge Studies in Advanced Mathematics","volume-title":"Stone Spaces","author":"P. Johnstone","year":"1982","unstructured":"Johnstone, P.: Stone Spaces. Cambridge Studies in Advanced Mathematics, vol.\u00a03. Cambridge University Press, Cambridge (1982)"},{"key":"20_CR7","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure. Wiley-Interscience, Hoboken (1995)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/3-540-63165-8_202","volume-title":"Automata, Languages and Programming","author":"J.J.M.M. Rutten","year":"1997","unstructured":"Rutten, J.J.M.M., de Vink, E.: Bisimulation for probabilistic transition systems: a coalgebraic approach. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 460\u2013470. Springer, Heidelberg (1997)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes I and II. Information and Computation\u00a0100, 1\u201341, 42\u201378 (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"20_CR10","unstructured":"Desharnais, J.: Labelled Markov Processes. PhD thesis. McGill University (2000)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Danos, V., Desharnais, J., Laviolette, F., Panangaden, P.: Bisimulation and cocongruence for probabilistic systems. Information and Computation, 22 pages (2005)","DOI":"10.1016\/j.ic.2005.02.004"},{"key":"20_CR12","volume-title":"Proc. of LICS 2003","author":"V. Danos","year":"2003","unstructured":"Danos, V., Desharnais, J.: Labeled Markov Processes: Stronger and faster approximations. In: Proc. of LICS 2003, Ottawa. IEEE, Los Alamitos (2003)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.5802\/aif.53","volume":"5","author":"G. Choquet","year":"1953","unstructured":"Choquet, G.: Theory of capacities. Ann. Inst. Fourier (Grenoble)\u00a05, 131\u2013295 (1953)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-540-73420-8_66","volume-title":"Automata, Languages and Programming","author":"J. Goubault-Larrecq","year":"2007","unstructured":"Goubault-Larrecq, J.: Continuous capacities on continuous state spaces. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 764\u2013776. Springer, Heidelberg (2007)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-31982-5_8","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Cattani","year":"2005","unstructured":"Cattani, S., Segala, R., Kwiatkowska, M., Norman, G.: Stochastic transition systems for continuous state spaces and non-determinism. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 125\u2013139. Springer, Heidelberg (2005)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11691617_5","volume-title":"Model Checking Software","author":"H. Fecher","year":"2006","unstructured":"Fecher, H., Leucker, M., Wolf, V.: Don\u2019t know in probabilistic systems. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 71\u201388. Springer, Heidelberg (2006)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-85361-9_23","volume-title":"CONCUR 2008 - Concurrency Theory","author":"R. Chadha","year":"2008","unstructured":"Chadha, R., Viswanathan, M., Viswanathan, R.: Least upper bounds for probability measures and their applications to abstractions. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 264\u2013278. Springer, Heidelberg (2008)"},{"key":"20_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85820-8","volume-title":"Boolean Algebras","author":"R. Sikorski","year":"1969","unstructured":"Sikorski, R.: Boolean Algebras, 3rd edn. Springer, New York (1969)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:46:25Z","timestamp":1558514785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}