{"id":"https://openalex.org/W4230531028","doi":"https://doi.org/10.1109/lics.2004.1319628","title":"The existence of finite abstractions for branching time model checking","display_name":"The existence of finite abstractions for branching time model checking","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4230531028","doi":"https://doi.org/10.1109/lics.2004.1319628"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-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/A5111928766","display_name":"Dennis Dams","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. Dams","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, Inc., Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, Inc., Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031527903","display_name":"Kedar S. Namjoshi","orcid":"https://orcid.org/0000-0002-6379-2442"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K.S. Namjoshi","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, Inc., Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, Inc., Murray Hill, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111928766"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3943,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.96219131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"344"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9988999962806702,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7445914149284363},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6813662052154541},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.6523467302322388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6386598944664001},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5788411498069763},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5238521099090576},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4587531089782715},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4446165859699249},{"id":"https://openalex.org/keywords/abstract-data-type","display_name":"Abstract data type","score":0.4415862262248993},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.43367063999176025},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42964833974838257},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.41890907287597656},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.41875702142715454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.321584016084671},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31603750586509705},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2928071618080139},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24377501010894775}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7445914149284363},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6813662052154541},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.6523467302322388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6386598944664001},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5788411498069763},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5238521099090576},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4587531089782715},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4446165859699249},{"id":"https://openalex.org/C175971053","wikidata":"https://www.wikidata.org/wiki/Q827335","display_name":"Abstract data type","level":2,"score":0.4415862262248993},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.43367063999176025},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42964833974838257},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.41890907287597656},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.41875702142715454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.321584016084671},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31603750586509705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2928071618080139},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24377501010894775},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2004.1319628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W17866615","https://openalex.org/W42134522","https://openalex.org/W1487227309","https://openalex.org/W1503316778","https://openalex.org/W1515352270","https://openalex.org/W1527925700","https://openalex.org/W1547562281","https://openalex.org/W1555593767","https://openalex.org/W1572724214","https://openalex.org/W1573078772","https://openalex.org/W1585262231","https://openalex.org/W1593428110","https://openalex.org/W1606443439","https://openalex.org/W1612453857","https://openalex.org/W1933906947","https://openalex.org/W1975657455","https://openalex.org/W1978469611","https://openalex.org/W1988808695","https://openalex.org/W1990183105","https://openalex.org/W1991837261","https://openalex.org/W2009965218","https://openalex.org/W2023808162","https://openalex.org/W2027755003","https://openalex.org/W2043100293","https://openalex.org/W2068080096","https://openalex.org/W2073689993","https://openalex.org/W2090106217","https://openalex.org/W2096787192","https://openalex.org/W2108128207","https://openalex.org/W2108443473","https://openalex.org/W2124110813","https://openalex.org/W2129901741","https://openalex.org/W2148106163","https://openalex.org/W2160329712","https://openalex.org/W2162844904","https://openalex.org/W2170933628","https://openalex.org/W2535076018","https://openalex.org/W2575702446","https://openalex.org/W2580244263","https://openalex.org/W2986444891","https://openalex.org/W3148855524","https://openalex.org/W4237131304","https://openalex.org/W6601727344","https://openalex.org/W6630053826","https://openalex.org/W6631680044","https://openalex.org/W6633166790","https://openalex.org/W6634293682","https://openalex.org/W6635081798","https://openalex.org/W6636381079","https://openalex.org/W6676498727","https://openalex.org/W6684022658","https://openalex.org/W6793064532","https://openalex.org/W7017808848"],"related_works":["https://openalex.org/W278680301","https://openalex.org/W2030935018","https://openalex.org/W2140364234","https://openalex.org/W142178511","https://openalex.org/W2081955678","https://openalex.org/W1607121733","https://openalex.org/W2144996318","https://openalex.org/W2015573812","https://openalex.org/W2098792562","https://openalex.org/W1538854713"],"abstract_inverted_index":{"Abstraction":[0],"is":[1,25,50,59,96,112],"often":[2],"essential":[3],"to":[4,27,55,120],"verify":[5],"a":[6,12,28,36,53,90,99,113,121],"program":[7,15,33],"with":[8,16],"model":[9],"checking.":[10],"Typically,":[11],"concrete":[13],"source":[14],"an":[17,117],"infinite":[18],"(or":[19],"finite,":[20],"but":[21],"large)":[22],"state":[23,57,119],"space":[24],"reduced":[26],"small,":[29],"finite":[30,56],"state,":[31],"abstract":[32,118,126],"on":[34,98],"which":[35,95],"correctness":[37],"property":[38],"can":[39],"be":[40],"checked.":[41],"The":[42,106,147],"fundamental":[43,141],"question":[44],"we":[45],"investigate":[46],"in":[47,110,159],"this":[48,137],"paper":[49],"whether":[51],"such":[52,161],"reduction":[54],"programs":[58],"always":[60],"possible,":[61],"for":[62,79,134,143,156,176],"arbitrary":[63],"branching":[64],"time":[65],"temporal":[66],"properties.":[67,86,146],"We":[68,87],"begin":[69],"by":[70],"showing":[71],"that":[72],"existing":[73],"abstraction":[74,93],"frameworks":[75],"are":[76],"inherently":[77],"incomplete":[78],"verifying":[80],"purely":[81],"existential":[82],"or":[83],"mixed":[84],"universal-existential":[85],"then":[88],"propose":[89],"new,":[91],"complete":[92],"framework":[94],"based":[97],"class":[100],"of":[101,115,123],"focused":[102],"transition":[103],"systems":[104],"(FTS's).":[105],"key":[107],"new":[108],"feature":[109],"FTS's":[111],"way":[114],"\"focusing\"":[116],"set":[122],"more":[124],"precise":[125],"states.":[127],"While":[128],"focus":[129],"operators":[130],"have":[131],"been":[132],"defined":[133],"specific":[135],"contexts,":[136],"result":[138],"shows":[139],"their":[140,177],"usefulness":[142],"proving":[144],"non-universal":[145],"constructive":[148],"completeness":[149],"proof":[150],"provides":[151],"linear":[152],"size":[153,174],"maximal":[154],"models":[155],"properties":[157],"expressed":[158],"logics":[160],"as":[162],"CTL":[163],"and":[164],"the":[165],"mu-calculus.":[166],"This":[167],"substantially":[168],"improves":[169],"upon":[170],"known":[171],"(worst-case)":[172],"exponential":[173],"constructions":[175],"universal":[178],"fragments.":[179]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}