{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:21:13Z","timestamp":1784830873162,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642142949","type":"print"},{"value":"9783642142956","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14295-6_14","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T22:36:09Z","timestamp":1278628569000},"page":"132-147","source":"Crossref","is-referenced-by-count":29,"title":["Simulation Subsumption in Ramsey-Based B\u00fcchi Automata Universality and Inclusion Testing"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Fang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Clemente","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luk\u00e1\u0161","family":"Hol\u00edk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chih-Duo","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom\u00e1\u0161","family":"Vojnar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Chen, Y.-F., Clemente, L., Hol\u00edk, L., Hong, C.-D., Mayr, R., Vojnar, T.: Simulation Subsumption in Ramsey-based B\u00fcchi Automata Universality and Inclusion Testing. Technical report FIT-TR-2010-02, FIT BUT (2010), http:\/\/www.fit.vutbr.cz\/~holik\/pub\/FIT-TR-2010-002.pdf","DOI":"10.1007\/978-3-642-14295-6_14"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Proc. of TACAS\u201910","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata). In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 158\u2013174. Springer, Heidelberg (2010)"},{"key":"14_CR3","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Vojnar, T.: Mediating for Reduction (On Minimizing Alternating B\u00fcchi Automata). In: Proc. of FSTTCS\u201909, Leibniz International Proceedings in Informatics, vol.\u00a04 (2009)"},{"key":"14_CR4","unstructured":"B\u00fcchi, J.R.: On a Decision Method in Restricted Second Order Arithmetic. In: Proc. of Int. Con. on Logic, Method, and Phil. of Science (1962)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-71209-1_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Doyen","year":"2007","unstructured":"Doyen, L., Raskin, J.-F.: Improved Algorithms for the Automata-based Approach to Model Checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 451\u2013465. Springer, Heidelberg (2007)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45694-5_10","volume-title":"CONCUR 2002 - Concurrency Theory","author":"K. Etessami","year":"2002","unstructured":"Etessami, K.: A Hierarchy of Polynomial-Time Computable Simulations for Automata. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, p. 131. Springer, Heidelberg (2002)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair Simulation Relations, Parity\u00a0Games, and State Space Reduction for B\u00fcchi Automata. SIAM J. Comp.\u00a034(5) (2005)","DOI":"10.1137\/S0097539703420675"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Fogarty, S.: B\u00fcchi Containment and Size-Change Termination. Master\u2019s Thesis, Rice University (2008)","DOI":"10.1007\/978-3-642-00768-2_2"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of TACAS\u201909","author":"S. Fogarty","year":"2009","unstructured":"Fogarty, S., Vardi, M.Y.: B\u00fcchi Complementation and Size-Change Termination. In: Proc. of TACAS\u201909. LNCS, vol.\u00a05505. Springer, Heidelberg (2009)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-642-12002-2_17","volume-title":"Proc. of TACAS\u201910","author":"S. Fogarty","year":"2010","unstructured":"Fogarty, S., Vardi, M.Y.: Efficient B\u00fcchi Universality Checking. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 205\u2013220. Springer, Heidelberg (2010)"},{"key":"14_CR11","volume-title":"Proc. FOCS\u201995","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing Simulations on Finite and Infinite Graphs. In: Proc. FOCS\u201995. IEEE CS, Los Alamitos (1995)"},{"key":"14_CR12","unstructured":"Hol\u00edk, L., \u0160im\u00e1\u010dek, J.: Optimizing an LTS-Simulation Algorithm. In: Proc. of MEMICS\u201909 (2009)"},{"key":"14_CR13","unstructured":"Jones, N.D., Lee, C.S., Ben-Amram, A.M.: The Size-Change Principle for Program Termination. In: Proc. of POPL\u201901. ACM SIGPLAN (2001)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak Alternating Automata Are Not That Weak. ACM Transactions on Computational Logic\u00a02(2), 408\u2013429 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-73370-6_17","volume-title":"Model Checking Software","author":"R. Pel\u00e1nek","year":"2007","unstructured":"Pel\u00e1nek, R.: BEEM: Benchmarks for Explicit Model Checkers. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 263\u2013267. Springer, Heidelberg (2007)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015772","volume-title":"Automata, Languages and Programming","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The Complementation Problem for B\u00fcchi Automata with Applications to Temporal Logic. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194. Springer, Heidelberg (1985)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_21","volume-title":"Computer Aided Verification","author":"F. Somenzi","year":"2000","unstructured":"Somenzi, F., Bloem, R.: Efficient B\u00fcchi Automata from LTL Formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855. Springer, Heidelberg (2000)"},{"key":"14_CR18","unstructured":"Tabakov, D., Vardi, M.Y.: Model Checking B\u00fcchi Specifications. In: Proc. of LATA\u201907 (2007)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-71209-1_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y.-K. Tsay","year":"2007","unstructured":"Tsay, Y.-K., Chen, Y.-F., Tsai, M.-H., Wu, K.-N., Chan, W.-C.: GOAL: A\u00a0Graphical Tool for Manipulating B\u00fcchi Automata and Temporal Formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 466\u2013471. Springer, Heidelberg (2007)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M.D. Wulf","year":"2006","unstructured":"Wulf, M.D., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A New Algorithm for Checking Universality of Finite Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 17\u201330. Springer, Heidelberg (2006)"},{"key":"14_CR21","unstructured":"http:\/\/iis.sinica.edu.tw\/FMLAB\/CAV2010 (capitalize \u201cFMLAB\u201d and \u201cCAV 2010\u201d)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14295-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:50:35Z","timestamp":1606186235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14295-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142949","9783642142956"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14295-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}