{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:44:38Z","timestamp":1725853478949},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496732"},{"type":"electronic","value":"9783662496749"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49674-9_46","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T18:49:00Z","timestamp":1460141340000},"page":"717-735","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Reduction of Nondeterministic Tree Automata"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Luk\u00e1\u0161","family":"Hol\u00edk","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"46_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-78800-3_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Computing simulations over tree automata. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 93\u2013108. Springer, Heidelberg (2008)"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 158\u2013174. Springer, Heidelberg (2010)"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-02444-8_17","volume-title":"Automated Technology for Verification and Analysis","author":"PA Abdulla","year":"2013","unstructured":"Abdulla, P.A., Hol\u00edk, L., Jonsson, B., Leng\u00e1l, O., Trinh, C.Q., Vojnar, T.: Verification of heap manipulating programs with ordered data by extended forest automata. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 224\u2013239. Springer, Heidelberg (2013)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.entcs.2009.08.026","volume":"251","author":"PA Abdulla","year":"2009","unstructured":"Abdulla, P.A., Hol\u00edk, L., Kaati, L., Vojnar, T.: A uniform (bi-)simulation-based framework for reducing tree automata. Electr. Notes Theor. Comput. Sci. 251, 27\u201348 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"46_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-31980-1_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2005","unstructured":"Abdulla, P.A., Legay, A., d\u2019Orso, J., Rezine, A.: Simulation-based iteration of tree transducers. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 30\u201344. Springer, Heidelberg (2005)"},{"issue":"1\u20132","key":"46_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jlap.2006.02.001","volume":"69","author":"PA Abdulla","year":"2006","unstructured":"Abdulla, P.A., Legay, A., d\u2019Orso, J., Rezine, A.: Tree regular model checking: a simulation-based approach. J. Log. Algebr. Program. 69(1\u20132), 93\u2013121 (2006)","journal-title":"J. Log. Algebr. Program."},{"key":"46_CR7","unstructured":"Almeida, R., Hol\u00edk, L., Mayr, R.: HeavyMinOTAut (2015). \n                      http:\/\/tinyurl.com\/pm2b4qk"},{"key":"46_CR8","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/978-3-662-49674-9_46","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Ricardo Almeida","year":"2016","unstructured":"Almeida, R., Hol\u00edk, L., Mayr, R.: Reduction of nondeterministic tree automata. Technical report EDI-INF-RR-1421, University of Edinburgh (2016). arXiv 1512.08823"},{"key":"46_CR9","unstructured":"Basin, D., Karlund, N., M\u00f8ller, A.: Mona (2015). \n                      http:\/\/www.brics.dk\/mona"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Principles of Programming Languages (POPL), Rome, Italy. ACM (2013)","DOI":"10.1145\/2429069.2429124"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-70844-5_7","volume-title":"Implementation and Applications of Automata","author":"A Bouajjani","year":"2008","unstructured":"Bouajjani, A., Habermehl, P., Hol\u00edk, L., Touili, T., Vojnar, T.: Antichain-based universality and inclusion testing over nondeterministic finite tree automata. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 57\u201367. Springer, Heidelberg (2008)"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11823230_5","volume-title":"Static Analysis","author":"A Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 52\u201370. Springer, Heidelberg (2006)"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Clemente, L., Mayr, R.: Advanced automata minimization. In: 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 63\u201374. ACM (2013)","DOI":"10.1145\/2480359.2429079"},{"key":"46_CR14","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2008). \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\n                      \n                    . Release 18 November 2008"},{"key":"46_CR15","unstructured":"Durand, I.: Autowrite (2015). \n                      http:\/\/dept-info.labri.fr\/~idurand\/autowrite"},{"key":"46_CR16","unstructured":"Genet, T., et al.: Timbuk (2015). \n                      http:\/\/www.irisa.fr\/celtique\/genet\/timbuk\/"},{"key":"46_CR17","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., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 131\u2013144. Springer, Heidelberg (2002)"},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-22110-1_34","volume-title":"Computer Aided Verification","author":"P Habermehl","year":"2011","unstructured":"Habermehl, P., Hol\u00edk, L., Rogalewicz, A., \u0160im\u00e1\u010dek, J., Vojnar, T.: Forest automata for verification of heap manipulation. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 424\u2013440. Springer, Heidelberg (2011)"},{"key":"46_CR19","unstructured":"Hol\u00edk, L.: Simulations and Antichains for Efficient Handling of Finite Automata. Ph.D. thesis, Faculty of Information Technology of Brno University of Technology (2011)"},{"key":"46_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-39799-8_52","volume-title":"Computer Aided Verification","author":"L Hol\u00edk","year":"2013","unstructured":"Hol\u00edk, L., Leng\u00e1l, O., Rogalewicz, A., \u0160im\u00e1\u010dek, J., Vojnar, T.: Fully automated shape analysis based on forest automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 740\u2013755. Springer, Heidelberg (2013)"},{"key":"46_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-24372-1_18","volume-title":"Automated Technology for Verification and Analysis","author":"L Hol\u00edk","year":"2011","unstructured":"Hol\u00edk, L., Leng\u00e1l, O., \u0160im\u00e1\u010dek, J., Vojnar, T.: Efficient inclusion checking on explicit and semi-symbolic tree automata. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 243\u2013258. Springer, Heidelberg (2011)"},{"key":"46_CR22","unstructured":"Leng\u00e1l, O., Sim\u00e1cek, J., Vojnar, T.: Libvata: highly optimised non-deterministic finite tree automata library (2015). \n                      http:\/\/www.fit.vutbr.cz\/research\/groups\/verifit\/tools\/libvata\/"},{"key":"46_CR23","unstructured":"Leng\u00e1l, O., Sim\u00e1cek, J., Vojnar, T., Habermehl, P., Hol\u00edk, L., Rogalewicz, A.: Forester: tool for verification of programs with pointers (2015). \n                      http:\/\/www.fit.vutbr.cz\/research\/groups\/verifit\/tools\/forester\/"},{"key":"46_CR24","unstructured":"Tabakov, D., Vardi, M.: Model Checking B\u00fcchi Specifications. In LATA, volume Report 35\/07. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona (2007)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49674-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T01:15:59Z","timestamp":1585012559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49674-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496732","9783662496749"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49674-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}