{"type":"conference","date_updated":"2023-09-20T09:04:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"department":[{"_id":"KrCh"}],"oa_version":"Published Version","doi":"10.1007/978-3-031-37709-9_5","ec_funded":1,"acknowledgement":"This work was supported in part by the ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 as well as DST/CEFIPRA/INRIA project EQuaVE and SERB Matrices grant MTR/2018/00074.","file_date_updated":"2023-09-20T08:46:43Z","file":[{"checksum":"f143c8eedf609f20f2aad2eeb496d53f","file_name":"2023_LNCS_Akshay.pdf","relation":"main_file","file_id":"14349","content_type":"application/pdf","file_size":531745,"creator":"dernst","access_level":"open_access","success":1,"date_updated":"2023-09-20T08:46:43Z","date_created":"2023-09-20T08:46:43Z"}],"_id":"14317","status":"public","conference":{"name":"CAV: Computer Aided Verification","start_date":"2023-07-17","end_date":"2023-07-22","location":"Paris, France"},"publisher":"Springer Nature","alternative_title":["LNCS"],"publication_status":"published","date_created":"2023-09-10T22:01:12Z","month":"07","publication":"International Conference on Computer Aided Verification","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377082"],"eissn":["1611-3349"]},"ddc":["000"],"citation":{"ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2023. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.","mla":"Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5.","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 86–112.","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_5","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: International Conference on Computer Aided Verification. Vol 13966. Springer Nature; 2023:86-112. doi:10.1007/978-3-031-37709-9_5","chicago":"Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_5.","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112."},"intvolume":" 13966","title":"MDPs as distribution transformers: Affine invariant synthesis for safety objectives","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","volume":13966,"date_published":"2023-07-17T00:00:00Z","quality_controlled":"1","year":"2023","abstract":[{"text":"Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.\r\nIn light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples.","lang":"eng"}],"oa":1,"page":"86-112","author":[{"full_name":"Akshay, S.","first_name":"S.","last_name":"Akshay"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","first_name":"Tobias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","first_name":"Dorde"}],"day":"17","language":[{"iso":"eng"}]}