{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:31Z","timestamp":1725516031714},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708438"},{"type":"electronic","value":"9783540708445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70844-5_22","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T09:19:29Z","timestamp":1216718369000},"page":"212-222","source":"Crossref","is-referenced-by-count":6,"title":["Composed Bisimulation for 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":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata. Technical Report FIT-TR-2008-04, FIT, Brno Uni. of Technology, Czech Republic (2008)","DOI":"10.1142\/S0129054109006814"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of TACAS 2008","author":"P. Abdulla","year":"2008","unstructured":"Abdulla, P., Bouajjani, A., Holik, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. In: Proc. of TACAS 2008. LNCS. Springer, Heidelberg (2008)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","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: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 173\u2013185. Springer, Heidelberg (2006)"},{"key":"22_CR4","unstructured":"Abdulla, P., Hol\u00edk, L., Kaati, L., Vojnar, T.: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Technical Report FIT-TR-2008-05, FIT, Brno Uni. of Technology, Czech Republic (2008)"},{"key":"22_CR5","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":"22_CR6","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":"22_CR7","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. In: Proc. of INFINITY 2005; ENTCS 149(1) (published, 2006)","DOI":"10.1016\/j.entcs.2005.11.015"},{"key":"22_CR8","first-page":"37","volume":"149","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. ENTCS\u00a0149, 37\u201348 (2006)","journal-title":"ENTCS"},{"key":"22_CR9","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":"22_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":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-76336-9_12","volume-title":"Implementation and Application of Automata","author":"J. H\u00f6gberg","year":"2007","unstructured":"H\u00f6gberg, J., Maletti, A., 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":"22_CR12","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual, BRICS, Department of Computer Science, University of Aarhus, Denmark (2001)"},{"key":"22_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":"22_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","Implementation and Applications of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70844-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:30:13Z","timestamp":1620016213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70844-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708438","9783540708445"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70844-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}