{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:48Z","timestamp":1775097048852,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642210693","type":"print"},{"value":"9783642210709","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21070-9_14","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T04:02:27Z","timestamp":1307419347000},"page":"164-179","source":"Crossref","is-referenced-by-count":4,"title":["Using Bisimulations for Optimality Problems in Model Refinement"],"prefix":"10.1007","author":[{"given":"Roland","family":"Gl\u00fcck","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"14_CR2","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-04639-1_3","volume-title":"Relations and Kleene Algebra in Computer Science","author":"J.N. Billings","year":"2009","unstructured":"Billings, J.N., Griffin, T.G.: A model of internet routing using semi-modules. In: Berghammer, R., Jaoua, A.M., M\u00f6ller, B. (eds.) RelMiCS 2009. LNCS, vol.\u00a05827, pp. 29\u201343. Springer, Heidelberg (2009)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-85780-8_24","volume-title":"Developments in Language Theory","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Derivation tree analysis for accelerated fixed-point computation. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 301\u2013313. Springer, Heidelberg (2008)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-04639-1_10","volume-title":"Relations and Kleene Algebra in Computer Science","author":"R. Gl\u00fcck","year":"2009","unstructured":"Gl\u00fcck, R., M\u00f6ller, B., Sintzoff, M.: A semiring approach to equivalences, bisimulations and control. In: Berghammer, R., Jaoua, A.M., M\u00f6ller, B. (eds.) RelMiCS 2009. LNCS, vol.\u00a05827, pp. 134\u2013149. Springer, Heidelberg (2009)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-17796-5_5","volume-title":"Algebraic Methodology and Software Technology","author":"R. Gl\u00fcck","year":"2011","unstructured":"Gl\u00fcck, R., M\u00f6ller, B., Sintzoff, M.: Model refinement using bisimulation quotients. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol.\u00a06486, pp. 76\u201391. Springer, Heidelberg (2011)"},{"key":"14_CR7","volume-title":"Graphs, Dioids and Semirings","author":"M. Gondran","year":"2008","unstructured":"Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer, Heidelberg (2008)"},{"key":"14_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73595-3_19","volume-title":"Automated Deduction \u2013 CADE-21","author":"P. H\u00f6fner","year":"2007","unstructured":"H\u00f6fner, P., Struth, G.: Automated reasoning in kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 279\u2013294. Springer, Heidelberg (2007)"},{"key":"14_CR9","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"2005","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11828563_17","volume-title":"Relations and Kleene Algebra in Computer Science","author":"Y. Kawahara","year":"2006","unstructured":"Kawahara, Y.: On the cardinality of relations. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 251\u2013265. Springer, Heidelberg (2006)"},{"key":"14_CR11","unstructured":"Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112\u2013137 (1957)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society\u00a09, 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal for Computing\u00a016(6)","DOI":"10.1137\/0216062"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-70594-9_18","volume-title":"Mathematics of Program Construction","author":"M. Sintzoff","year":"2008","unstructured":"Sintzoff, M.: Synthesis of optimal control policies for some infinite-state transition systems. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 336\u2013359. Springer, Heidelberg (2008)"},{"issue":"4","key":"14_CR15","first-page":"429","volume":"83","author":"M. Winter","year":"2008","unstructured":"Winter, M.: A relation-algebraic theory of bisimulations. Fundam. Inf.\u00a083(4), 429\u2013449 (2008)","journal-title":"Fundam. Inf."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21070-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T08:07:01Z","timestamp":1553760421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21070-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210693","9783642210709"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21070-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}