{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:09:40Z","timestamp":1767236980701},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319064093"},{"type":"electronic","value":"9783319064109"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06410-9_18","type":"book-chapter","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T17:03:01Z","timestamp":1397840581000},"page":"247-262","source":"Crossref","is-referenced-by-count":14,"title":["When Equivalence and Bisimulation Join Forces in Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36742-7_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Bacci","year":"2013","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On-the-Fly Exact Computation of Bisimilarity Distances. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 1\u201315. Springer, Heidelberg (2013)"},{"issue":"1","key":"18_CR2","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":"18_CR3","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press (1957)"},{"key":"18_CR4","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":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., de Alfaro, L., Majumdar, R., Raman, V.: Algorithms for game metrics (full version). Logical Methods in Computer Science\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:13)2010"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28729-9_29","volume-title":"Foundations of Software Science and Computational Structures","author":"D. Chen","year":"2012","unstructured":"Chen, D., van Breugel, F., Worrell, J.: On the Complexity of Computing Probabilistic Bisimilarity. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 437\u2013451. Springer, Heidelberg (2012)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Comanici, G., Panangaden, P., Precup, D.: On-the-Fly Algorithms for Bisimulation Metrics. In: QEST, pp. 94\u2013103. IEEE Computer Society (2012)","DOI":"10.1109\/QEST.2012.30"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Majumdar, R., Raman, V., Stoelinga, M.: Game relations and metrics. In: LICS, pp. 99\u2013108. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.22"},{"key":"18_CR9","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":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-48320-9_19","volume-title":"CONCUR\u201999. Concurrency Theory","author":"J. Desharnais","year":"1999","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for Labeled Markov Systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled markov processes. Theor. Comput. Sci.\u00a0318(3), 323\u2013354 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ic.2009.11.002","volume":"208","author":"J. Desharnais","year":"2010","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for pCTL*. Inf. Comput.\u00a0208(2), 203\u2013219 (2010)","journal-title":"Inf. Comput."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Laviolette, F., Tracol, M.: Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. In: QEST, pp. 264\u2013273. IEEE Computer Society (2008)","DOI":"10.1109\/QEST.2008.42"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1142\/S0129054108005814","volume":"19","author":"L. Doyen","year":"2008","unstructured":"Doyen, L., Henzinger, T.A., 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_CR15","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On Probabilistic Automata in Continuous Time. In: LICS, pp. 342\u2013351. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.41"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Feng, Y., Zhang, L.: When equivalence and bisimulation join forces in probabilistic automata. CoRR, abs\/1311.3396 (2013)","DOI":"10.1007\/978-3-319-06410-9_18"},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1137\/10080484X","volume":"40","author":"N. Ferns","year":"2011","unstructured":"Ferns, N., Panangaden, P., Precup, D.: Bisimulation Metrics for Continuous Markov Decision Processes. SIAM J. Comput.\u00a040(6), 1662\u20131714 (2011)","journal-title":"SIAM J. Comput."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-31585-5_23","volume-title":"Automata, Languages, and Programming","author":"H. Fu","year":"2012","unstructured":"Fu, H.: Computing Game Metrics on Markov Decision Processes. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 227\u2013238. Springer, Heidelberg (2012)"},{"key":"18_CR19","unstructured":"Giacalone, A., Jou, C., Smolka, S.: Algebraic reasoning for probabilistic concurrent systems. In: IFIP TC2 Working Conference on Programming Concepts and Methods, pp. 443\u2013458. North-Holland (1990)"},{"key":"18_CR20","series-title":"LNCS","first-page":"309","volume-title":"FM 2014","author":"E.M. Hahn","year":"2014","unstructured":"Hahn, E.M., Li, Y., Schewe, S., Turrini, A., Zhang, L.: ISCASMC: A web-based probabilistic model checker. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, pp. 309\u2013313. Springer, Heidelberg (2014)"},{"issue":"4-6","key":"18_CR21","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 Asp. Comput.\u00a024(4-6), 749\u2013768 (2012)","journal-title":"Formal Asp. Comput."},{"issue":"2","key":"18_CR22","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ic.2010.11.024","volume":"209","author":"H. Hermanns","year":"2011","unstructured":"Hermanns, H., Parma, A., Segala, R., Wachter, B., Zhang, L.: Probabilistic Logical Characterization. Inf. Comput.\u00a0209(2), 154\u2013172 (2011)","journal-title":"Inf. Comput."},{"key":"18_CR23","unstructured":"Hermanns, H., Turrini, A.: Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. In: D\u2019Souza, D., Kavitha, T., Radhakrishnan, J. (eds.) FSTTCS. LIPIcs, vol.\u00a018, pp. 435\u2013447, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.peva.2010.04.001","volume":"68","author":"J.-P. Katoen","year":"2011","unstructured":"Katoen, J.-P., Zapreev, I.S., Hahn, E.M., Hermanns, H., Jansen, D.N.: The ins and outs of the probabilistic model checker mrmc. Perform. Eval.\u00a068(2), 90\u2013104 (2011)","journal-title":"Perform. Eval."},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-22110-1_42","volume-title":"Computer Aided Verification","author":"S. Kiefer","year":"2011","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: Language\u00a0Equivalence\u00a0for Probabilistic\u00a0Automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 526\u2013540. Springer, Heidelberg (2011)"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-28729-9_31","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Kiefer","year":"2012","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: On the Complexity of the Equivalence Problem for Probabilistic Automata. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 467\u2013481. Springer, Heidelberg (2012)"},{"key":"18_CR27","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_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-71389-0_21","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Parma","year":"2007","unstructured":"Parma, A., Segala, R.: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 287\u2013301. Springer, Heidelberg (2007)"},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. Rabin","year":"1963","unstructured":"Rabin, M.: Probabilistic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"18_CR30","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Realtime Systems. PhD thesis. MIT (1995)"},{"issue":"2","key":"18_CR31","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 Journal on Computing\u00a021(2), 216\u2013227 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-71389-0_10","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Breugel van","year":"2007","unstructured":"van Breugel, F., Sharma, B., Worrell, J.: Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 123\u2013137. Springer, Heidelberg (2007)"},{"key":"18_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0123-3","volume-title":"Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs","author":"M. Ying","year":"2001","unstructured":"Ying, M.: Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs. Springer, New York (2001)"},{"key":"18_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(01)00124-4","volume":"275","author":"M. Ying","year":"2002","unstructured":"Ying, M.: Bisimulation indexes and their applications. Theoretical Computer Science\u00a0275, 1\u201368 (2002)","journal-title":"Theoretical Computer Science"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-45499-3_23","volume-title":"Algebraic Methodology and Software Technology","author":"M. Ying","year":"2000","unstructured":"Ying, M., Wirsing, M.: Approximate bisimilarity. In: Rus, T. (ed.) AMAST 2000. LNCS, vol.\u00a01816, pp. 309\u2013322. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","FM 2014: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06410-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:36:28Z","timestamp":1648838188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06410-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319064093","9783319064109"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06410-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}