{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:10Z","timestamp":1760202670827},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_25","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"349-363","source":"Crossref","is-referenced-by-count":1,"title":["Cost Preserving Bisimulations for Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Holger","family":"Hermanns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-32940-1_8","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"G. Avni","year":"2012","unstructured":"Avni, G., Kupferman, O.: Making weighted containment feasible: A heuristic based on simulation and abstraction. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 84\u201399. Springer, Heidelberg (2012)"},{"issue":"1","key":"25_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.: Deciding bisimilarity and similarity for probabilistic processes. J. Computer and Systes Science\u00a060(1), 187\u2013231 (2000)","journal-title":"J. Computer and Systes Science"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-85778-5_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 33\u201347. Springer, Heidelberg (2008)"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2011.08.002","volume":"413","author":"P. \u010cern\u00fd","year":"2012","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. TCS\u00a0413(1), 21\u201335 (2012)","journal-title":"TCS"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11672142_26","volume-title":"STACS 2006","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Majumdar, R., Henzinger, T.A.: Markov decision processes with multiple objectives. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 325\u2013336. Springer, Heidelberg (2006)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chehaibar, G., Garavel, H., Mounier, L., Tawbi, N., Zulian, F.: Specification and verification of the PowerScale TM bus arbitration protocol: An industrial experiment with LOTOS. In: FORTE. pp. 435\u2013450 (1996)","DOI":"10.1007\/978-0-387-35079-0_28"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-36742-7_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Eisentraut","year":"2013","unstructured":"Eisentraut, C., Hermanns, H., Schuster, J., Turrini, A., Zhang, L.: The quest for minimal quotients for probabilistic automata. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol.\u00a07795, pp. 16\u201331. Springer, Heidelberg (2013)"},{"issue":"8","key":"25_CR8","first-page":"1","volume":"4","author":"K. Etessami","year":"2008","unstructured":"Etessami, K., Kwiatkowska, M., Vardi, M.Y., Yannakakis, M.: Molti-objective model checking of Markov decision processes. Logical Methods in Computer Science\u00a04(8), 1\u201321 (2008)","journal-title":"Logical Methods in Computer Science"},{"issue":"1-2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0004-3702(02)00376-4","volume":"147","author":"R. Givan","year":"2003","unstructured":"Givan, R., Dean, T., Greig, M.: Equivalence notions and model minimization in Markov decision processes. Artificial Intelligence\u00a0147(1-2), 163\u2013223 (2003)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0167-6423(99)00019-2","volume":"36","author":"H. Hermanns","year":"2000","unstructured":"Hermanns, H., Katoen, J.P.: Automated compositional Markov chain generation for a plain-old telephone system. Science of Computer Programming\u00a036(1), 97\u2013127 (2000)","journal-title":"Science of Computer Programming"},{"key":"25_CR11","unstructured":"Hermanns, H., Turrini, A.: Deciding probabilistic automata weak bisimulation in polynomial time. In: FSTTCS, pp. 435\u2013447 (2012)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11691372_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Hinton","year":"2006","unstructured":"Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A tool for automatic verification of probabilistic systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 441\u2013444. Springer, Heidelberg (2006)"},{"key":"25_CR13","unstructured":"Howard, R.A.: Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes. Dover Publications (2007)"},{"key":"25_CR14","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277 (1991)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-71209-1_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.-P. Katoen","year":"2007","unstructured":"Katoen, J.-P., Kemna, T., Zapreev, I., Jansen, D.N.: Bisimulation minimisation mostly speeds up probabilistic model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 87\u2013101. Springer, Heidelberg (2007)"},{"issue":"4","key":"25_CR16","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":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-02737-6_34","volume-title":"Developments in Language Theory","author":"K. Quaas","year":"2009","unstructured":"Quaas, K.: Weighted timed MSO logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 419\u2013430. Springer, Heidelberg (2009)"},{"key":"25_CR18","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. thesis. MIT (1995)"},{"key":"25_CR19","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)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T02:56:07Z","timestamp":1557975367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}