{"id":"https://openalex.org/W2951114619","doi":"https://doi.org/10.1109/lics.2017.8005098","title":"Revisiting reachability in timed automata","display_name":"Revisiting reachability in timed automata","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2951114619","doi":"https://doi.org/10.1109/lics.2017.8005098","mag":"2951114619"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1702.03450","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066136949","display_name":"Karin Quaas","orcid":null},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karin Quaas","raw_affiliation_strings":["Universitat Leipzig, Germany","Universit\u00e4t Leipzig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Leipzig, Germany","institution_ids":["https://openalex.org/I926574661"]},{"raw_affiliation_string":"Universit\u00e4t Leipzig, Germany","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005502598","display_name":"Mahsa Shirmohammadi","orcid":"https://orcid.org/0000-0002-7779-2339"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mahsa Shirmohammadi","raw_affiliation_strings":["University of Oxford, UK","Univ. of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Univ. of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068165188","display_name":"James Worrell","orcid":"https://orcid.org/0000-0001-8151-2443"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James Worrell","raw_affiliation_strings":["University of Oxford, UK","Univ. of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Univ. of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6873,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74490854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9937999844551086,"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/reachability","display_name":"Reachability","score":0.9342229962348938},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6324003338813782},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5938050150871277},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.5539829730987549},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5394867062568665},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5232771039009094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47955963015556335},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.4784243702888489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4644249975681305},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32874178886413574}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9342229962348938},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6324003338813782},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5938050150871277},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.5539829730987549},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5394867062568665},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5232771039009094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47955963015556335},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.4784243702888489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4644249975681305},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32874178886413574},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/lics.2017.8005098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1702.03450","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.03450","pdf_url":"https://arxiv.org/pdf/1702.03450","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2951114619","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1702.03450","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-02411539v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02411539","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":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-12, ⟨10.1109/LICS.2017.8005098⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:c761bf36-6ced-4ffa-91b7-a4bc146c4c97","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference item"},{"id":"doi:10.48550/arxiv.1702.03450","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.03450","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1702.03450","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.03450","pdf_url":"https://arxiv.org/pdf/1702.03450","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1913145437","display_name":null,"funder_award_id":"QU 316/1-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2704700155","display_name":null,"funder_award_id":"EP/N008197/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4014780712","display_name":null,"funder_award_id":"EP/M003795/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4266278604","display_name":null,"funder_award_id":"EP/M012298/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4704183438","display_name":"EPSRC-Royal Society fellowship engagement (2013): Probabilistic Termination","funder_award_id":"EP/M003795/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7221380192","display_name":"Counter Automata: Verification and Synthesis","funder_award_id":"EP/M012298/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2951114619.pdf","grobid_xml":"https://content.openalex.org/works/W2951114619.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1487351738","https://openalex.org/W1529107813","https://openalex.org/W1544206522","https://openalex.org/W1589336320","https://openalex.org/W1595006413","https://openalex.org/W1835325438","https://openalex.org/W1930660098","https://openalex.org/W1981808971","https://openalex.org/W2021592352","https://openalex.org/W2035496804","https://openalex.org/W2065939997","https://openalex.org/W2088028681","https://openalex.org/W2101508170","https://openalex.org/W2104715607","https://openalex.org/W2128090891","https://openalex.org/W2150220388","https://openalex.org/W2155953212","https://openalex.org/W2164502223","https://openalex.org/W2913459036","https://openalex.org/W3023485956","https://openalex.org/W4205256996","https://openalex.org/W6684205093"],"related_works":["https://openalex.org/W2981343893","https://openalex.org/W15609906","https://openalex.org/W1880998670","https://openalex.org/W1717955622","https://openalex.org/W3138503800","https://openalex.org/W2118964795","https://openalex.org/W1671650870","https://openalex.org/W419990173","https://openalex.org/W2963883639","https://openalex.org/W2088028681","https://openalex.org/W59289768","https://openalex.org/W3103084107","https://openalex.org/W2515014082","https://openalex.org/W2796990656","https://openalex.org/W2399240136","https://openalex.org/W1989746243","https://openalex.org/W3202559201","https://openalex.org/W96196053","https://openalex.org/W2058346101","https://openalex.org/W2188682159"],"abstract_inverted_index":{"We":[0],"revisit":[1],"a":[2,17,36],"fundamental":[3],"result":[4],"in":[5,23],"real-time":[6],"verification,":[7],"namely":[8],"that":[9,80],"the":[10,27,46,69,73,81],"binary":[11],"reachability":[12,48,70],"relation":[13],"between":[14],"configurations":[15],"of":[16,41,50,72],"given":[18],"timed":[19,51],"automaton":[20],"is":[21,84],"definable":[22],"linear":[24],"arithmetic":[25],"over":[26],"integers":[28],"and":[29,38],"reals.":[30],"In":[31],"this":[32,42,58],"paper":[33],"we":[34,61,78],"give":[35,62],"new":[37,59],"simpler":[39],"proof":[40],"result,":[43],"building":[44],"on":[45],"well-known":[47],"analysis":[49],"automata":[52],"involving":[53],"difference":[54],"bound":[55],"matrices.":[56],"Using":[57],"proof,":[60],"an":[63],"exponential-space":[64],"procedure":[65],"for":[66],"model":[67],"checking":[68],"fragment":[71],"logic":[74],"parametric":[75],"TCTL.":[76],"Finally":[77],"show":[79],"latter":[82],"problem":[83],"NEXPTIME-hard.":[85]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}