{"id":"https://openalex.org/W3010307732","doi":"https://doi.org/10.1145/3372310","title":"Why Liveness for Timed Automata Is Hard, and What We Can Do About It","display_name":"Why Liveness for Timed Automata Is Hard, and What We Can Do About It","publication_year":2020,"publication_date":"2020-03-03","ids":{"openalex":"https://openalex.org/W3010307732","doi":"https://doi.org/10.1145/3372310","mag":"3010307732"},"language":"en","primary_location":{"id":"doi:10.1145/3372310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3372310","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03023737","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011012804","display_name":"Fr\u00e9d\u00e9ric Herbreteau","orcid":"https://orcid.org/0000-0002-1029-2356"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fr\u00e9d\u00e9ric Herbreteau","raw_affiliation_strings":["Universit\u00e9 de Bordeaux and UMI 2000 ReLaX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Bordeaux and UMI 2000 ReLaX","institution_ids":["https://openalex.org/I15057530"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047476786","display_name":"B. Srivathsan","orcid":"https://orcid.org/0000-0003-2666-0691"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. Srivathsan","raw_affiliation_strings":["Chennai Mathematical Institute and UMI 2000 ReLaX"],"raw_orcid":"https://orcid.org/0000-0003-2666-0691","affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute and UMI 2000 ReLaX","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046959894","display_name":"Thanh-Tung Tran","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thanh-Tung Tran","raw_affiliation_strings":["International University--Vietnam National University, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International University--Vietnam National University, Viet Nam","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064757019","display_name":"Igor Walukiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Igor Walukiewicz","raw_affiliation_strings":["Universit\u00e9 de Bordeaux and UMI 2000 ReLaX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Bordeaux and UMI 2000 ReLaX","institution_ids":["https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011012804"],"corresponding_institution_ids":["https://openalex.org/I15057530"],"apc_list":null,"apc_paid":null,"fwci":1.3118,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.84557181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"3","first_page":"1","last_page":"28"},"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/T11567","display_name":"semigroups and automata theory","score":0.9968000054359436,"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.995199978351593,"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/liveness","display_name":"Liveness","score":0.9811252355575562},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.733532190322876},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7180641293525696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6310293674468994},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6008879542350769},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5249295830726624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.425919771194458},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.42543643712997437},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3429586887359619},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33475083112716675}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.9811252355575562},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.733532190322876},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7180641293525696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6310293674468994},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6008879542350769},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5249295830726624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.425919771194458},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.42543643712997437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3429586887359619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33475083112716675},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3372310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3372310","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03023737v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03023737","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 2020, ⟨10.1145/3372310⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03023737v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03023737","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 2020, ⟨10.1145/3372310⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313903","display_name":"Tata Consultancy Services","ror":"https://ror.org/01b9n8m42"},{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320322753","display_name":"Infosys Foundation","ror":"https://ror.org/03bs18y54"},{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1505030820","https://openalex.org/W1863919967","https://openalex.org/W2101508170","https://openalex.org/W2133057837","https://openalex.org/W2162181585","https://openalex.org/W2561675875","https://openalex.org/W2624809536","https://openalex.org/W2962719417"],"related_works":["https://openalex.org/W4312626387","https://openalex.org/W2103504376","https://openalex.org/W2153337086","https://openalex.org/W2135051863","https://openalex.org/W1651168384","https://openalex.org/W2951439219","https://openalex.org/W1565729639","https://openalex.org/W1750615905","https://openalex.org/W3010307732","https://openalex.org/W1606006280"],"abstract_inverted_index":{"The":[0],"reachability":[1,64,79],"problem":[2,22,58,80,92],"for":[3,75,104,115,130],"timed":[4,120],"automata":[5,74],"asks":[6,23],"if":[7,24,51],"a":[8,12,71,110,113,119,123,133],"given":[9],"automaton":[10,26,121],"has":[11,27],"run":[13,30],"leading":[14],"to":[15,43,100,138],"an":[16,28,128],"accepting":[17,33],"state,":[18],"and":[19,135],"the":[20,25,56,63,78,82,90,102,105,116],"liveness":[21,57,91,106,124],"infinite":[29],"that":[31,50,118],"visits":[32],"states":[34],"infinitely":[35],"often.":[36],"Both":[37],"of":[38,73,112],"these":[39],"problems":[40],"are":[41],"known":[42],"be":[44],"P":[45,52,87,94],"space":[46,54,95],"-complete.":[47],"We":[48,108,126],"show":[49],"\u2260P":[53],",":[55],"is":[59,85,93],"more":[60],"difficult":[61],"than":[62],"problem;":[65],"in":[66,86],"other":[67],"words,":[68],"we":[69],"exhibit":[70],"family":[72],"which":[76],"solving":[77,89],"with":[81],"standard":[83],"algorithm":[84,129],"but":[88],"-hard.":[96],"This":[97],"leads":[98],"us":[99],"revisit":[101],"algorithmics":[103],"problem.":[107],"propose":[109],"notion":[111],"witness":[114,134],"fact":[117],"violates":[122],"property.":[125],"give":[127],"computing":[131],"such":[132],"compare":[136],"it":[137],"existing":[139],"solutions.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}