{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:11Z","timestamp":1759637771355},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401954"},{"type":"electronic","value":"9783642401961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40196-1_6","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:54:56Z","timestamp":1374544496000},"page":"72-88","source":"Crossref","is-referenced-by-count":10,"title":["Deciding Bisimilarities on Distributions"],"prefix":"10.1007","author":[{"given":"Christian","family":"Eisentraut","sequence":"first","affiliation":[]},{"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[]},{"given":"Julia","family":"Kr\u00e4mer","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C. Baier","year":"2000","unstructured":"Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci.\u00a060(1), 187\u2013231 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S. Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, M.R.: Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SODA, pp. 1318\u20131336 (2011)","DOI":"10.1137\/1.9781611973082.101"},{"key":"6_CR4","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-22012-8_24","volume-title":"Automata, Languages and Programming","author":"Y. Deng","year":"2011","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 307\u2013318. Springer, Heidelberg (2011)"},{"key":"6_CR6","first-page":"139","volume":"222","author":"Y. Deng","year":"2012","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. I&C\u00a0222, 139\u2013168 (2012)","journal-title":"I&C"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae\u00a049, 129\u2013144 (1961)","journal-title":"Fundamenta Mathematicae"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-15375-4_3","volume-title":"CONCUR 2010 - Concurrency Theory","author":"C. Eisentraut","year":"2010","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: Concurrency and composition in a stochastic world. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 21\u201339. Springer, Heidelberg (2010)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: LICS, pp. 342\u2013351 (2010)","DOI":"10.1109\/LICS.2010.41"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. Reports of SFB\/TR 14 AVACS\u00a062, SFB\/TR 14 AVACS (2010)","DOI":"10.1109\/LICS.2010.41"},{"issue":"4-6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00165-012-0242-7","volume":"24","author":"M. Hennessy","year":"2012","unstructured":"Hennessy, M.: Exploring probabilistic bisimulations, part I. Formal Aspects of Computing\u00a024(4-6), 749\u2013768 (2012)","journal-title":"Formal Aspects of Computing"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Hermanns, H.: Interactive Markov Chains: The Quest for Quantified Quality. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45804-2_5"},{"key":"6_CR13","unstructured":"Hermanns, H., Turrini, A.: Deciding probabilistic automata weak bisimulation in polynomial time. In: FSTTCS, pp. 435\u2013447 (2012)"},{"issue":"1","key":"6_CR14","first-page":"43","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. I&C\u00a086(1), 43\u201368 (1990)","journal-title":"I&C"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing (preliminary report). In: POPL, pp. 344\u2013352 (1989)","DOI":"10.1145\/75277.75307"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45187-7_14","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N.A. Lynch","year":"2003","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for probabilistic automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 208\u2013221. Springer, Heidelberg (2003)"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/S0097539704446487","volume":"37","author":"N.A. Lynch","year":"2007","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Observing branching structure through probabilistic contexts. SIAM J. on Computing\u00a037(4), 977\u20131013 (2007)","journal-title":"SIAM J. on Computing"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 - Concurrency Theory","author":"A. Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 334\u2013349. Springer, Heidelberg (2000)"},{"key":"6_CR19","unstructured":"Schuster, J., Siegle, M.: Markov automata: Deciding weak bisimulation by means of \u201cnon-na\u00efvely\u201d vanishing states, http:\/\/arxiv.org\/abs\/1205.6192"},{"key":"6_CR20","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT (1995)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11817949_5","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R. Segala","year":"2006","unstructured":"Segala, R.: Probability and nondeterminism in operational models of concurrency. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 64\u201378. Springer, Heidelberg (2006)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60218-6_1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local model checking games (extended abstract). In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-56610-4_89","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"W. Thomas","year":"1993","unstructured":"Thomas, W.: On the Ehrenfeucht-Fra\u00efss\u00e9 game in theoretical computer science. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 559\u2013568. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40196-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T12:33:26Z","timestamp":1596198806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40196-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401954","9783642401961"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40196-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}