{"id":"https://openalex.org/W3098019215","doi":"https://doi.org/10.1007/s00224-023-10121-3","title":"Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete","display_name":"Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete","publication_year":2023,"publication_date":"2023-04-24","ids":{"openalex":"https://openalex.org/W3098019215","doi":"https://doi.org/10.1007/s00224-023-10121-3","mag":"3098019215"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-023-10121-3","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00224-023-10121-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10121-3.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10121-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079767975","display_name":"Stefan G\u00f6ller","orcid":"https://orcid.org/0000-0003-1747-1282"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan G\u00f6ller","raw_affiliation_strings":["University of Kassel School of Electrical Engineering and Computer Science, 34121, Kassel, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1747-1282","affiliations":[{"raw_affiliation_string":"University of Kassel School of Electrical Engineering and Computer Science, 34121, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052748901","display_name":"Mathieu Hilaire","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210104198","display_name":"Laboratoire Sp\u00e9cification et V\u00e9rification","ror":"https://ror.org/01kz1bj67","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Hilaire","raw_affiliation_strings":["Laboratoire Sp\u00e9cification et V\u00e9rification (LSV) ENS Paris-Saclay CNRS, Universit\u00e9 Paris-Saclay, 91190, Gif-sur-Yvette, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire Sp\u00e9cification et V\u00e9rification (LSV) ENS Paris-Saclay CNRS, Universit\u00e9 Paris-Saclay, 91190, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079767975"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.1929,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48523432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"68","issue":"4","first_page":"900","last_page":"985"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9966999888420105,"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.9962000250816345,"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.820659875869751},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.804273247718811},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7436537146568298},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6948026418685913},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6434614658355713},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.640340268611908},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6260467171669006},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5527210235595703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.496051162481308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4704115688800812},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.429830402135849},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4298154413700104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.343950480222702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3010818362236023},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.1867065727710724},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16687089204788208}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.820659875869751},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.804273247718811},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7436537146568298},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6948026418685913},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6434614658355713},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.640340268611908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6260467171669006},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5527210235595703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.496051162481308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4704115688800812},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.429830402135849},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4298154413700104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.343950480222702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3010818362236023},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.1867065727710724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16687089204788208},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00224-023-10121-3","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00224-023-10121-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10121-3.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2011.07091","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.07091","pdf_url":"https://arxiv.org/pdf/2011.07091","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":"pmh:oai:HAL:hal-04504864v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04504864","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":"Theory of Computing Systems, 2024, 68, pp.900-985. ⟨10.1007/s00224-023-10121-3⟩","raw_type":"Journal articles"},{"id":"doi:10.4230/lipics.stacs.2021.36","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2021.36","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00224-023-10121-3","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00224-023-10121-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10121-3.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1716121661","display_name":"Foundations of Stack-Based Automata","funder_award_id":"ANR-17-CE40-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6803667113","display_name":null,"funder_award_id":"ANR-17","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320327735","display_name":"Universit\u00e4t Kassel","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3098019215.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W203022780","https://openalex.org/W821240578","https://openalex.org/W1482481284","https://openalex.org/W1498432697","https://openalex.org/W1527197079","https://openalex.org/W1535681052","https://openalex.org/W1549337876","https://openalex.org/W1572777470","https://openalex.org/W1816633894","https://openalex.org/W1816892670","https://openalex.org/W1946664948","https://openalex.org/W2004542062","https://openalex.org/W2025782239","https://openalex.org/W2078894460","https://openalex.org/W2096289723","https://openalex.org/W2101508170","https://openalex.org/W2104952158","https://openalex.org/W2125463200","https://openalex.org/W2148775051","https://openalex.org/W2153439859","https://openalex.org/W2296504218","https://openalex.org/W2316282861","https://openalex.org/W2412054726","https://openalex.org/W2513871081","https://openalex.org/W2952248299","https://openalex.org/W2954656065","https://openalex.org/W2977475043","https://openalex.org/W4240781210","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W2099490078","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2765111002"],"abstract_inverted_index":{"Abstract":[0],"Parametric":[1],"timed":[2,17,51,123,370],"automata":[3,18,124,260,285,371],"(PTA)":[4],"have":[5],"been":[6],"introduced":[7],"by":[8,155],"Alur,":[9],"Henzinger,":[10],"and":[11,74,84,92,186,203,216,250,275,346],"Vardi":[12],"as":[13],"an":[14,35],"extension":[15],"of":[16,34,37,161,171,190,269,293,319,335,339,353,361,366],"in":[19,48,192,368],"which":[20],"clocks":[21,83,215,249,345,375],"can":[22,220],"be":[23,62],"compared":[24],"against":[25],"parameters.":[26],"The":[27,53],"reachability":[28,46,54,88,119,280,367],"problem":[29,55,89,120,281,365],"asks":[30],"for":[31,56,78,98,121,282],"the":[32,38,41,49,87,99,118,143,225,279,333,336,362],"existence":[33],"assignment":[36],"parameters":[39],"to":[40,61,196,200,253,273,295,308,314,326,357],"non-negative":[42],"integers":[43],"such":[44],"that":[45,77,117,208,305,310,351],"holds":[47],"underlying":[50],"automaton.":[52],"PTA":[57,79,211,245,341],"is":[58,90,116,128,140,206,312],"long":[59],"known":[60],"undecidable,":[63],"already":[64],"over":[65,80,212,246,261,342],"three":[66],"parametric":[67,82,214,248,258,283,344,369,374],"clocks.":[68],"A":[69,105,134,149,177,231],"few":[70],"years":[71],"ago,":[72],"Bundala":[73,274],"Ouaknine":[75],"proved":[76],"two":[81,213,247,343,373],"one":[85,126,217,219,251,262,287,347],"parameter":[86,127,218,252,263,317,338],"decidable":[91],"also":[93],"showed":[94],"a":[95,168,187,239,254,266,270,291,297,316,328,340],"lower":[96,152],"bound":[97,331],"complexity":[100,165],"class":[101],"P":[102,104,111,131,133,146,148,174,176,228,230],"S":[103,132,147,175,229],"C":[106,135,150,178,232],"E":[107,109,129,136,144,151,172,179,226,233],"N":[108],"X":[110,130,145,173,227],".":[112],"Our":[113,138],"main":[114],"result":[115],"two-parametric":[122],"with":[125,209,286,372],"-complete.":[137],"contribution":[139],"two-fold.":[141],"For":[142,224,277],"bound,":[153,235],"inspired":[154],"[13,":[156],"14],":[157],"we":[158,236,289],"make":[159],"use":[160],"deep":[162],"results":[163],"from":[164,244],"theory,":[166],"namely":[167],"serializability":[169,222],"characterization":[170],"(in":[180],"turn":[181],"based":[182,264],"on":[183,265,332],"Barrington\u2019s":[184],"Theorem)":[185],"logspace":[188],"translation":[189],"numbers":[191],"Chinese":[193],"remainder":[194],"representation":[195,198],"binary":[197],"due":[199,272],"Chiu,":[201],"Davida,":[202],"Litow.":[204],"It":[205],"shown":[207],"small":[210],"simulate":[221],"computations.":[223],"upper":[234,330],"first":[237],"give":[238],"careful":[240],"exponential":[241,320],"time":[242],"reduction":[243],"(slight":[255],"subclass":[256],"of)":[257],"one-counter":[259,284],"minor":[267],"adjustment":[268],"construction":[271],"Ouaknine.":[276],"solving":[278],"parameter,":[288],"provide":[290],"series":[292],"techniques":[294,355],"partition":[296],"fictitious":[298],"run":[299],"into":[300],"several":[301],"carefully":[302],"chosen":[303],"subruns":[304],"allow":[306],"us":[307,325],"prove":[309],"it":[311],"sufficient":[313],"consider":[315],"value":[318,334],"magnitude":[321],"only.":[322],"This":[323],"allows":[324],"show":[327],"doubly-exponential":[329],"only":[337],"parameter.":[348],"We":[349],"hope":[350],"extensions":[352],"our":[354],"lead":[356],"finally":[358],"establishing":[359],"decidability":[360,382],"long-standing":[363],"open":[364],"(and":[376],"arbitrarily":[377],"many":[378],"parameters)":[379],"and,":[380],"if":[381],"holds,":[383],"determinining":[384],"its":[385],"precise":[386],"computational":[387],"complexity.":[388]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2020-11-23T00:00:00"}