{"id":"https://openalex.org/W1964297656","doi":"https://doi.org/10.1145/1342991.1342994","title":"Alternating timed automata","display_name":"Alternating timed automata","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W1964297656","doi":"https://doi.org/10.1145/1342991.1342994","mag":"1964297656"},"language":"en","primary_location":{"id":"doi:10.1145/1342991.1342994","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1342991.1342994","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-00335734","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102789796","display_name":"S\u0142awomir Lasota","orcid":"https://orcid.org/0000-0001-8674-4470"},"institutions":[{"id":"https://openalex.org/I4210152232","display_name":"Institute of Informatics of the Slovak Academy of Sciences","ror":"https://ror.org/04jgqpc26","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210152232"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL","SK"],"is_corresponding":true,"raw_author_name":"Slawomir Lasota","raw_affiliation_strings":["Institute of Informatics, Warsaw University, Banacha, Warszawa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, Banacha, Warszawa","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210152232"]}]},{"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"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Igor Walukiewicz","raw_affiliation_strings":["LaBRI, Universit\u00e9 Bordeaux-1, Talence cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 Bordeaux-1, Talence cedex, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102789796"],"corresponding_institution_ids":["https://openalex.org/I4210152232","https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":9.1051,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.98034721,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"27"},"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.9987000226974487,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7921262979507446},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7044012546539307},{"id":"https://openalex.org/keywords/emptiness","display_name":"Emptiness","score":0.6961679458618164},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6738517880439758},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5541976094245911},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.5338597893714905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4727519452571869},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4629989266395569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4574505686759949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39604195952415466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20346200466156006}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7921262979507446},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7044012546539307},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.6961679458618164},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6738517880439758},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5541976094245911},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.5338597893714905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4727519452571869},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4629989266395569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4574505686759949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39604195952415466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20346200466156006},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/1342991.1342994","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1342991.1342994","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:CiteSeerX.psu:10.1.1.341.5560","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.5560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0512031v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.8104","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0512031v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.372.6636","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.372.6636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/33/57/34/PDF/igw-ata-tocl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.303","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mimuw.edu.pl/~sl/papers/fossacs05-full.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.687.5802","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.687.5802","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.labri.fr/perso/igw/Papers/igw-ata.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.2554","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.2554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mimuw.edu.pl/~sl/papers/fossacs05.ps.gz","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00335734v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00335734","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, 2008, 9 (2), pp.1-26. ⟨10.1145/1342991.1342994⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00335734v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00335734","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, 2008, 9 (2), pp.1-26. ⟨10.1145/1342991.1342994⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1487927110","https://openalex.org/W1524802289","https://openalex.org/W1560508321","https://openalex.org/W1561345922","https://openalex.org/W1582650717","https://openalex.org/W1584555738","https://openalex.org/W1589336320","https://openalex.org/W1596903331","https://openalex.org/W1606824214","https://openalex.org/W1710659396","https://openalex.org/W1750615905","https://openalex.org/W1775249002","https://openalex.org/W1967174286","https://openalex.org/W1987814265","https://openalex.org/W2017147035","https://openalex.org/W2025782239","https://openalex.org/W2025970201","https://openalex.org/W2076508310","https://openalex.org/W2083964867","https://openalex.org/W2101508170","https://openalex.org/W2123910665","https://openalex.org/W2148906857","https://openalex.org/W2151720555","https://openalex.org/W2561675875","https://openalex.org/W2567814587","https://openalex.org/W2903935047","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2618109676","https://openalex.org/W2765111002"],"abstract_inverted_index":{"A":[0],"notion":[1],"of":[2,30,50,86,103],"alternating":[3,55],"timed":[4,31,56,78],"automata":[5,13,57,79],"is":[6,9,34,61,95],"proposed.":[7],"It":[8],"shown":[10],"that":[11,33,47,93],"such":[12],"with":[14,58,80,89],"only":[15],"one":[16,59,81],"clock":[17,60],"have":[18],"decidable":[19],"emptiness":[20,52,94],"problem":[21,53,75],"over":[22],"finite":[23],"words.":[24],"This":[25],"gives":[26,66],"a":[27],"new":[28],"class":[29],"languages":[32],"closed":[35],"under":[36],"boolean":[37],"operations":[38],"and":[39,91],"which":[40],"has":[41],"an":[42],"effective":[43],"presentation.":[44],"We":[45,83],"prove":[46,92],"the":[48,51,68,73,87,104],"complexity":[49],"for":[54,72,76],"nonprimitive":[62],"recursive.":[63],"The":[64],"proof":[65],"also":[67],"same":[69],"lower":[70],"bound":[71],"universality":[74,105],"nondeterministic":[77],"clock.":[82],"investigate":[84],"extension":[85],"model":[88],"epsilon-transitions":[90],"undecidable.":[96],"Over":[97],"infinite":[98],"words,":[99],"we":[100],"show":[101],"undecidability":[102],"problem.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":9}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}