{"id":"https://openalex.org/W7166736083","doi":"https://doi.org/10.48550/arxiv.2606.28773","title":"Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games","display_name":"Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games","publication_year":2026,"publication_date":"2026-06-27","ids":{"openalex":"https://openalex.org/W7166736083","doi":"https://doi.org/10.48550/arxiv.2606.28773"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.28773","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28773","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.28773","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019307337","display_name":"Nathalie Bertrand","orcid":"https://orcid.org/0000-0002-9957-5394"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bertrand, Nathalie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120499138","display_name":"Ma\u00eblle Gautrin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gautrin, Ma\u00eblle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5059085094","display_name":"Julie Parreaux","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parreaux, Julie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8385000228881836,"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.8385000228881836,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.026599999517202377,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0215000007301569,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/decidability","display_name":"Decidability","score":0.8788999915122986},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8503999710083008},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7603999972343445},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5860999822616577},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.43959999084472656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.364300012588501},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.3224000036716461},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3212999999523163},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.3208000063896179}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8788999915122986},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8503999710083008},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7603999972343445},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5860999822616577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5604000091552734},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.43959999084472656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4221000075340271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41130000352859497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38960000872612},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3682999908924103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3138999938964844},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.30059999227523804},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.28773","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28773","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":"doi:10.48550/arxiv.2606.28773","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28773","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"value":[1,14,28,123],"problem":[2,29,124],"for":[3,22,30,63,98,125],"2-player":[4],"games":[5,36,78],"on":[6,53],"graph":[7],"generally":[8],"consists":[9],"in":[10,33,57,67,90],"determining":[11],"the":[12,27,68,99,110,118,121],"minimal":[13],"Min":[15],"can":[16],"ensure":[17],"against":[18],"any":[19],"possible":[20],"strategy":[21],"Max.":[23],"We":[24],"consider":[25],"here":[26],"reachability":[31],"objectives":[32],"weighted":[34,76],"timed":[35,77],"(WTGs)":[37],"under":[38],"a":[39,44,84],"robust":[40,105,122],"semantics.":[41],"WTGs":[42],"are":[43,88],"modelling":[45],"formalism":[46],"combining":[47],"real-time":[48],"constraints":[49],"and":[50,55,72,92,116],"integer":[51],"weights":[52],"transitions":[54],"locations":[56],"an":[58],"adversarial":[59],"setting.":[60],"Robustness":[61],"allows":[62],"representing":[64],"timing":[65],"imprecisions":[66],"measurement":[69],"of":[70,101,112,120],"delays":[71],"clock":[73],"values.":[74],"Robust":[75],"have":[79],"been":[80],"introduced":[81],"more":[82],"than":[83],"decade":[85],"ago:":[86],"they":[87],"undecidable":[89],"general,":[91],"were":[93],"quite":[94],"recently":[95],"shown":[96],"decidable":[97,114],"subclasses":[100,115],"acyclic":[102],"or":[103],"divergent":[104],"WTGs.":[106,127],"This":[107],"paper":[108],"pursues":[109],"goal":[111],"identifying":[113],"establishes":[117],"decidability":[119],"1-clock":[126]},"counts_by_year":[],"updated_date":"2026-07-01T06:29:00.853634","created_date":"2026-07-01T00:00:00"}