{"abstract":[{"text":"We study the problem of generating paths on a graph that satisfy a collection of w-regular objectives. We propose a decoupled framework in which each objective is assigned to an independent agent that selects a local policy, while a scheduler—oblivious to the graph and objective—dynamically composes these policies into a single path. We ask when such a composition satisfies all objectives, assuming their conjunction is realizable. The framework enables modular policy design but raises fundamental compositional challenges. We show that even extremely fair deterministic schedulers do not ensure correctness, and that stochastic schedulers, while necessary, are insufficient without coordination. For safety objectives, we demonstrate that fully decentralized implementations are impossible, and we introduce a protocol for synchronizing on maximal safe actions. For non-safety objectives, we introduce conventions—simple, a priori restrictions agreed upon before the graph or objectives are revealed—that guarantee satisfaction of all objectives when followed by all agents. We characterize minimally restrictive conventions for major subclasses of w-regular objectives. In particular, Büchi objectives admit universal composition of finite-memory policies without scheduler communication; co-Büchi objectives require only knowledge of whether the agent was scheduled; and parity objectives additionally require knowledge of which agent was scheduled.","lang":"eng"}],"type":"conference","ddc":["000"],"department":[{"_id":"ToHe"}],"OA_type":"hybrid","page":"237-257","status":"public","researchdata_availability":"no","external_id":{"arxiv":["2605.13185"]},"title":"Decoupled planning for multiple omega-regular objectives","date_published":"2026-07-24T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","citation":{"mla":"Avni, Guy, et al. “Decoupled Planning for Multiple Omega-Regular Objectives.” <i>38th International Conference on Computer Aided Verification</i>, vol. 16682, Springer Nature, 2026, pp. 237–57, doi:<a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">10.1007/978-3-032-32519-8_13</a>.","short":"G. Avni, T.A. Henzinger, K. Mallik, S. Sadhukhan, K.S. Thejaswini, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 237–257.","chicago":"Avni, Guy, Thomas A Henzinger, Kaushik Mallik, Suman Sadhukhan, and K. S. Thejaswini. “Decoupled Planning for Multiple Omega-Regular Objectives.” In <i>38th International Conference on Computer Aided Verification</i>, 16682:237–57. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">https://doi.org/10.1007/978-3-032-32519-8_13</a>.","apa":"Avni, G., Henzinger, T. A., Mallik, K., Sadhukhan, S., &#38; Thejaswini, K. S. (2026). Decoupled planning for multiple omega-regular objectives. In <i>38th International Conference on Computer Aided Verification</i> (Vol. 16682, pp. 237–257). Lisbon, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">https://doi.org/10.1007/978-3-032-32519-8_13</a>","ista":"Avni G, Henzinger TA, Mallik K, Sadhukhan S, Thejaswini KS. 2026. Decoupled planning for multiple omega-regular objectives. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 16682, 237–257.","ieee":"G. Avni, T. A. Henzinger, K. Mallik, S. Sadhukhan, and K. S. Thejaswini, “Decoupled planning for multiple omega-regular objectives,” in <i>38th International Conference on Computer Aided Verification</i>, Lisbon, Portugal, 2026, vol. 16682, pp. 237–257.","ama":"Avni G, Henzinger TA, Mallik K, Sadhukhan S, Thejaswini KS. Decoupled planning for multiple omega-regular objectives. In: <i>38th International Conference on Computer Aided Verification</i>. Vol 16682. Springer Nature; 2026:237-257. doi:<a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">10.1007/978-3-032-32519-8_13</a>"},"author":[{"orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Kaushik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Sadhukhan, Suman","first_name":"Suman","last_name":"Sadhukhan"},{"last_name":"Thejaswini","first_name":"K. S.","full_name":"Thejaswini, K. S."}],"doi":"10.1007/978-3-032-32519-8_13","OA_place":"publisher","oa_version":"Published Version","publication_status":"published","oa":1,"supplementarymaterial":"no","file_date_updated":"2026-08-18T08:40:07Z","has_accepted_license":"1","acknowledgement":"This work is funded by the following grants: European Research Council under Grant No.: ERC-2020-AdG 101020093, ISF grant no. 1679/21, grant RYC2024-049116, MICIU/AEI/10.13039/501100011033, the ESF+, and Volkswagen Foundation within its Momentum framework under project no. 9C283.","publication":"38th International Conference on Computer Aided Verification","arxiv":1,"month":"07","quality_controlled":"1","volume":16682,"date_updated":"2026-08-18T08:41:44Z","year":"2026","date_created":"2026-08-16T22:01:44Z","conference":{"start_date":"2026-07-26","name":"CAV: Computer Aided Verification","location":"Lisbon, Portugal","end_date":"2026-07-29"},"file":[{"file_id":"22730","creator":"dernst","success":1,"date_updated":"2026-08-18T08:40:07Z","file_name":"2026_LNCS_Avni.pdf","content_type":"application/pdf","checksum":"f17ba3f82854fdb4eb69fd922965661a","access_level":"open_access","file_size":531980,"date_created":"2026-08-18T08:40:07Z","relation":"main_file"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"_id":"22719","intvolume":"     16682","day":"24","das_tickbox":"0","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783032325181"],"eissn":["1611-3349"]},"scopus_import":"1","alternative_title":["LNCS"],"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"article_processing_charge":"Yes (in subscription journal)"}