{"id":"https://openalex.org/W2036528253","doi":"https://doi.org/10.1016/s1571-0661(04)80479-1","title":"Classes of Timed Automata and the Undecidability of Universality","display_name":"Classes of Timed Automata and the Undecidability of Universality","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2036528253","doi":"https://doi.org/10.1016/s1571-0661(04)80479-1","mag":"2036528253"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80479-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80479-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80479-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111489343","display_name":"Arnaldo Vieira Moura","orcid":null},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Arnaldo V. Moura","raw_affiliation_strings":["Institute of Computing, University of Campinas, C.P. 6176, 13083-970, Campinas, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computing, University of Campinas, C.P. 6176, 13083-970, Campinas, SP, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080173312","display_name":"Guilherme A. Pinto","orcid":null},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Guilherme A. Pinto","raw_affiliation_strings":["Institute of Computing, University of Campinas, C.P. 6176, 13083-970, Campinas, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computing, University of Campinas, C.P. 6176, 13083-970, Campinas, SP, Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080173312","https://openalex.org/A5111489343"],"corresponding_institution_ids":["https://openalex.org/I181391015"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13027271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"65","issue":"6","first_page":"238","last_page":"253"},"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.9995999932289124,"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.9986000061035156,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7962988018989563},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.7649753093719482},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6675556302070618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5822041034698486},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.5589823126792908},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5448967218399048},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.4911744296550751},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.42761194705963135},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.41649484634399414},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.39368295669555664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3217180371284485},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.24657994508743286}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7962988018989563},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.7649753093719482},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6675556302070618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5822041034698486},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.5589823126792908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5448967218399048},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.4911744296550751},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.42761194705963135},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.41649484634399414},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.39368295669555664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3217180371284485},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.24657994508743286},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)80479-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80479-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80479-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80479-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1550659912","https://openalex.org/W1690546704","https://openalex.org/W1972203711","https://openalex.org/W1991712029","https://openalex.org/W1993678874","https://openalex.org/W2020658239","https://openalex.org/W2026134631","https://openalex.org/W2031592188","https://openalex.org/W2062879749","https://openalex.org/W2101508170","https://openalex.org/W2117832390","https://openalex.org/W2124788813","https://openalex.org/W2130773092","https://openalex.org/W6633069546","https://openalex.org/W6637714678"],"related_works":["https://openalex.org/W2901084331","https://openalex.org/W1526277826","https://openalex.org/W2066136688","https://openalex.org/W2048614185","https://openalex.org/W2912766821","https://openalex.org/W4205637466","https://openalex.org/W1791602674","https://openalex.org/W1978292968","https://openalex.org/W2089790483","https://openalex.org/W3099922764"],"abstract_inverted_index":{"Universality":[0],"for":[1,20,78],"deterministic":[2],"Timed":[3],"Automata":[4],"(TA)":[5],"is":[6,15,23,27,32,35,44,93,103,106,115],"PSPACE-complete":[7],"but":[8],"becomes":[9],"highly":[10],"undecidable":[11],"when":[12],"unrestricted":[13],"nondeterminism":[14],"allowed.":[16],"More":[17],"precisely,":[18],"universality":[19,76,91,102],"nondeterministic":[21,65,140],"TA":[22],"\u03a011-hard":[24],"and":[25,52,142],"it":[26,31],"still":[28],"open":[29],"whether":[30],"\u03c011-complete.":[33],"It":[34],"interesting":[36],"to":[37,64,70,95],"note":[38],"that":[39,111,125],"the":[40,75,81,90,99,107,112,118,127,133,144,147],"entire":[41],"arithmetical":[42],"hierarchy":[43],"contained":[45],"in":[46,117],"this":[47,55],"computability":[48],"gap":[49],"between":[50,146],"determinism":[51],"nondeterminism.":[53],"In":[54],"paper":[56],"we":[57],"consider":[58],"three":[59],"types":[60],"of":[61,74,87,132,135],"syntactical":[62],"restrictions":[63,128],"TA,":[66],"which":[67,85,105],"may":[68],"contribute":[69],"a":[71],"better":[72],"understanding":[73],"problem":[77,92,114],"TA.":[79],"For":[80,98],"first":[82],"two":[83],"types,":[84],"are":[86],"independent":[88],"interest,":[89],"shown":[94],"be":[96],"\u03a011-complete.":[97],"third":[100],"one,":[101],"\u03a010-complete,":[104],"same":[108],"as":[109],"saying":[110],"complementary":[113],"complete":[116],"recursively":[119],"enumerable":[120],"class.":[121],"We":[122],"also":[123],"show":[124],"all":[126],"define":[129],"proper":[130],"subclasses":[131],"class":[134],"timed":[136],"languages":[137],"defined":[138],"by":[139],"TA;":[141],"establish":[143],"relationships":[145],"classes.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}