{"id":"https://openalex.org/W7163885780","doi":"https://doi.org/10.4230/lipics.swat.2026.12","title":"Strategy Repair in Reachability Games via a Graph Quotientation","display_name":"Strategy Repair in Reachability Games via a Graph Quotientation","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163885780","doi":"https://doi.org/10.4230/lipics.swat.2026.12"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26048","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.12/LIPIcs.SWAT.2026.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.12/LIPIcs.SWAT.2026.12.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031442426","display_name":"Tiziana Calamoneri","orcid":"https://orcid.org/0000-0002-4099-1836"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Calamoneri, Tiziana","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4099-1836","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5117632873","display_name":"Pierre Gaillard","orcid":"https://orcid.org/0000-0001-6777-6127"},"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"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["FR","IT"],"is_corresponding":false,"raw_author_name":"Gaillard, Pierre","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Italy","LaBRI, Universit\u00e9 de Bordeaux, France"],"raw_orcid":"https://orcid.org/0009-0009-7054-6360","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"LaBRI, Universit\u00e9 de Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054949871","display_name":"Giacomo Paesani","orcid":"https://orcid.org/0000-0002-2383-1339"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paesani, Giacomo","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-2383-1339","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066350298","display_name":"Giuseppe Perelli","orcid":"https://orcid.org/0000-0002-8687-6323"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Perelli, Giuseppe","raw_affiliation_strings":["Department of Mathematics, Sapienza University of Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8687-6323","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93482679,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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.5697000026702881,"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.5697000026702881,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.09629999846220016,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.08720000088214874,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8564000129699707},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.515999972820282},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.49079999327659607},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.4867999851703644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44190001487731934},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.2888000011444092},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.2721000015735626}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8564000129699707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6718000173568726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5184000134468079},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.515999972820282},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.49079999327659607},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.4867999851703644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44190001487731934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.266400009393692},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26048","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.12/LIPIcs.SWAT.2026.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:iris.uniroma1.it:11573/1769577","is_oa":false,"landing_page_url":"https://hdl.handle.net/11573/1769577","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.4230/lipics.swat.2026.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.12","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":"pmh:oai:drops-oai.dagstuhl.de:26048","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.12/LIPIcs.SWAT.2026.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163885780.pdf","grobid_xml":"https://content.openalex.org/works/W7163885780.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Reachability":[0],"Games":[1],"over":[2,277],"graphs":[3],"(RGs)":[4],"are":[5,18,21,209],"a":[6,38,44,63,69,172,193,229],"powerful":[7],"modelling":[8],"tool":[9],"for":[10,259],"synthesis":[11],"and":[12,113,161,204],"planning.":[13],"The":[14,238],"solutions":[15],"to":[16,28,46,55,92,121,131,184,202,217,274],"RGs":[17],"strategies":[19,61],"that":[20,77,178,199,208],"used":[22],"in":[23,135,228],"program":[24],"design.":[25],"Sometimes,":[26],"due":[27],"model":[29],"deviation":[30],"at":[31],"execution":[32],"time,":[33],"specification":[34],"updates,":[35],"or":[36],"simply":[37],"bug,":[39],"the":[40,75,83,97,103,133,142,150,164,186,212,218,235,243,250,260,263,278],"strategy":[41,99],"provided":[42,98],"as":[43,94,100],"solution":[45,216],"an":[47,139,144,254],"RG":[48],"no":[49],"longer":[50],"works.":[51],"Strategy":[52,105,176,223],"Repair":[53,106,177,224],"aims":[54],"solve":[56],"this":[57],"problem":[58,134],"by":[59,74,191,271],"adjusting":[60],"with":[62],"minimum":[64],"number":[65],"of":[66,96,153,166,175,196,214,252],"modifications.":[67],"Such":[68],"minimisation":[70],"requirement":[71],"is":[72],"motivated":[73],"costs":[76],"one":[78,90,137],"may":[79],"incur":[80],"when":[81],"implementing":[82],"new":[84,194],"strategy.":[85],"To":[86],"minimise":[87],"implementation":[88],"costs,":[89],"wants":[91],"reuse":[93],"much":[95],"possible.":[101],"In":[102],"literature,":[104],"has":[107,118],"been":[108,119,129],"investigated":[109],"from":[110,211],"both":[111],"theoretical":[112,264],"practical":[114],"perspectives.":[115],"First,":[116],"it":[117],"shown":[120],"be":[122,226],"NP-complete.":[123],"Second,":[124],"two":[125],"algorithmic":[126,182],"approaches":[127,148],"have":[128],"proposed":[130],"tackle":[132],"practice,":[136],"provides":[138,171],"optimal":[140],"solution,":[141],"other":[143],"approximated":[145],"solution.":[146],"Both":[147],"underutilise":[149],"graph-theoretical":[151],"properties":[152],"games,":[154],"which":[155,232],"could":[156],"significantly":[157],"improve":[158],"their":[159],"performance":[160],"accuracy":[162],"(in":[163],"case":[165],"approximation":[167],"algorithms).":[168],"This":[169,220],"paper":[170],"graph-theoretic":[173],"characterisation":[174],"provably":[179],"improves":[180,249],"every":[181,215],"approach":[183,239,269],"solving":[185,222],"problem.":[187,219,261],"It":[188],"does":[189],"so":[190],"introducing":[192],"notion":[195],"quotient":[197,236,279],"graph":[198,280],"allows":[200],"us":[201],"identify":[203],"merge":[205],"those":[206],"vertices":[207],"equivalent":[210],"perspective":[213],"way,":[221],"can":[225],"done":[227],"reduced":[230],"instance,":[231],"we":[233,266],"call":[234],"game.":[237],"not":[240],"only":[241],"reduces":[242],"problem\u2019s":[244],"input":[245],"size,":[246],"but":[247],"also":[248],"effectiveness":[251],"MustFix,":[253],"optimisation":[255],"condition":[256],"previously":[257],"introduced":[258],"Besides":[262],"characterisation,":[265],"test":[267],"our":[268],"empirically":[270],"running":[272],"experiments":[273],"demonstrate":[275],"improvements":[276],"approach.":[281]},"counts_by_year":[],"updated_date":"2026-06-12T08:23:45.883708","created_date":"2026-06-09T00:00:00"}