{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:08:01Z","timestamp":1725505681790},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787990"},{"type":"electronic","value":"9783540788003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78800-3_8","type":"book-chapter","created":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T08:26:19Z","timestamp":1207124779000},"page":"93-108","source":"Crossref","is-referenced-by-count":20,"title":["Computing Simulations over Tree Automata"],"prefix":"10.1007","author":[{"given":"Parosh A.","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk\u00e1\u0161","family":"Hol\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Kaati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vojnar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Abdulla, P., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata. Technical report, FIT-TR-2007-001, FIT, Brno University of Technology, Czech Republic (2007)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11812128_17","volume-title":"Implementation and Application of Automata","author":"P. Abdulla","year":"2006","unstructured":"Abdulla, P., H\u00f6gberg, J., Kaati, L.: Bisimulation Minimization of Tree Automata. In: H. Ibarra, O., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, Springer, Heidelberg (2006)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_47","volume-title":"Computer Aided Verification","author":"P. Abdulla","year":"2002","unstructured":"Abdulla, P., Jonsson, B., Mahata, P., d\u2019Orso, J.: Regular Tree Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, Springer, Heidelberg (2002)"},{"issue":"1-2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jlap.2006.02.001","volume":"69","author":"P. Abdulla","year":"2006","unstructured":"Abdulla, P., Legay, A., d\u2019Orso, J., Rezine, A.: Tree Regular Model Checking: A Simulation-based Approach. The Journal of Logic and Algebraic Programming\u00a069(1-2), 93\u2013121 (2006)","journal-title":"The Journal of Logic and Algebraic Programming"},{"key":"8_CR5","first-page":"37","volume-title":"ENTCS","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. In: ENTCS, vol.\u00a0149(1), pp. 37\u201348. Elsevier, Amsterdam (2006)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a04134, Springer, Heidelberg (2006)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_46","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2002","unstructured":"Bouajjani, A., Touili, T.: Extrapolating Tree Transformations. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, Springer, Heidelberg (2002)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouajjani","year":"2003","unstructured":"Bouajjani, A., Touili, T.: Reachability Analysis of Process Rewrite Systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, Springer, Heidelberg (2003)"},{"key":"8_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), Available on: \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"8_CR10","volume-title":"Proc. of FOCS 1995","author":"M. Henzinger","year":"1995","unstructured":"Henzinger, M., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: Proc. of FOCS 1995, IEEE, Los Alamitos (1995)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","first-page":"109","volume-title":"Implementation and Application of Automata","author":"A. Maletti","year":"2007","unstructured":"Maletti, A., H\u00f6gberg, J., May, J.: Backward and forward bisimulation minimisation of tree automata. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 109\u2013121. Springer, Heidelberg (2007)"},{"key":"8_CR12","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual, BRICS, Department of Computer Science, University of Aarhus, Denmark (2001)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal on Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR14","volume-title":"Proc. of LICS 2007","author":"F. Ranzato","year":"2007","unstructured":"Ranzato, F., Tapparo, F.: A New Efficient Simulation Equivalence Algorithm. In: Proc. of LICS 2007, IEEE CS, Los Alamitos (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-540-78800-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:22:54Z","timestamp":1619522574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78800-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787990","9783540788003"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78800-3_8","relation":{},"subject":[]}}