{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T13:43:54Z","timestamp":1769521434777,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662445211","type":"print"},{"value":"9783662445228","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_18","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:12:23Z","timestamp":1407823943000},"page":"208-219","source":"Crossref","is-referenced-by-count":14,"title":["Size-Change Abstraction and Max-Plus Automata"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[]},{"given":"Laure","family":"Daviaud","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Ben-Amram, A.M., Vainer, M.: Bounded termination of monotonicity-constraint transition systems. CoRR, abs\/1202.4281 (2012)"},{"key":"18_CR2","unstructured":"Colcombet, T., Daviaud, L.: Approximate comparison of distance automata. In: STACS, pp. 574\u2013585 (2013)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci.\u00a024(2), 233\u2013244 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D. Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Internat. J. Algebra Comput.\u00a04(3), 405\u2013425 (1994)","journal-title":"Internat. J. Algebra Comput."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL, pp. 81\u201392 (2001)","DOI":"10.1145\/373243.360210"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/11817963_36","volume-title":"Computer Aided Verification","author":"P. Manolios","year":"2006","unstructured":"Manolios, P., Vroon, D.: Termination analysis with calling context graphs. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 401\u2013414. Springer, Heidelberg (2006)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theoretical Computer Science\u00a072, 65\u201394 (1990)","journal-title":"Theoretical Computer Science"},{"key":"18_CR10","unstructured":"Simon, I.: The nondeterministic complexity of a finite automaton. In: Mots. Lang. Raison. Calc., pp. 384\u2013400. Herm\u00e8s, Paris (1990)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Zuleger, F., Gulwani, S., Sinn, M., Veith, H.: Bound analysis of imperative programs with the size-change abstraction. In: Yahav, E. (ed.) SAS 2011. LNCS, vol.\u00a06887, pp. 280\u2013297. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-23702-7_22"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:38:21Z","timestamp":1558953501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}