{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:16:05Z","timestamp":1762298165173},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445839"},{"type":"electronic","value":"9783662445846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44584-6_18","type":"book-chapter","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T21:21:03Z","timestamp":1408742463000},"page":"249-265","source":"Crossref","is-referenced-by-count":16,"title":["Probabilistic Bisimulation: Naturally on Distributions"],"prefix":"10.1007","author":[{"given":"Holger","family":"Hermanns","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kr\u010d\u00e1l","sequence":"additional","affiliation":[]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Akshay, S., Genest, B., Thiagarajan, P.: Approximate verification of the symbolic dynamics of Markov chains. In: LICS (2012)","DOI":"10.1109\/LICS.2012.17"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/spe.1006","volume":"41","author":"G. Behrmann","year":"2011","unstructured":"Behrmann, G., David, A., Larsen, K.G., Pettersson, P., Yi, W.: Developing UPPAAL over 15 years. Softw., Pract. Exper.\u00a041(2), 133\u2013142 (2011)","journal-title":"Softw., Pract. Exper."},{"key":"18_CR4","unstructured":"Bernardo, M., Nicola, R.D., Loreti, M.: Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes. Technical Report\u00a006, IMT Lucca (2013)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-24611-4_2","volume-title":"Validation of Stochastic Systems","author":"M. Bravetti","year":"2004","unstructured":"Bravetti, M., D\u2019Argenio, P.R.: Tutte le algebre insieme: Concepts, discussions and relations of stochastic process algebras with general distributions. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 44\u201388. Springer, Heidelberg (2004)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.entcs.2005.12.108","volume":"162","author":"M. Bravetti","year":"2006","unstructured":"Bravetti, M., Hermanns, H., Katoen, J.-P.: YMCA: Why Markov Chain Algebra? Electr. Notes Theor. Comput. Sci.\u00a0162, 107\u2013112 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"18_CR7","unstructured":"Castro, P., Panangaden, P., Precup, D.: Equivalence relations in fully and partially observable Markov decision processes. In: IJCAI (2009)"},{"key":"18_CR8","unstructured":"Cattani, S.: Trace-based Process Algebras for Real-Time Probabilistic Systems. PhD thesis, University of Birmingham (2005)"},{"key":"18_CR9","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)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.07.001","volume":"203","author":"P. D\u2019Argenio","year":"2005","unstructured":"D\u2019Argenio, P., Katoen, J.-P.: A theory of stochastic systems, part I: Stochastic automata. Inf. Comput.\u00a0203(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ic.2005.07.002","volume":"203","author":"P. D\u2019Argenio","year":"2005","unstructured":"D\u2019Argenio, P., Katoen, J.-P.: A theory of stochastic systems, part II: Process algebra. Inf. Comput.\u00a0203(1), 39\u201374 (2005)","journal-title":"Inf. Comput."},{"key":"18_CR12","unstructured":"D\u2019Argenio, P.R., Baier, C.: What is the relation between CTMC and TA? Personal Communication (1999)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-24310-3_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A. David","year":"2011","unstructured":"David, A., Larsen, K.G., Legay, A., Miku\u010dionis, M., Poulsen, D.B., van Vliet, J., Wang, Z.: Statistical model checking for networks of priced timed automata. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 80\u201396. Springer, Heidelberg (2011)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-22110-1_27","volume-title":"Computer Aided Verification","author":"A. David","year":"2011","unstructured":"David, A., Larsen, K.G., Legay, A., Miku\u010dionis, M., Wang, Z.: Time for statistical model checking of real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 349\u2013355. Springer, Heidelberg (2011)"},{"key":"18_CR15","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":"E.P. Vink de","year":"1997","unstructured":"de Vink, E.P., Rutten, J.J.M.M.: 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":"18_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ic.2012.10.010","volume":"222","author":"Y. Deng","year":"2013","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. Inf. Comput.\u00a0222, 139\u2013168 (2013)","journal-title":"Inf. Comput."},{"key":"18_CR17","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Approximating labeled Markov processes. In: LICS (2000)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1007\/3-540-45061-0_77","volume-title":"Automata, Languages and Programming","author":"E.-E. Doberkat","year":"2003","unstructured":"Doberkat, E.-E.: Semi-pullbacks and bisimulations in categories of stochastic relations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 996\u20131007. Springer, Heidelberg (2003)"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1142\/S0129054108005814","volume":"19","author":"L. Doyen","year":"2008","unstructured":"Doyen, L., Henzinger, T., Raskin, J.-F.: Equivalence of labeled Markov chains. Int. J. Found. Comput. Sci.\u00a019(3), 549\u2013563 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Limit synchronization in Markov decision processes. CoRR, abs\/1310.2935 (2013)","DOI":"10.1007\/978-3-642-54830-7_4"},{"issue":"5","key":"18_CR21","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1017\/S0960129599002819","volume":"9","author":"A. Edalat","year":"1999","unstructured":"Edalat, A.: Semi-pullbacks and bisimulation in categories of Markov processes. Mathematical Structures in Computer Science\u00a09(5), 523\u2013543 (1999)","journal-title":"Mathematical Structures in Computer Science"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Kr\u00e4mer, J., Turrini, A., Zhang, L.: Deciding bisimilarities on distributions. In: QEST (2013)","DOI":"10.1007\/978-3-642-40196-1_6"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: LICS (2010)","DOI":"10.1109\/LICS.2010.41"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-06410-9_18","volume-title":"FM 2014: Formal Methods","author":"Y. Feng","year":"2014","unstructured":"Feng, Y., Zhang, L.: When equivalence and bisimulation join forces in probabilistic automata. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol.\u00a08442, pp. 247\u2013262. Springer, Heidelberg (2014)"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10626-010-0094-3","volume":"21","author":"N. Gast","year":"2011","unstructured":"Gast, N., Gaujal, B.: A mean field approach for optimization in discrete time. Discrete Event Dynamic Systems\u00a021(1), 63\u2013101 (2011)","journal-title":"Discrete Event Dynamic Systems"},{"issue":"4-6","key":"18_CR26","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00165-012-0236-5","volume":"24","author":"S. Georgievska","year":"2012","unstructured":"Georgievska, S., Andova, S.: Probabilistic may\/must testing: Retaining probabilities by restricted schedulers. Formal Asp. Comput.\u00a024(4-6), 727\u2013748 (2012)","journal-title":"Formal Asp. Comput."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Giry, M.: A categorical approach to probability theory. In: Banaschewski, B. (ed.) Categorical Aspects of Topology and Analysis. LNCS, vol.\u00a0915, pp. 68\u201385. Springer, Heidelberg (1982)","DOI":"10.1007\/BFb0092872"},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1093\/logcom\/10.1.3","volume":"10","author":"P.G. Harrison","year":"2000","unstructured":"Harrison, P.G., Strulo, B.: Spades - a process algebra for discrete event simulation. J. Log. Comput.\u00a010(1), 3\u201342 (2000)","journal-title":"J. Log. Comput."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Hennessy, M.: Exploring probabilistic bisimulations, part I. Formal Asp. Comput. (2012)","DOI":"10.1007\/s00165-012-0242-7"},{"issue":"9-10","key":"18_CR30","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/S0169-7552(97)00133-5","volume":"30","author":"H. Hermanns","year":"1998","unstructured":"Hermanns, H., Herzog, U., Mertsiotakis, V.: Stochastic process algebras - between LOTOS and Markov chains. Computer Networks\u00a030(9-10), 901\u2013924 (1998)","journal-title":"Computer Networks"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Hermanns, H., Kr\u010d\u00e1l, J., K\u0159et\u00ednsk\u00fd, J.: Probabilistic bisimulation: Naturally on distributions. CoRR, abs\/1404.5084 (2014)","DOI":"10.1007\/978-3-662-44584-6_18"},{"key":"18_CR32","unstructured":"Hermanns, H., Turrini, A.: Deciding probabilistic automata weak bisimulation in polynomial time. In: FSTTCS (2012)"},{"key":"18_CR33","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 University Press, New York (1996)"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-28891-3_31","volume-title":"NASA Formal Methods","author":"D.N. Jansen","year":"2012","unstructured":"Jansen, D.N., Nielson, F., Zhang, L.: Belief bisimulation for hidden Markov models - logical characterisation and decision algorithm. In: Goodloe, A.E., Person, S. (eds.) NFM 2012. LNCS, vol.\u00a07226, pp. 326\u2013340. Springer, Heidelberg (2012)"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-32940-1_29","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"H. Kerstan","year":"2012","unstructured":"Kerstan, H., K\u00f6nig, B.: Coalgebraic trace semantics for probabilistic transition systems based on measure theory. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 410\u2013424. Springer, Heidelberg (2012)"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Korthikanti, V., Viswanathan, M., Agha, G., Kwon, Y.: Reasoning about MDPs as transformers of probability distributions. In: QEST (2010)","DOI":"10.1109\/QEST.2010.35"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M. Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Prism 4.0: Verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 585\u2013591. Springer, Heidelberg (2011)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. In: POPL (1989)","DOI":"10.1145\/75277.75307"},{"issue":"4164","key":"18_CR39","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1126\/science.186.4164.645","volume":"186","author":"R. May","year":"1974","unstructured":"May, R., et al.: Biological populations with nonoverlapping generations: stable points, stable cycles, and chaos. Science\u00a0186(4164), 645\u2013647 (1974)","journal-title":"Science"},{"key":"18_CR40","unstructured":"Milner, R.: Communication and concurrency. PHI Series in computer science. Prentice Hall (1989)"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Mio, M.: Upper-expectation bisimilarity and Lukasiewicz \u03bc-calculus. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol.\u00a08412, pp. 335\u2013350. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54830-7_22"},{"key":"18_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777110","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"D. Sangiorgi","year":"2011","unstructured":"Sangiorgi, D., Rutten, J.: Advanced Topics in Bisimulation and Coinduction, 1st edn. Cambridge University Press, New York (2011)","edition":"1"},{"key":"18_CR43","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (1995)"},{"key":"18_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BFb0015027","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)"},{"issue":"1","key":"18_CR45","first-page":"1","volume":"27","author":"G. Shani","year":"2013","unstructured":"Shani, G., Pineau, J., Kaplow, R.: A survey of point-based pomdp solvers. AAMAS\u00a027(1), 1\u201351 (2013)","journal-title":"AAMAS"},{"issue":"38","key":"18_CR46","doi-asserted-by":"publisher","first-page":"5095","DOI":"10.1016\/j.tcs.2011.05.008","volume":"412","author":"A. Sokolova","year":"2011","unstructured":"Sokolova, A.: Probabilistic systems coalgebraically: A survey. Theor. Comput. Sci.\u00a0412(38), 5095\u20135110 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR47","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":"18_CR48","unstructured":"Song, L., Zhang, L., Godskesen, J.C.: Late weak bisimulation for Markov automata. CoRR, abs\/1202.4116 (2012)"},{"key":"18_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45061-0_38","volume-title":"Automata, Languages and Programming","author":"M. Stoelinga","year":"2003","unstructured":"Stoelinga, M., Vaandrager, F.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 464\u2013477. Springer, Heidelberg (2003)"},{"issue":"2","key":"18_CR50","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0221017","volume":"21","author":"W. Tzeng","year":"1992","unstructured":"Tzeng, W.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput.\u00a021(2), 216\u2013227 (1992)","journal-title":"SIAM J. Comput."},{"key":"18_CR51","unstructured":"Wolovick, N.: Continuous probability and nondeterminism in labeled transaction systems. PhD thesis, Universidad Nacional de C\u00f3rdoba (2012)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2014 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44584-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T07:21:42Z","timestamp":1650007302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}