{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:10:09Z","timestamp":1745964609410,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370748"},{"type":"electronic","value":"9783642370755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_24","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:23Z","timestamp":1361216243000},"page":"369-384","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Weighted Containment"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-24372-1_37","volume-title":"Automated Technology for Verification and Analysis","author":"S. Almagor","year":"2011","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s Decidable about Weighted Automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 482\u2013491. Springer, Heidelberg (2011)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proc. 25th STOC, pp. 592\u2013601 (1993)","DOI":"10.1145\/167088.167242"},{"key":"24_CR3","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)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bruns, G., Godefroid, P.: Temporal logic query checking. In: Proc. 16th LICS, pp. 409\u2013420 (2001)","DOI":"10.1109\/LICS.2001.932516"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/10722167_34","volume-title":"Computer Aided Verification","author":"W. Chan","year":"2000","unstructured":"Chan, W.: Temporal-logic Queries. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 450\u2013463. Springer, Heidelberg (2000)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.: Quantitative Languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. LMCS\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:10)2010"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Culik, K., Kari, J.: Digital images and formal languages. In: Handbook of Formal Languages: Beyond words, vol.\u00a03, pp. 599\u2013616 (1997)","DOI":"10.1007\/978-3-642-59126-6_10"},{"key":"24_CR9","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall (1976)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-54233-7_127","volume-title":"Automata, Languages and Programming","author":"L. Fix","year":"1991","unstructured":"Fix, L., Francez, N., Grumberg, O.: Program Composition and Modular Verification. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 93\u2013114. Springer, Heidelberg (1991)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32940-1_11","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"E. Filiot","year":"2012","unstructured":"Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative Languages Defined by Functional Automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 132\u2013146. Springer, Heidelberg (2012)"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Corrigendum to our paper \u201cthe ellipsoid method and its consequences in combinatorial optimization\u201d. Combinatorica\u00a04(4) (1984)","DOI":"10.1007\/BF02579139"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11513988_23","volume-title":"Computer Aided Verification","author":"B. Jobstmann","year":"2005","unstructured":"Jobstmann, B., Griesmayer, A., Bloem, R.: Program Repair as a Game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 226\u2013238. Springer, Heidelberg (2005)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R., Papadimitriou, C.: On linear characterizations of combinatorial optimization problems. In: Proc. 21st FOCS, pp. 1\u20139 (1980)","DOI":"10.1109\/SFCS.1980.29"},{"key":"24_CR17","first-page":"1093","volume":"244","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR\u00a0244, 1093\u20131096 (1979)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"3","key":"24_CR18","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. International Journal of Algebra and Computation\u00a04(3), 405\u2013425 (1994)","journal-title":"International Journal of Algebra and Computation"},{"issue":"2","key":"24_CR19","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M. Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: Weighted finite-state transducers in speech recognition. Computer Speech and Language\u00a016(1), 69\u201388 (2002)","journal-title":"Computer Speech and Language"},{"key":"24_CR21","unstructured":"Padberg, M.W., Rao, M.R.: The Russian Method and Integer Programming. Working paper series. Salomon Brothers Center for the Study of Financial Institutions (1980)"},{"key":"24_CR22","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley (1999)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Rabbah, R.M., Bod\u00edk, R., Ebcioglu, K.: Programming by sketching for bit-streaming programs. In: PLDI, pp. 281\u2013294 (2005)","DOI":"10.1145\/1064978.1065045"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. Handbook of Theoretical Computer Science, 133\u2013191 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-27810-8_33","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 384\u2013396. Springer, Heidelberg (2004)"},{"issue":"1","key":"24_CR26","first-page":"1","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. I& C\u00a0115(1), 1\u201337 (1994)","journal-title":"I& C"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:32:44Z","timestamp":1745962364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}