{"id":"https://openalex.org/W2037801799","doi":"https://doi.org/10.2168/lmcs-8(1:13)2012","title":"B\\\"uchi Complementation and Size-Change Termination","display_name":"B\\\"uchi Complementation and Size-Change Termination","publication_year":2012,"publication_date":"2012-02-27","ids":{"openalex":"https://openalex.org/W2037801799","doi":"https://doi.org/10.2168/lmcs-8(1:13)2012","mag":"2037801799"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(1:13)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:13)2012","pdf_url":"https://lmcs.episciences.org/1178/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1178/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017354172","display_name":"Seth Fogarty","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seth Fogarty","raw_affiliation_strings":["Department of Computer Science Rice University Houston, TX"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Rice University Houston, TX","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000059818","display_name":"Moshe Y. Vardi","orcid":"https://orcid.org/0000-0002-0661-5773"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Moshe Y. Vardi","raw_affiliation_strings":["Department of Computer Science Rice University Houston, TX"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Rice University Houston, TX","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017354172"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":1.3822,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81416082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 8, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.695426344871521},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6763343811035156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5470415949821472},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.45910003781318665},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4440067410469055},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.4280164837837219},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.42001891136169434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41518133878707886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39947688579559326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3625023066997528},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2544083893299103},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07463032007217407}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.695426344871521},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6763343811035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5470415949821472},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.45910003781318665},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4440067410469055},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.4280164837837219},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.42001891136169434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41518133878707886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39947688579559326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3625023066997528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2544083893299103},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07463032007217407}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-8(1:13)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:13)2012","pdf_url":"https://lmcs.episciences.org/1178/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1110.6183","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1110.6183","pdf_url":"https://arxiv.org/pdf/1110.6183","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:434788db10d6471fa32aad4d058be5dc","is_oa":true,"landing_page_url":"https://doaj.org/article/434788db10d6471fa32aad4d058be5dc","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(1:13)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:13)2012","pdf_url":"https://lmcs.episciences.org/1178/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G425312499","display_name":"Automata-Theoretic Approach to Design Verification","funder_award_id":"0311326","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4783004968","display_name":"SOD:HCER: A Theory of Automated Design","funder_award_id":"0613889","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4819475828","display_name":"An Automata-Theoretic Approach to Design Synthesis","funder_award_id":"0728882","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G920019786","display_name":"MRI:  Acquisition of CITI Terascale Cluster (CTC)","funder_award_id":"0216467","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2037801799.pdf","grobid_xml":"https://content.openalex.org/works/W2037801799.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W42134522","https://openalex.org/W1520345377","https://openalex.org/W1537299619","https://openalex.org/W1539550612","https://openalex.org/W1543741569","https://openalex.org/W1548996544","https://openalex.org/W1550751956","https://openalex.org/W1571870963","https://openalex.org/W1579524364","https://openalex.org/W1588454361","https://openalex.org/W1698053229","https://openalex.org/W1759205474","https://openalex.org/W1846242859","https://openalex.org/W1976773489","https://openalex.org/W1993129359","https://openalex.org/W2018610026","https://openalex.org/W2026134631","https://openalex.org/W2031592188","https://openalex.org/W2044310724","https://openalex.org/W2059045337","https://openalex.org/W2072887965","https://openalex.org/W2073874233","https://openalex.org/W2086970337","https://openalex.org/W2097944031","https://openalex.org/W2098035530","https://openalex.org/W2119746039","https://openalex.org/W2138856440","https://openalex.org/W2144538202","https://openalex.org/W2949392484","https://openalex.org/W2963378790","https://openalex.org/W3100079006","https://openalex.org/W4233310630","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2164619678","https://openalex.org/W2113544496","https://openalex.org/W184826316","https://openalex.org/W2360313292","https://openalex.org/W1669105318","https://openalex.org/W3132573772","https://openalex.org/W2067777412","https://openalex.org/W2359527201","https://openalex.org/W2022544890","https://openalex.org/W2060032524"],"abstract_inverted_index":{"We":[0,87],"compare":[1],"tools":[2],"for":[3,84],"complementing":[4],"nondeterministic":[5],"B\\\"uchi":[6,15,57,85],"automata":[7,16,58],"with":[8,36,52],"a":[9,18,27,54,60,69,94,113,157],"recent":[10],"termination-analysis":[11],"algorithm.":[12,62,115],"Complementation":[13],"of":[14,97,135,146,173],"is":[17,93],"key":[19],"step":[20],"in":[21,125,171,179],"program":[22],"verification.":[23],"Early":[24],"constructions":[25,35,83],"using":[26],"Ramsey-based":[28,61,64,99,108,128],"argument":[29],"have":[30],"been":[31],"supplanted":[32],"by":[33],"rank-based":[34,161,175],"exponentially":[37],"better":[38],"bounds.":[39],"In":[40],"2001":[41],"Lee":[42],"et":[43],"al.":[44],"presented":[45,67],"the":[46,74,80,90,98,107,122,133,147,174],"size-change":[47],"termination":[48],"(SCT)":[49],"problem,":[50],"along":[51],"both":[53,151],"reduction":[55],"to":[56,73,111,159],"and":[59,155],"The":[63],"algorithm":[65,92],"was":[66],"as":[68],"more":[70],"practical":[71],"alternative":[72],"automata-theoretic":[75],"approach,":[76],"but":[77],"strongly":[78],"resembles":[79],"initial":[81],"complementation":[82,100,109],"automata.":[86],"prove":[88],"that":[89,120,150,168],"SCT":[91,136],"specialized":[95],"realization":[96],"construction.":[101],"To":[102],"do":[103],"so,":[104],"we":[105,141,166],"extend":[106],"construction":[110],"provide":[112],"containment-testing":[114],"Surprisingly,":[116],"empirical":[117,180],"analysis":[118,140],"suggests":[119],"despite":[121],"massive":[123],"gap":[124],"worst-case":[126],"complexity,":[127],"approaches":[129],"are":[130,177],"superior":[131],"over":[132],"domain":[134],"problems.":[137],"Upon":[138],"further":[139],"discover":[142],"an":[143],"interesting":[144],"property":[145],"problem":[148],"space":[149],"explains":[152],"this":[153],"result":[154],"provides":[156],"chance":[158],"improve":[160],"tools.":[162],"With":[163],"these":[164],"improvements,":[165],"show":[167],"theoretical":[169],"gains":[170],"efficiency":[172],"approach":[176],"mirrored":[178],"performance.":[181]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}