{"id":"https://openalex.org/W1930660098","doi":"https://doi.org/10.1109/lics.2002.1029827","title":"Computing reachability relations in timed automata","display_name":"Computing reachability relations in timed automata","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1930660098","doi":"https://doi.org/10.1109/lics.2002.1029827","mag":"1930660098"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2002.1029827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"preprint","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/A5069463747","display_name":"C\u0103t\u0103lin Dima","orcid":"https://orcid.org/0000-0001-5981-4533"},"institutions":[{"id":"https://openalex.org/I4210156361","display_name":"Verimag","ror":"https://ror.org/05afmzm11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210156361","https://openalex.org/I4210159245","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C. Dima","raw_affiliation_strings":["Verimag, Gieres, France"],"affiliations":[{"raw_affiliation_string":"Verimag, Gieres, France","institution_ids":["https://openalex.org/I4210156361"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069463747"],"corresponding_institution_ids":["https://openalex.org/I4210156361"],"apc_list":null,"apc_paid":null,"fwci":2.1995,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.87012497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1494","issue":null,"first_page":"177","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9987000226974487,"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/T11567","display_name":"semigroups and automata theory","score":0.9970999956130981,"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/reachability","display_name":"Reachability","score":0.927274227142334},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7408987283706665},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.7150751352310181},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.659662127494812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6179060339927673},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5981143712997437},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5060381293296814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4841664433479309},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.43694931268692017},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.43216896057128906},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3684314489364624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3430876135826111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29136961698532104},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2209967076778412}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.927274227142334},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7408987283706665},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.7150751352310181},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.659662127494812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179060339927673},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5981143712997437},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5060381293296814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4841664433479309},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.43694931268692017},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.43216896057128906},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3684314489364624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3430876135826111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29136961698532104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2209967076778412},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2002.1029827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01699968v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01699968","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, 2002, Unknown, Unknown Region. pp.177, ⟨10.1109/LICS.2002.1029827⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1499407607","https://openalex.org/W1536181004","https://openalex.org/W1552159734","https://openalex.org/W1553142094","https://openalex.org/W1560730347","https://openalex.org/W1563348382","https://openalex.org/W1805265119","https://openalex.org/W2000827368","https://openalex.org/W2002089154","https://openalex.org/W2101508170","https://openalex.org/W2116391427","https://openalex.org/W2130182605","https://openalex.org/W2163152086","https://openalex.org/W2164502223","https://openalex.org/W2341171179","https://openalex.org/W2536189274","https://openalex.org/W4298290503","https://openalex.org/W4302339081","https://openalex.org/W6629743932","https://openalex.org/W6632147542","https://openalex.org/W6633571134","https://openalex.org/W6650569686","https://openalex.org/W6677600507"],"related_works":["https://openalex.org/W2963892764","https://openalex.org/W1750171350","https://openalex.org/W243230860","https://openalex.org/W2141548906","https://openalex.org/W1544759682","https://openalex.org/W1582075212","https://openalex.org/W1524267824","https://openalex.org/W2250083056","https://openalex.org/W2518832034","https://openalex.org/W1973077904"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"algorithmic":[3],"calculus":[4],"of":[5,30,61,64],"the":[6,45,54,62],"reachability":[7,68],"relations":[8,43,69],"on":[9],"clock":[10],"values":[11],"defined":[12],"by":[13,22],"timed":[14,71],"automata.":[15,72],"Our":[16],"approach":[17],"is":[18,36,51],"a":[19,37],"modular":[20],"one,":[21],"computing":[23],"unions,":[24],"compositions":[25],"and":[26,48,59],"reflexive-transitive":[27],"closure":[28,55],"(star)":[29],"\"atomic\"":[31],"relations.":[32],"The":[33],"essential":[34],"tool":[35],"new":[38],"representation":[39],"technique":[40],"for":[41],"n-clock":[42],"-":[44,47],"2n-automata":[46,65],"our":[49],"strategy":[50],"to":[52],"show":[53],"under":[56],"union,":[57],"composition":[58],"star":[60],"class":[63],"that":[66],"represent":[67],"in":[70]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}