{"id":"https://openalex.org/W1976891319","doi":"https://doi.org/10.1142/s0129054109006814","title":"COMPOSED BISIMULATION FOR TREE AUTOMATA","display_name":"COMPOSED BISIMULATION FOR TREE AUTOMATA","publication_year":2009,"publication_date":"2009-07-29","ids":{"openalex":"https://openalex.org/W1976891319","doi":"https://doi.org/10.1142/s0129054109006814","mag":"1976891319"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054109006814","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054109006814","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]},{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"PAROSH AZIZ ABDULLA","raw_affiliation_strings":["Department of Information Technology, Uppsala University, P.O. Box 337, S-751 05 Uppsala, Sweden","Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Uppsala University, P.O. Box 337, S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]},{"raw_affiliation_string":"Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045477471","display_name":"Ahmed Bouajjani","orcid":"https://orcid.org/0000-0002-2060-3592"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"AHMED BOUAJJANI","raw_affiliation_strings":["LIAFA, Universit\u00e9 Paris Diderot\u2014Paris 7, Case 7014, F-75205 Paris cedex 13, France"],"affiliations":[{"raw_affiliation_string":"LIAFA, Universit\u00e9 Paris Diderot\u2014Paris 7, Case 7014, F-75205 Paris cedex 13, France","institution_ids":["https://openalex.org/I4210094115","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059358773","display_name":"Luk\u00e1\u0161 Hol\u00edk","orcid":"https://orcid.org/0000-0001-6957-1651"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"LUK\u00c1\u0160 HOL\u00cdK","raw_affiliation_strings":["FIT, Brno University of Technology, Czech Republic, Bo\u017eet\u011bchova 2, CZ-612 66 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"FIT, Brno University of Technology, Czech Republic, Bo\u017eet\u011bchova 2, CZ-612 66 Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031470842","display_name":"Lisa Kaati","orcid":"https://orcid.org/0000-0002-3724-7504"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"LISA KAATI","raw_affiliation_strings":["Department of Information Technology, Uppsala University, P.O. Box 337, S-751 05 Uppsala, Sweden","Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Uppsala University, P.O. Box 337, S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]},{"raw_affiliation_string":"Department of Information Technology, Uppsala University, P. O. Box 337, S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086446392","display_name":"Tom\u00e1\u0161 Vojnar","orcid":"https://orcid.org/0000-0002-2746-8792"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"TOM\u00c1\u0160 VOJNAR","raw_affiliation_strings":["FIT, Brno University of Technology, Czech Republic, Bo\u017eet\u011bchova 2, CZ-612 66 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"FIT, Brno University of Technology, Czech Republic, Bo\u017eet\u011bchova 2, CZ-612 66 Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5002478680"],"corresponding_institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"],"apc_list":null,"apc_paid":null,"fwci":1.0283,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74943667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"20","issue":"04","first_page":"685","last_page":"700"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9801999926567078,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.9734548330307007},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7753579020500183},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7290398478507996},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6476817727088928},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5162160992622375},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46213048696517944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43797093629837036},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41756951808929443},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3567659258842468},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14559313654899597}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.9734548330307007},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7753579020500183},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7290398478507996},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6476817727088928},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5162160992622375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46213048696517944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43797093629837036},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41756951808929443},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3567659258842468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14559313654899597}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054109006814","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054109006814","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322771","display_name":"Secret\u00e1rio de Ci\u00eancia, Tecnologia e Ensino Superior, Governo do Estado de Parana","ror":"https://ror.org/05nyhnc56"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2068361557","https://openalex.org/W2091043802","https://openalex.org/W2123948057","https://openalex.org/W4205241946"],"related_works":["https://openalex.org/W1704074244","https://openalex.org/W2113256684","https://openalex.org/W40031358","https://openalex.org/W2145454356","https://openalex.org/W2140646474","https://openalex.org/W1596619087","https://openalex.org/W3014656961","https://openalex.org/W2101922810","https://openalex.org/W2534853293","https://openalex.org/W4297837668"],"abstract_inverted_index":{"We":[0,58],"address":[1],"the":[2,6,19,22,28,52,109,121,144,147],"problem":[3],"of":[4,8,21,47,70,112,136,150],"reducing":[5],"size":[7],"(nondeterministic,":[9],"bottom-up)":[10],"tree":[11],"automata":[12],"(TA)":[13],"using":[14],"suitable,":[15],"language-preserving":[16],"equivalences":[17],"on":[18],"states":[20],"automata.":[23],"In":[24],"particular,":[25],"we":[26,118],"propose":[27],"so-called":[29],"composed":[30,40,71,126],"bisimulation":[31,41,56,72,127],"equivalence":[32,42,73,82,128],"as":[33],"a":[34,139],"new":[35],"language":[36],"preserving":[37],"equivalence.":[38,57],"A":[39],"is":[43,74,98],"defined":[44],"in":[45,120],"terms":[46],"two":[48],"different":[49],"relations,":[50],"namely":[51],"upward":[53],"and":[54,61,132,152],"downward":[55],"provide":[59,85],"simple":[60],"efficient":[62],"algorithms":[63],"for":[64],"computing":[65],"these":[66],"relations.":[67],"The":[68,115],"notion":[69],"motivated":[75],"by":[76],"an":[77,81],"attempt":[78],"to":[79,103,142],"obtain":[80],"that":[83,124],"can":[84,94],"better":[86],"reductions":[87],"than":[88],"what":[89],"currently":[90],"known":[91],"bisimulation-based":[92],"approaches":[93],"offer,":[95],"but":[96],"which":[97],"not":[99],"significantly":[100],"more":[101],"difficult":[102],"compute":[104],"(and":[105],"hence":[106,133],"stays":[107],"below":[108],"computational":[110],"requirements":[111],"simulation-based":[113],"reductions).":[114],"experimental":[116],"results":[117],"present":[119],"paper":[122],"show":[123],"our":[125],"meets":[129],"such":[130],"requirements,":[131],"provides":[134],"users":[135],"TA":[137],"with":[138],"finer":[140],"way":[141],"resolve":[143],"trade-off":[145],"between":[146],"available":[148],"degree":[149],"reduction":[151],"its":[153],"cost.":[154]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}