{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:15Z","timestamp":1760202675326,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_31","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:21:03Z","timestamp":1408756863000},"page":"451-466","source":"Crossref","is-referenced-by-count":10,"title":["Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices"],"prefix":"10.1007","author":[{"given":"Natsuki","family":"Urabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"The GNU linear programming kit, http:\/\/www.gnu.org\/software\/glpk"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Akian, M., Gaubert, S., Guterman, A.E.: Tropical polyhedra are equivalent to mean payoff games. International Journal of Algebra and Computation\u00a022(1) (2012)","DOI":"10.1142\/S0218196711006674"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2003.10.001","volume":"89","author":"C. Baier","year":"2004","unstructured":"Baier, C., Hermanns, H., Katoen, J.P.: Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett.\u00a089(3), 123\u2013130 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"18","key":"31_CR4","doi-asserted-by":"publisher","first-page":"3506","DOI":"10.1016\/j.dam.2008.03.016","volume":"156","author":"M. Bzem","year":"2008","unstructured":"Bzem, M., Nieuwenhuis, R., Rodr\u00edguez-Carbonell, E.: Exponential behaviour of the butkovic-zimmermann algorithm for solving two-sided linear systems in max-algebra. Discrete Applied Mathematics\u00a0156(18), 3506\u20133509 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00224-003-1061-2","volume":"36","author":"V.D. Blondel","year":"2003","unstructured":"Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theory Comput. Syst.\u00a036(3), 231\u2013245 (2003)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"31_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.dam.2005.09.008","volume":"154","author":"P. Butkovic","year":"2006","unstructured":"Butkovic, P., Zimmermann, K.: A strongly polynomial algorithm for solving two-sided linear systems in max-algebra. Discrete Applied Math.\u00a0154(3), 437\u2013446 (2006)","journal-title":"Discrete Applied Math."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:10)2010"},{"issue":"38","key":"31_CR8","doi-asserted-by":"publisher","first-page":"5025","DOI":"10.1016\/j.tcs.2011.04.025","volume":"412","author":"C. C\u00eerstea","year":"2011","unstructured":"C\u00eerstea, C.: Maximal traces and path-based coalgebraic temporal logics. Theor. Comput. Sci.\u00a0412(38), 5025\u20135042 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"31_CR9","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."},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journal of Game Theory\u00a08(2), 109\u2013113 (1979)","journal-title":"International Journal of Game Theory"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/11817949_27","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"I. Hasuo","year":"2006","unstructured":"Hasuo, I.: Generic forward and backward simulations. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 406\u2013420. Springer, Heidelberg (2006)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-15375-4_31","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I. Hasuo","year":"2010","unstructured":"Hasuo, I.: Generic forward and backward simulations II: Probabilistic simulation. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 447\u2013461. Springer, Heidelberg (2010)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11548133_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"I. Hasuo","year":"2005","unstructured":"Hasuo, I., Jacobs, B.: Context-free languages via coalgebraic trace semantics. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 213\u2013231. Springer, Heidelberg (2005)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Computer Science\u00a03(4) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"issue":"22-24","key":"31_CR15","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/j.tcs.2010.01.031","volume":"411","author":"I. Hasuo","year":"2010","unstructured":"Hasuo, I., Kawabe, Y., Sakurada, H.: Probabilistic anonymity via coalgebraic simulations. Theor. Comput. Sci.\u00a0411(22-24), 2239\u20132259 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"31_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J. Hughes","year":"2004","unstructured":"Hughes, J., Jacobs, B.: Simulations in coalgebra. Theor. Comput. Sci.\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR17","unstructured":"Jacobs, B.: Introduction to coalgebra. Towards mathematics of states and observations, Draft of a book (ver. 2.0) (2012) (available online)"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151651"},{"key":"31_CR19","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 equivalence for probabilistic automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 526\u2013540. Springer, Heidelberg (2011)"},{"issue":"2","key":"31_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10703-012-0173-1","volume":"43","author":"S. Kiefer","year":"2013","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: Algorithmic probabilistic game semantics\u2014playing games with automata. Formal Methods in System Design\u00a043(2), 285\u2013312 (2013)","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"31_CR21","first-page":"123","volume":"367","author":"C. Konstantinos","year":"2006","unstructured":"Konstantinos, C., Catuscia, P.: Probable innocence revisited. Theoretical Computer Science\u00a0367(1), 123\u2013138 (2006)","journal-title":"Theoretical Computer Science"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-55719-9_67","volume-title":"Automata, Languages and Programming","author":"D. Krob","year":"1992","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 101\u2013112. Springer, Heidelberg (1992)"},{"issue":"2","key":"31_CR23","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N.A. Lynch","year":"1995","unstructured":"Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations: I. Untimed systems. Inf. Comput.\u00a0121(2), 214\u2013233 (1995)","journal-title":"Untimed systems. Inf. Comput."},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Tropical semirings. Idempotency (Bristol, 1994), 50\u201369 (1998)","DOI":"10.1017\/CBO9780511662508.004"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S1571-0661(05)80319-6","volume":"29","author":"J. Power","year":"1999","unstructured":"Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. Electr. Notes Theor. Comput. Sci.\u00a029, 259\u2013274 (1999)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"31_CR26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for web transactions. ACM Trans. Inf. Syst. Secur.\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"2","key":"31_CR27","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0221017","volume":"21","author":"W.G. Tzeng","year":"1992","unstructured":"Tzeng, W.G.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput.\u00a021(2), 216\u2013227 (1992)","journal-title":"SIAM J. Comput."},{"issue":"1&2","key":"31_CR28","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci.\u00a0158(1&2), 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:40:59Z","timestamp":1746351659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}