{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:23Z","timestamp":1759637903835,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_8","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:47:02Z","timestamp":1346532422000},"page":"84-99","source":"Crossref","is-referenced-by-count":4,"title":["Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-24372-1_16","volume-title":"Automated Technology for Verification and Analysis","author":"B. Aminof","year":"2011","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Formal Analysis of Online Algorithms. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 213\u2013227. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S.K., Ustuner, A.: Thorough static analysis of device drivers. In: EuroSys (2006)","key":"8_CR3","DOI":"10.1145\/1217935.1217943"},{"key":"8_CR4","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)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48683-6_25","volume-title":"Computer Aided Verification","author":"G. Bruns","year":"1999","unstructured":"Bruns, G., Godefroid, P.: Model Checking Partial State Spaces with 3-Valued Temporal Logics. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 274\u2013287. Springer, Heidelberg (1999)"},{"unstructured":"Ball, T., Kupferman, O.: An abstraction-refinement framework for multi-agent systems. In: Proc. 21st LICS (2006)","key":"8_CR6"},{"doi-asserted-by":"crossref","unstructured":"Boker, U., Kupferman, O.: Co-ing B\u00fcchi made tight and helpful. In: Proc. 24th LICS, pp. 245\u2013254 (2009)","key":"8_CR7","DOI":"10.1109\/LICS.2009.32"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In: Proc. 4th POPL, pp. 238\u2013252 (1977)","key":"8_CR8","DOI":"10.1145\/512950.512973"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-642-14162-1_50","volume-title":"Automata, Languages and Programming","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: Energy Parity Games. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 599\u2013610. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantative languages. In: Proc. 17th CSL, pp. 385\u2013400 (2008)","key":"8_CR10","DOI":"10.1007\/978-3-540-87531-4_28"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-04081-8_17","volume-title":"CONCUR 2009 - Concurrency Theory","author":"K. Chatterjee","year":"2009","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Probabilistic Weighted Automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 244\u2013258. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. LMCS\u00a06(3) (2010)","key":"8_CR12","DOI":"10.2168\/LMCS-6(3:10)2010"},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"E.M. Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM\u00a050(5), 752\u2013794 (2003)","journal-title":"Journal of the ACM"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-15375-4_18","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P. \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation Distances. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 253\u2013268. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Culik, K., Kari, J.: Digital images and formal languages. In: Handbook of Formal Languages, vol. 3: Beyond Words, pp. 599\u2013616 (1997)","key":"8_CR15","DOI":"10.1007\/978-3-642-59126-6_10"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-74407-8_6","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"L. Alfaro de","year":"2007","unstructured":"de Alfaro, L., Roy, P.: Solving Games Via Three-Valued Abstraction Refinement. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 74\u201389. Springer, Heidelberg (2007)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11523468_42","volume-title":"Automata, Languages and Programming","author":"M. Droste","year":"2005","unstructured":"Droste, M., Gastin, P.: Weighted Automata and Weighted Logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 513\u2013525. Springer, Heidelberg (2005)"},{"issue":"8","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1016\/j.ic.2006.10.009","volume":"205","author":"O. Grumberg","year":"2007","unstructured":"Grumberg, O., Lange, M., Leucker, M., Shoham, S.: When not losing is better than winning: Abstraction and refinement for the full \u03bc-calculus. Inf. Comput.\u00a0205(8), 1130\u20131148 (2007)","journal-title":"Inf. Comput."},{"key":"8_CR19","first-page":"245","volume":"28","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite games of perfect information. Ann. Math. Studies\u00a028, 245\u2013266 (1953)","journal-title":"Ann. Math. Studies"},{"doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. 36th FOCS, pp. 453\u2013462 (1995)","key":"8_CR20","DOI":"10.1109\/SFCS.1995.492576"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/3-540-45061-0_69","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R.: Counterexample-Guided Control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 886\u2013902. Springer, Heidelberg (2003)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-45099-3_12","volume-title":"Static Analysis","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Majumdar, R., Mang, F.Y.C., Raskin, J.-F.: Abstract Interpretation of Game Properties. In: SAS 2000. LNCS, vol.\u00a01824, pp. 220\u2013240. Springer, Heidelberg (2000)"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-45069-6_36","volume-title":"Computer Aided Verification","author":"Y. Kesten","year":"2003","unstructured":"Kesten, Y., Piterman, N., Pnueli, A.: Bridging the Gap between Fair Simulation and Trace Inclusion. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 381\u2013393. Springer, Heidelberg (2003)"},{"issue":"3","key":"8_CR24","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"},{"unstructured":"Kuperberg, D.: Linear temporal logic for regular cost functions. In: Proc. 28th STACS, pp. 627\u2013636 (2011)","key":"8_CR25"},{"doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Proc. 6th PODC, pp. 137\u2013151 (1987)","key":"8_CR26","DOI":"10.1145\/41840.41852"},{"unstructured":"Larsen, K.G., Thomsen, G.B.: A modal process logic. In: Proc. 3rd LICS (1988)","key":"8_CR27"},{"unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: Proc. 2nd IJCAI, pp. 481\u2013489 (1971)","key":"8_CR28"},{"issue":"2","key":"8_CR29","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":"8_CR30","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"},{"doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proc. 13th SWAT, pp. 125\u2013129 (1972)","key":"8_CR31","DOI":"10.1109\/SWAT.1972.29"},{"issue":"2-3","key":"8_CR32","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(2-3), 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science\u00a049, 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:06:37Z","timestamp":1744049197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}