{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:01:51Z","timestamp":1770285711552,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642548291","type":"print"},{"value":"9783642548307","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_22","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:30:31Z","timestamp":1395394231000},"page":"335-350","source":"Crossref","is-referenced-by-count":10,"title":["Upper-Expectation Bisimilarity and \u0141ukasiewicz \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Mio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"22_CR2","unstructured":"Bartels, F.: On Generalised Coinduction and Probabilistic Specification Formats: Distributive Laws in Coalgebraic Modelling. PhD thesis, CWI (2004)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-28729-9_13","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Bernardo","year":"2012","unstructured":"Bernardo, M., De Nicola, R., Loreti, M.: Revisiting trace and testing equivalences for nondeterministic and probabilistic processes. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 195\u2013209. Springer, Heidelberg (2012)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the Bayes risk in information-hiding protocols. Journal of Computer Security\u00a016(5) (2008)","DOI":"10.3233\/JCS-2008-0333"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23217-6_9","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"S. Crafa","year":"2011","unstructured":"Crafa, S., Ranzato, F.: A spectrum of behavioral relations over LTSs on probability distributions. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 124\u2013139. Springer, Heidelberg (2011)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-642-54830-7_19","volume-title":"FOSSACS 2014","author":"P.R. D\u2019Argenio","year":"2014","unstructured":"D\u2019Argenio, P.R., Gebler, D., Lee, M.D.: Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol.\u00a08412, pp. 289\u2013303. Springer, Heidelberg (2014)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.jcss.2003.07.009","volume":"68","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. Journal of Computer and System Sciences\u00a068, 374\u2013397 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Majumdar, R., Raman, V., Stoelinga, M.: Game refinement relations and metrics. Logical Methods in Computer Science\u00a04 (2008)","DOI":"10.2168\/LMCS-4(3:7)2008"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-16242-8_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Y. Deng","year":"2010","unstructured":"Deng, Y., van Glabbeek, R.: Characterising probabilistic processes logically. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 278\u2013293. Springer, Heidelberg (2010)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-04081-8_19","volume-title":"CONCUR 2009 - Concurrency Theory","author":"Y. Deng","year":"2009","unstructured":"Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 274\u2013288. Springer, Heidelberg (2009)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45694-5_24","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for PCTL. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 355\u2013370. Springer, Heidelberg (2002)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-78499-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Goubault-Larrecq","year":"2008","unstructured":"Goubault-Larrecq, J.: Prevision domains and convex powercones. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 318\u2013333. Springer, Heidelberg (2008)"},{"key":"22_CR14","unstructured":"Huber, P.: Robust Statistics. Wiley (1991)"},{"key":"22_CR15","unstructured":"Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proc. of LICS (1997)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer (1994)","DOI":"10.1007\/978-1-4612-4190-4"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science, 333\u2013354 (1983)","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"22_CR18","unstructured":"Kurz, A.: Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwig Maximilian University of Munich (2000)"},{"key":"22_CR19","unstructured":"Lax, P.: Functional Analysis. Wiley Interscience (2002)"},{"key":"22_CR20","first-page":"250","volume":"2","author":"N. Lynch","year":"1995","unstructured":"Lynch, N., Segala, R.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02, 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"22_CR22","unstructured":"Mio, M.: Game Semantics for Probabilistic \u03bc-Calculi. PhD thesis, School of Informatics, University of Edinburgh (2012)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Mio, M.: Probabilistic Modal \u03bc-Calculus with Independent product. Logical Methods in Computer Science\u00a08(4) (2012)","DOI":"10.2168\/LMCS-8(4:18)2012"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Mio, M., Simpson, A.: \u0141ukasiewicz mu-calculus. In: Proc. of Workshop on Fixed Points in Computer Science. EPTCS, vol.\u00a0126 (2013)","DOI":"10.4204\/EPTCS.126.7"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-37075-5_11","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Mio","year":"2013","unstructured":"Mio, M., Simpson, A.: A proof system for compositional verification of probabilistic concurrent processes. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol.\u00a07794, pp. 161\u2013176. Springer, Heidelberg (2013)"},{"key":"22_CR26","unstructured":"Morgan, C., McIver, A.: A probabilistic temporal calculus based on expectations. In: Proc. of Formal Methods Pacific (1997)"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Panangaden, P.: Labelled Markov processes. Imperial College Press (2009)","DOI":"10.1142\/9781848162891"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Rutten, J.: Advanced topics in bisimulation and coinduction. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511792588"},{"key":"22_CR29","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis. MIT (1995)"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Sokolova, A.: Probabilistic Systems Coalgebraically: A survey. Theoretical Computer Science\u00a0412(38) (2011)","DOI":"10.1016\/j.tcs.2011.05.008"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-23217-6_8","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"L. Song","year":"2011","unstructured":"Song, L., Zhang, L., Godskesen, J.C.: Bisimulations Meet PCTL Equivalences for Probabilistic Automata. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 108\u2013123. Springer, Heidelberg (2011)"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Tix, R., Keimel, K., Plotkin, G.D.: Semantic domains for combining probability and non-determinism. Electronic Notes in Theoretical Computer Science (2005)","DOI":"10.1016\/j.entcs.2004.06.063"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T07:22:18Z","timestamp":1689060138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}