[{"page":"489-507","date_created":"2023-06-18T22:00:46Z","doi":"10.1007/978-3-031-30823-9_25","date_published":"2023-04-22T00:00:00Z","year":"2023","has_accepted_license":"1","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","day":"22","oa":1,"publisher":"Springer Nature","quality_controlled":"1","article_processing_charge":"No","external_id":{"arxiv":["2301.08137"]},"author":[{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer"}],"title":"Correct approximation of stationary distributions","citation":{"mla":"Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.” TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13993, Springer Nature, 2023, pp. 489–507, doi:10.1007/978-3-031-30823-9_25.","ieee":"T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.","short":"T. Meggendorfer, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 489–507.","apa":"Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_25","ama":"Meggendorfer T. Correct approximation of stationary distributions. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13993. Springer Nature; 2023:489-507. doi:10.1007/978-3-031-30823-9_25","chicago":"Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.” In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13993:489–507. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_25.","ista":"Meggendorfer T. 2023. Correct approximation of stationary distributions. TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 489–507."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"14990","relation":"research_data"}]},"volume":13993,"publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308222"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"13148","checksum":"59f707a3949c03793251b0d04c62542a","success":1,"creator":"dernst","date_updated":"2023-06-19T07:18:40Z","file_size":521951,"date_created":"2023-06-19T07:18:40Z","file_name":"2023_LNCS_Meggendorfer.pdf"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 13993","month":"04","abstract":[{"text":"A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to large instances, and iterative solutions are desirable. It turns out that a naive approach, as used by current model checkers, may yield completely wrong results. We present a new approach, which utilizes recent advances in partial exploration and mean payoff computation to obtain a correct, converging approximation.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2023-06-19T07:18:40Z","department":[{"_id":"KrCh"}],"date_updated":"2024-02-27T07:19:33Z","ddc":["000"],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Paris, France","end_date":"2023-04-27","start_date":"2023-04-22"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","_id":"13139"},{"citation":{"ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.","short":"T. Meggendorfer, (2023).","ama":"Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:10.5281/ZENODO.7548214","apa":"Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. https://doi.org/10.5281/ZENODO.7548214","mla":"Meggendorfer, Tobias. Artefact for: Correct Approximation of Stationary Distributions. Zenodo, 2023, doi:10.5281/ZENODO.7548214.","ista":"Meggendorfer T. 2023. Artefact for: Correct Approximation of Stationary Distributions, Zenodo, 10.5281/ZENODO.7548214.","chicago":"Meggendorfer, Tobias. “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.7548214."},"date_updated":"2024-02-27T07:19:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"title":"Artefact for: Correct Approximation of Stationary Distributions","_id":"14990","type":"research_data_reference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","has_accepted_license":"1","year":"2023","day":"18","date_published":"2023-01-18T00:00:00Z","related_material":{"record":[{"id":"13139","status":"public","relation":"used_in_publication"}]},"doi":"10.5281/ZENODO.7548214","date_created":"2024-02-14T14:27:06Z","abstract":[{"text":"The software artefact to evaluate the approximation of stationary distributions implementation.","lang":"eng"}],"oa_version":"Published Version","publisher":"Zenodo","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"oa":1,"month":"01"},{"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.01456","open_access":"1"}],"quality_controlled":"1","month":"12","abstract":[{"text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.","lang":"eng"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","oa_version":"Preprint","ec_funded":1,"date_created":"2024-02-25T09:23:24Z","date_published":"2023-12-15T00:00:00Z","year":"2023","publication_status":"epub_ahead","language":[{"iso":"eng"}],"publication":"37th Conference on Neural Information Processing Systems","day":"15","conference":{"start_date":"2023-12-10","location":"New Orleans, LO, United States","end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems"},"type":"conference","status":"public","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"_id":"15023","article_processing_charge":"No","external_id":{"arxiv":["2312.01456"]},"author":[{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"last_name":"Verma","full_name":"Verma, Abhinav","first_name":"Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Compositional policy learning in stochastic control systems with formal guarantees","citation":{"mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” 37th Conference on Neural Information Processing Systems, 2023.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: 37th Conference on Neural Information Processing Systems. ; 2023.","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., & Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In 37th Conference on Neural Information Processing Systems, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems."},"date_updated":"2024-02-28T12:20:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"article_number":"29","title":"Algorithms and hardness results for computing cores of Markov chains","article_processing_charge":"No","author":[{"full_name":"Ahmadi, Ali","last_name":"Ahmadi","first_name":"Ali"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer"},{"full_name":"Safavi Hemami, Roodabeh","last_name":"Safavi Hemami","id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","first_name":"Roodabeh"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde","last_name":"Zikelic"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29","apa":"Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29","ieee":"A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.","short":"A. Ahmadi, K. Chatterjee, A.K. Goharshady, T. Meggendorfer, R. Safavi Hemami, D. Zikelic, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29.","ista":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.","chicago":"Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"The research was partially supported by the Hong Kong Research Grants Council ECS\r\nProject No. 26208122, ERC CoG 863818 (FoRM-SMArt), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, HKUST– Kaisa Joint Research Institute Project Grant HKJRI3A-055 and HKUST Startup Grant R9272. Ali Ahmadi and Roodabeh Safavi were interns at HKUST.","date_created":"2023-01-01T23:00:50Z","date_published":"2022-12-14T00:00:00Z","doi":"10.4230/LIPIcs.FSTTCS.2022.29","publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","day":"14","year":"2022","has_accepted_license":"1","status":"public","conference":{"name":"FSTTC: Foundations of Software Technology and Theoretical Computer Science","start_date":"2022-12-18","end_date":"2022-12-20","location":"Madras, India"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"12102","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"file_date_updated":"2023-01-20T10:39:44Z","ddc":["000"],"date_updated":"2023-02-07T09:19:43Z","intvolume":" 250","month":"12","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset."}],"ec_funded":1,"volume":250,"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"6660c802489013f034c9e8bd57f4d46e","file_id":"12324","success":1,"creator":"dernst","date_updated":"2023-01-20T10:39:44Z","file_size":872534,"date_created":"2023-01-20T10:39:44Z","file_name":"2022_LIPICs_Ahmadi.pdf"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772617"]}},{"title":"Complexity of spatial games","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"last_name":"Jecker","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","last_name":"Svoboda","full_name":"Svoboda, Jakub"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.11","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.","ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11."},"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"article_number":"11:1-11:14","doi":"10.4230/LIPIcs.FSTTCS.2022.11","date_published":"2022-12-14T00:00:00Z","date_created":"2023-01-01T23:00:50Z","day":"14","publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","has_accepted_license":"1","year":"2022","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the ERC CoG 863818\r\n(ForM-SMArt).\r\nIsmaël Jecker: The research was partially supported by the ERC grant 950398 (INFSYS).\r\nJakub Svoboda: The research was partially supported by the ERC CoG 863818 (ForM-SMArt)","file_date_updated":"2023-01-20T10:19:19Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-02-13T09:06:43Z","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"FSTTC: Foundations of Software Technology and Theoretical Computer Science","start_date":"2022-12-18","location":"Madras, India","end_date":"2022-12-20"},"_id":"12101","volume":250,"ec_funded":1,"file":[{"success":1,"checksum":"a21e3ba2421e2c4a06aa2cb6d530ede1","file_id":"12323","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2022_LIPICs_Chatterjee.pdf","date_created":"2023-01-20T10:19:19Z","creator":"dernst","file_size":657396,"date_updated":"2023-01-20T10:19:19Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772617"]},"publication_status":"published","month":"12","intvolume":" 250","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Spatial games form a widely-studied class of games from biology and physics modeling the evolution of social behavior. Formally, such a game is defined by a square (d by d) payoff matrix M and an undirected graph G. Each vertex of G represents an individual, that initially follows some strategy i ∈ {1,2,…,d}. In each round of the game, every individual plays the matrix game with each of its neighbors: An individual following strategy i meeting a neighbor following strategy j receives a payoff equal to the entry (i,j) of M. Then, each individual updates its strategy to its neighbors' strategy with the highest sum of payoffs, and the next round starts. The basic computational problems consist of reachability between configurations and the average frequency of a strategy. For general spatial games and graphs, these problems are in PSPACE. In this paper, we examine restricted setting: the game is a prisoner’s dilemma; and G is a subgraph of grid. We prove that basic computational problems for spatial games with prisoner’s dilemma on a subgraph of a grid are PSPACE-hard."}]},{"volume":36,"issue":"9","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["1577358767"],"eissn":["2374-3468"]},"publication_status":"published","month":"06","intvolume":" 36","scopus_import":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2203.01640","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered for SSP, which however is oblivious to the incurred risk. We present an alternative view, instead optimizing conditional value-at-risk (CVaR), an established risk measure. We treat both Markov chains as well as MDP and introduce, through novel insights, two algorithms, based on linear programming and value iteration, respectively. Both algorithms offer precise and provably correct solutions. Evaluation of our prototype implementation shows that risk-aware control is feasible on several moderately sized models.","lang":"eng"}],"department":[{"_id":"KrCh"}],"date_updated":"2023-02-20T07:19:12Z","status":"public","type":"conference","conference":{"name":"Conference on Artificial Intelligence","location":"Virtual","end_date":"2022-03-01","start_date":"2022-02-22"},"_id":"12568","doi":"10.1609/aaai.v36i9.21222","date_published":"2022-06-28T00:00:00Z","date_created":"2023-02-19T23:00:56Z","page":"9858-9867","day":"28","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022","year":"2022","quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"title":"Risk-aware stochastic shortest path","author":[{"last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"external_id":{"arxiv":["2203.01640"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.","ieee":"T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.","apa":"Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21222","ama":"Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222","mla":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222.","ista":"Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867.","chicago":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 36:9858–67. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i9.21222."}},{"date_updated":"2023-02-23T13:54:21Z","ddc":["000"],"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"file_date_updated":"2022-08-22T06:42:42Z","_id":"11938","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"issn":["1526-1719"]},"publication_status":"published","file":[{"file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","date_created":"2022-08-22T06:42:42Z","file_size":694538,"date_updated":"2022-08-22T06:42:42Z","creator":"dernst","success":1,"checksum":"dc6e255e3558faff924fd9e370886c11","file_id":"11940","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"9296"}]},"volume":26,"issue":"2","ec_funded":1,"abstract":[{"text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"06","intvolume":" 26","citation":{"apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591","ieee":"O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240.","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” Journal of Graph Algorithms and Applications. Brown University, 2022. https://doi.org/10.7155/jgaa.00591."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara"},{"first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","last_name":"Masárová","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana"},{"full_name":"Parada, Irene","last_name":"Parada","first_name":"Irene"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"first_name":"Alexander","last_name":"Pilz","full_name":"Pilz, Alexander"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"first_name":"Birgit","full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber"}],"external_id":{"arxiv":["2101.03928"]},"article_processing_charge":"No","title":"On compatible matchings","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"}],"has_accepted_license":"1","year":"2022","day":"01","publication":"Journal of Graph Algorithms and Applications","page":"225-240","date_published":"2022-06-01T00:00:00Z","doi":"10.7155/jgaa.00591","date_created":"2022-08-21T22:01:56Z","acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","quality_controlled":"1","publisher":"Brown University","oa":1},{"month":"09","oa":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2209.14368"}],"oa_version":"Preprint","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","abstract":[{"text":"In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal.","lang":"eng"}],"doi":"10.48550/ARXIV.2209.14368","date_published":"2022-09-28T00:00:00Z","ec_funded":1,"date_created":"2023-02-24T12:21:40Z","day":"28","language":[{"iso":"eng"}],"publication":"arXiv","year":"2022","publication_status":"submitted","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"status":"public","type":"preprint","article_number":"2209.14368","_id":"12677","title":"Repeated prophet inequality with near-optimal bounds","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Mona","id":"4363614d-b686-11ed-a7d5-ac9e4a24bc2e","full_name":"Mohammadi, Mona","last_name":"Mohammadi"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","first_name":"Raimundo J","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X"}],"external_id":{"arxiv":["2209.14368"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2209.14368.","ista":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368.","mla":"Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, 2209.14368, doi:10.48550/ARXIV.2209.14368.","ieee":"K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. .","short":"K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).","ama":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv. doi:10.48550/ARXIV.2209.14368","apa":"Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv. https://doi.org/10.48550/ARXIV.2209.14368"},"date_updated":"2023-02-27T10:07:40Z"},{"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record with Preorders.” Acta Informatica. Springer Nature, 2022. https://doi.org/10.1007/s00236-021-00412-y.","ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance record with preorders. Acta Informatica. 59, 585–618.","mla":"Kretinsky, Jan, et al. “Index Appearance Record with Preorders.” Acta Informatica, vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature. https://doi.org/10.1007/s00236-021-00412-y","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. Acta Informatica. 2022;59:585-618. doi:10.1007/s00236-021-00412-y","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618.","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022."},"title":"Index appearance record with preorders","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000735765500001"]},"author":[{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165"},{"first_name":"Clara","full_name":"Waldmann, Clara","last_name":"Waldmann"},{"last_name":"Weininger","full_name":"Weininger, Maximilian","first_name":"Maximilian"}],"acknowledgement":"This work is partially funded by the German Research Foundation (DFG) projects Verified Model Checkers (No. 317422601) and Statistical Unbounded Verification (No. 383882557), and the Alexander von Humboldt Foundation with funds from the German Federal Ministry of Education and Research. It is an extended version of [21], including all proofs together with further explanations and examples. Moreover, we provide a new, more efficient construction based on (total) preorders, unifying previous optimizations. Experiments are performed with a new, performant implementation, comparing our approach to the current state of the art.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","publication":"Acta Informatica","day":"01","year":"2022","isi":1,"has_accepted_license":"1","date_created":"2022-01-06T12:37:27Z","doi":"10.1007/s00236-021-00412-y","date_published":"2022-10-01T00:00:00Z","page":"585-618","_id":"10602","keyword":["computer networks and communications","information systems","software"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","ddc":["000"],"date_updated":"2023-08-02T13:49:28Z","department":[{"_id":"KrCh"}],"file_date_updated":"2022-01-07T07:50:31Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Transforming ω-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches."}],"intvolume":" 59","month":"10","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"bf1c195b6aaf59e8530cf9e3a9d731f7","file_id":"10603","creator":"cchlebak","file_size":1066082,"date_updated":"2022-01-07T07:50:31Z","file_name":"2021_ActaInfor_Křetínský.pdf","date_created":"2022-01-07T07:50:31Z"}],"publication_status":"published","publication_identifier":{"issn":["0001-5903"],"eissn":["1432-0525"]},"volume":59},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Svoboda, Jakub, Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.” Scientific Reports. Springer Nature, 2022. https://doi.org/10.1038/s41598-022-05333-5.","ista":"Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2022. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 12(1), 1526.","mla":"Svoboda, Jakub, et al. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.” Scientific Reports, vol. 12, no. 1, 1526, Springer Nature, 2022, doi:10.1038/s41598-022-05333-5.","apa":"Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-05333-5","ama":"Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 2022;12(1). doi:10.1038/s41598-022-05333-5","ieee":"J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.","short":"J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Scientific Reports 12 (2022)."},"title":"Infection dynamics of COVID-19 virus under lockdown and reopening","article_processing_charge":"No","external_id":{"isi":["000749198000039"],"arxiv":["2012.15155"]},"author":[{"last_name":"Svoboda","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub"},{"first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Nowak","full_name":"Nowak, Martin A.","first_name":"Martin A."}],"article_number":"1526","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"publication":"Scientific Reports","day":"27","year":"2022","isi":1,"has_accepted_license":"1","date_created":"2022-02-06T23:01:30Z","doi":"10.1038/s41598-022-05333-5","date_published":"2022-01-27T00:00:00Z","acknowledgement":"K.C. acknowledges support from ERC Consolidator Grant No. (863818: ForM-SMart). A.P. acknowledges support from FWF Grant No. J-4220. M.A.N. acknowledges support from Office of Naval Research grant N00014-16-1-2914 and from the John Templeton Foundation.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","ddc":["570"],"date_updated":"2023-08-02T14:13:07Z","file_date_updated":"2022-02-07T14:57:59Z","department":[{"_id":"KrCh"}],"_id":"10731","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"file":[{"date_created":"2022-02-07T14:57:59Z","file_name":"2022_ScientificReports_Svoboda.pdf","date_updated":"2022-02-07T14:57:59Z","file_size":2971922,"creator":"alisjak","file_id":"10744","checksum":"247afd30c173390940f099ead35a28ed","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"eissn":["2045-2322"]},"ec_funded":1,"volume":12,"issue":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Motivated by COVID-19, we develop and analyze a simple stochastic model for the spread of disease in human population. We track how the number of infected and critically ill people develops over time in order to estimate the demand that is imposed on the hospital system. To keep this demand under control, we consider a class of simple policies for slowing down and reopening society and we compare their efficiency in mitigating the spread of the virus from several different points of view. We find that in order to avoid overwhelming of the hospital system, a policy must impose a harsh lockdown or it must react swiftly (or both). While reacting swiftly is universally beneficial, being harsh pays off only when the country is patient about reopening and when the neighboring countries coordinate their mitigation efforts. Our work highlights the importance of acting decisively when closing down and the importance of patience and coordination between neighboring countries when reopening."}],"intvolume":" 12","month":"01","scopus_import":"1"},{"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file":[{"date_created":"2022-06-27T07:38:21Z","file_name":"2022_PLDI_Zikelic.pdf","creator":"dernst","date_updated":"2022-06-27T07:38:21Z","file_size":318697,"file_id":"11466","checksum":"7eb915a2ca5b5ce4729321f33b2e16e1","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450392655"]},"publication_status":"published","month":"06","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We present a novel approach to differential cost analysis that, given a program revision, attempts to statically bound the difference in resource usage, or cost, between the two program versions. Differential cost analysis is particularly interesting because of the many compelling applications for it, such as detecting resource-use regressions at code-review time or proving the absence of certain side-channel vulnerabilities. One prior approach to differential cost analysis is to apply relational reasoning that conceptually constructs a product program on which one can over-approximate the difference in costs between the two program versions. However, a significant challenge in any relational approach is effectively aligning the program versions to get precise results. In this paper, our key insight is that we can avoid the need for and the limitations of program alignment if, instead, we bound the difference of two cost-bound summaries rather than directly bounding the concrete cost difference. In particular, our method computes a threshold value for the maximal difference in cost between two program versions simultaneously using two kinds of cost-bound summaries---a potential function that evaluates to an upper bound for the cost incurred in the first program and an anti-potential function that evaluates to a lower bound for the cost incurred in the second. Our method has a number of desirable properties: it can be fully automated, it allows optimizing the threshold value on relative cost, it is suitable for programs that are not syntactically similar, and it supports non-determinism. We have evaluated an implementation of our approach on a number of program pairs collected from the literature, and we find that our method computes tight threshold values on relative cost in most examples.","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"file_date_updated":"2022-06-27T07:38:21Z","ddc":["000"],"date_updated":"2023-08-03T07:22:33Z","status":"public","type":"conference","conference":{"location":"San Diego, CA, United States","end_date":"2022-06-17","start_date":"2022-06-13","name":"PLDI: Programming Language Design and Implementation"},"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"11459","date_published":"2022-06-09T00:00:00Z","doi":"10.1145/3519939.3523435","date_created":"2022-06-21T09:26:15Z","page":"442-457","day":"09","publication":"Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation","has_accepted_license":"1","isi":1,"year":"2022","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"acknowledgement":"We thank Shaun Willows, Thomas Lugnet, and the Living Room Application Vending team for suggesting threshold\r\nbounds as a developer-friendly way to interact with a differential cost analyzer, and we thank Jim Christy, Daniel\r\nSchoepe, and the Prime Video Automated Reasoning team for their support and helpful suggestions throughout the\r\nproject. We also thank Michael Emmi for feedback on an earlier version of this paper. And finally, we thank the anonymous reviewers for their useful feedback and Aws Albarghouthi for shepherding the final version of the paper. Ðorđe Žikelić was also partially supported by ERC CoG 863818 (FoRM-SMArt).","title":"Differential cost analysis with simultaneous potentials and anti-potentials","author":[{"last_name":"Zikelic","full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chang, Bor-Yuh Evan","last_name":"Chang","first_name":"Bor-Yuh Evan"},{"first_name":"Pauline","last_name":"Bolignano","full_name":"Bolignano, Pauline"},{"first_name":"Franco","full_name":"Raimondi, Franco","last_name":"Raimondi"}],"article_processing_charge":"No","external_id":{"arxiv":["2204.00870"],"isi":["000850435600030"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Zikelic, Dorde, et al. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.” Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–57, doi:10.1145/3519939.3523435.","apa":"Zikelic, D., Chang, B.-Y. E., Bolignano, P., & Raimondi, F. (2022). Differential cost analysis with simultaneous potentials and anti-potentials. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 442–457). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3519939.3523435","ama":"Zikelic D, Chang B-YE, Bolignano P, Raimondi F. Differential cost analysis with simultaneous potentials and anti-potentials. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2022:442-457. doi:10.1145/3519939.3523435","ieee":"D. Zikelic, B.-Y. E. Chang, P. Bolignano, and F. Raimondi, “Differential cost analysis with simultaneous potentials and anti-potentials,” in Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, United States, 2022, pp. 442–457.","short":"D. Zikelic, B.-Y.E. Chang, P. Bolignano, F. Raimondi, in:, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–457.","chicago":"Zikelic, Dorde, Bor-Yuh Evan Chang, Pauline Bolignano, and Franco Raimondi. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.” In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 442–57. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519939.3523435.","ista":"Zikelic D, Chang B-YE, Bolignano P, Raimondi F. 2022. Differential cost analysis with simultaneous potentials and anti-potentials. Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 442–457."},"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}]},{"project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"article_number":"034321","title":"Social balance on networks: Local minima and best-edge dynamics","article_processing_charge":"No","external_id":{"isi":["000870243100001"],"arxiv":["2210.02394"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Svoboda","full_name":"Svoboda, Jakub","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” Physical Review E. American Physical Society, 2022. https://doi.org/10.1103/physreve.106.034321.","ista":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. 2022. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 106(3), 034321.","mla":"Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” Physical Review E, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:10.1103/physreve.106.034321.","ama":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 2022;106(3). doi:10.1103/physreve.106.034321","apa":"Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.106.034321","ieee":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.","short":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical Review E 106 (2022)."},"oa":1,"quality_controlled":"1","publisher":"American Physical Society","acknowledgement":"K.C. acknowledges support from ERC Start Grant No. (279307: Graph Games), ERC Consolidator Grant No. (863818: ForM-SMart), and Austrian Science Fund (FWF)\r\nGrants No. P23499-N23 and No. S11407-N23 (RiSE). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385.","date_created":"2023-01-16T09:57:57Z","doi":"10.1103/physreve.106.034321","date_published":"2022-09-29T00:00:00Z","publication":"Physical Review E","day":"29","year":"2022","isi":1,"status":"public","type":"journal_article","article_type":"original","_id":"12257","department":[{"_id":"KrCh"}],"date_updated":"2023-08-04T09:50:44Z","intvolume":" 106","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.02394"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local minima cannot be escaped by mild perturbations of the network. Motivated by these anomalies, we introduce best-edge dynamics (BED), a new plausible stochastic process. We prove that BED always reaches balance and that it does so fast in various interesting settings."}],"ec_funded":1,"volume":106,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]}},{"acknowledgement":"This work was supported by the European Research Council (https://erc.europa.eu/)\r\nCoG 863818 (ForM-SMArt) (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"has_accepted_license":"1","isi":1,"year":"2022","day":"14","publication":"PLOS Computational Biology","date_published":"2022-06-14T00:00:00Z","doi":"10.1371/journal.pcbi.1010149","date_created":"2023-01-16T10:02:51Z","article_number":"e1010149","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"citation":{"mla":"Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” PLOS Computational Biology, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:10.1371/journal.pcbi.1010149.","apa":"Schmid, L., Hilbe, C., Chatterjee, K., & Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1010149","ama":"Schmid L, Hilbe C, Chatterjee K, Nowak M. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 2022;18(6). doi:10.1371/journal.pcbi.1010149","ieee":"L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” PLOS Computational Biology, vol. 18, no. 6. Public Library of Science, 2022.","short":"L. Schmid, C. Hilbe, K. Chatterjee, M. Nowak, PLOS Computational Biology 18 (2022).","chicago":"Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” PLOS Computational Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pcbi.1010149.","ista":"Schmid L, Hilbe C, Chatterjee K, Nowak M. 2022. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 18(6), e1010149."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura"},{"last_name":"Hilbe","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"external_id":{"pmid":["35700167"],"isi":["000843626800031"]},"article_processing_charge":"No","title":"Direct reciprocity between individuals that use different strategy spaces","abstract":[{"lang":"eng","text":"In repeated interactions, players can use strategies that respond to the outcome of previous rounds. Much of the existing literature on direct reciprocity assumes that all competing individuals use the same strategy space. Here, we study both learning and evolutionary dynamics of players that differ in the strategy space they explore. We focus on the infinitely repeated donation game and compare three natural strategy spaces: memory-1 strategies, which consider the last moves of both players, reactive strategies, which respond to the last move of the co-player, and unconditional strategies. These three strategy spaces differ in the memory capacity that is needed. We compute the long term average payoff that is achieved in a pairwise learning process. We find that smaller strategy spaces can dominate larger ones. For weak selection, unconditional players dominate both reactive and memory-1 players. For intermediate selection, reactive players dominate memory-1 players. Only for strong selection and low cost-to-benefit ratio, memory-1 players dominate the others. We observe that the supergame between strategy spaces can be a social dilemma: maximum payoff is achieved if both players explore a larger strategy space, but smaller strategy spaces dominate."}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","month":"06","intvolume":" 18","publication_identifier":{"eissn":["1553-7358"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"31b6b311b6731f1658277a9dfff6632c","file_id":"12460","success":1,"creator":"dernst","date_updated":"2023-01-30T11:28:13Z","file_size":3143222,"date_created":"2023-01-30T11:28:13Z","file_name":"2022_PlosCompBio_Schmid.pdf"}],"language":[{"iso":"eng"}],"issue":"6","volume":18,"ec_funded":1,"_id":"12280","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","keyword":["Computational Theory and Mathematics","Cellular and Molecular Neuroscience","Genetics","Molecular Biology","Ecology","Modeling and Simulation","Ecology","Evolution","Behavior and Systematics"],"date_updated":"2023-08-04T10:27:08Z","ddc":["000","570"],"file_date_updated":"2023-01-30T11:28:13Z","department":[{"_id":"KrCh"}]},{"acknowledgement":"Partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT through grant C15E03.\r\n","publisher":"Institute for Operations Research and the Management Sciences","quality_controlled":"1","oa":1,"day":"01","publication":"Mathematics of Operations Research","isi":1,"year":"2022","date_published":"2022-02-01T00:00:00Z","doi":"10.1287/moor.2020.1116","date_created":"2021-04-08T09:33:31Z","page":"100-119","project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.","ista":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.","mla":"Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116.","ama":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119. doi:10.1287/moor.2020.1116","apa":"Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116","short":"K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.","ieee":"K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022."},"title":"Finite-memory strategies in POMDPs with long-run average objectives","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"},{"full_name":"Ziliotto, Bruno","last_name":"Ziliotto","first_name":"Bruno"}],"external_id":{"arxiv":["1904.13360"],"isi":["000731918100001"]},"article_processing_charge":"No","oa_version":"Preprint","abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite memory. This implies notably that approximating the long-run value is recursively enumerable, as well as a weak continuity property of the value with respect to the transition function. ","lang":"eng"}],"month":"02","intvolume":" 47","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1904.13360","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"publication_status":"published","issue":"1","volume":47,"_id":"9311","status":"public","keyword":["Management Science and Operations Research","General Mathematics","Computer Science Applications"],"type":"journal_article","article_type":"original","date_updated":"2023-09-05T13:16:11Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}]},{"department":[{"_id":"KrCh"}],"date_updated":"2023-09-05T15:11:51Z","conference":{"start_date":"2022-10-25","end_date":"2022-10-28","location":"Virtual","name":"ATVA: Automated Technology for Verification and Analysis"},"type":"conference","status":"public","_id":"12170","volume":13505,"publication_status":"published","publication_identifier":{"eisbn":["9783031199929"],"eissn":["1611-3349"],"isbn":["9783031199912"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 13505","month":"10","abstract":[{"lang":"eng","text":"We present PET, a specialized and highly optimized framework for partial exploration on probabilistic systems. Over the last decade, several significant advances in the analysis of Markov decision processes employed partial exploration. In a nutshell, this idea allows to focus computation on specific parts of the system, guided by heuristics, while maintaining correctness. In particular, only relevant parts of the system are constructed on demand, which in turn potentially allows to omit constructing large parts of the system. Depending on the model, this leads to dramatic speed-ups, in extreme cases even up to an arbitrary factor. PET unifies several previous implementations and provides a flexible framework to easily implement partial exploration for many further problems. Our experimental evaluation shows significant improvements compared to the previous implementations while vastly reducing the overhead required to add support for additional properties."}],"oa_version":"None","article_processing_charge":"No","author":[{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer"}],"title":"PET – A partial exploration tool for probabilistic verification","citation":{"ista":"Meggendorfer T. 2022. PET – A partial exploration tool for probabilistic verification. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 320–326.","chicago":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:320–26. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19992-9_20.","ama":"Meggendorfer T. PET – A partial exploration tool for probabilistic verification. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:320-326. doi:10.1007/978-3-031-19992-9_20","apa":"Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_20","short":"T. Meggendorfer, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 320–326.","ieee":"T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.","mla":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” 20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"320-326","date_created":"2023-01-12T12:11:07Z","date_published":"2022-10-21T00:00:00Z","doi":"10.1007/978-3-031-19992-9_20","year":"2022","publication":"20th International Symposium on Automated Technology for Verification and Analysis","day":"21","publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"We thank Pranav Ashok and Maximilian Weininger for their contributions to spiritual predecessors of PET as well as motivating the initial development of this tool."},{"oa":1,"publisher":"Elsevier","quality_controlled":"1","acknowledgement":"This work was partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407 and by the grant ERC CoG 863818 (ForM-SMArt).","page":"1-21","date_created":"2022-05-22T22:01:40Z","doi":"10.1016/j.jcss.2022.04.003","date_published":"2022-11-01T00:00:00Z","year":"2022","isi":1,"publication":"Journal of Computer and System Sciences","day":"01","project":[{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"article_processing_charge":"No","external_id":{"isi":["000805002800001"],"arxiv":["1802.03642"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"title":"Graph planning with expected finite horizon","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences. Elsevier, 2022. https://doi.org/10.1016/j.jcss.2022.04.003.","ista":"Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences, vol. 129, Elsevier, 2022, pp. 1–21, doi:10.1016/j.jcss.2022.04.003.","ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 2022;129:1-21. doi:10.1016/j.jcss.2022.04.003","apa":"Chatterjee, K., & Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2022.04.003","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.","short":"K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1802.03642","open_access":"1"}],"scopus_import":"1","intvolume":" 129","month":"11","abstract":[{"lang":"eng","text":"Fixed-horizon planning considers a weighted graph and asks to construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping-time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary as the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping-time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time."}],"oa_version":"Preprint","ec_funded":1,"related_material":{"record":[{"id":"7402","status":"public","relation":"earlier_version"}]},"volume":129,"publication_status":"published","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","_id":"11402","department":[{"_id":"KrCh"}],"date_updated":"2023-09-07T14:48:11Z"},{"citation":{"chicago":"Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” In 33rd International Conference on Concurrency Theory , Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11.","ista":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. 2022. Anytime guarantees for reachability in uncountable Markov decision processes. 33rd International Conference on Concurrency Theory . CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 11.","mla":"Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” 33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11.","apa":"Grover, K., Kretinsky, J., Meggendorfer, T., & Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11","ama":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: 33rd International Conference on Concurrency Theory . Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.CONCUR.2022.11","short":"K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ieee":"K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2008.04824"]},"author":[{"full_name":"Grover, Kush","last_name":"Grover","first_name":"Kush"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"first_name":"Maimilian","last_name":"Weininger","full_name":"Weininger, Maimilian"}],"title":"Anytime guarantees for reachability in uncountable Markov decision processes","article_number":"11","year":"2022","has_accepted_license":"1","publication":"33rd International Conference on Concurrency Theory ","day":"15","date_created":"2023-03-28T08:09:32Z","doi":"10.4230/LIPIcs.CONCUR.2022.11","date_published":"2022-09-15T00:00:00Z","acknowledgement":"Kush Grover: The author has been supported by the DFG research training group GRK\r\n2428 ConVeY.\r\nMaximilian Weininger: The author has been partially supported by DFG projects 383882557\r\nStatistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic\r\nVerification (GOPro)","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2023-09-26T10:43:30Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2023-09-26T10:43:15Z","_id":"12775","conference":{"start_date":"2022-09-13","end_date":"2022-09-16","location":"Warsaw, Poland","name":"CONCUR: Conference on Concurrency Theory"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"issn":["1868-8969"]},"language":[{"iso":"eng"}],"file":[{"file_id":"14372","checksum":"e282e43d3ae0ba6e067b72f4583e13c0","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-09-26T10:43:15Z","file_name":"2022_LIPIcS_Grover.pdf","date_updated":"2023-09-26T10:43:15Z","file_size":960036,"creator":"dernst"}],"volume":243,"abstract":[{"lang":"eng","text":"We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a sequence of approximations converging to the true value in the limit, our aim is to obtain an algorithm with guarantees on the precision of the approximation.\r\nAs this problem is undecidable in general, assumptions on the MDP are necessary. Our main contribution is to identify sufficient assumptions that are as weak as possible, thus approaching the \"boundary\" of which systems can be correctly and reliably analyzed. To this end, we also argue why each of our assumptions is necessary for algorithms based on processing finitely many observations.\r\nWe present two solution variants. The first one provides converging lower bounds under weaker assumptions than typical ones from previous works concerned with guarantees. The second one then utilizes stronger assumptions to additionally provide converging upper bounds. Altogether, we obtain an anytime algorithm, i.e. yielding a sequence of approximants with known and iteratively improving precision, converging to the true value in the limit. Besides, due to the generality of our assumptions, our algorithms are very general templates, readily allowing for various heuristics from literature in contrast to, e.g., a specific discretization algorithm. Our theoretical contribution thus paves the way for future practical improvements without sacrificing correctness guarantees."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 243","month":"09"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete certificates for auantitative termination analysis of probabilistic programs. Proceedings of the 34th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022. https://doi.org/10.1007/978-3-031-13185-1_4.","ama":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete certificates for auantitative termination analysis of probabilistic programs. In: Proceedings of the 34th International Conference on Computer Aided Verification. Vol 13371. Springer; 2022:55-78. doi:10.1007/978-3-031-13185-1_4","apa":"Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4","short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings of the 34th International Conference on Computer Aided Verification, Springer, 2022, pp. 55–78.","ieee":"K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.","mla":"Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4."},"title":"Sound and complete certificates for auantitative termination analysis of probabilistic programs","article_processing_charge":"Yes (in subscription journal)","external_id":{"isi":["000870304500004"]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication":"Proceedings of the 34th International Conference on Computer Aided Verification","day":"07","year":"2022","has_accepted_license":"1","isi":1,"date_created":"2022-08-28T22:02:02Z","date_published":"2022-08-07T00:00:00Z","doi":"10.1007/978-3-031-13185-1_4","page":"55-78","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055, the HKUST Startup Grant R9272 and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","oa":1,"publisher":"Springer","quality_controlled":"1","ddc":["000"],"date_updated":"2023-11-30T10:55:37Z","department":[{"_id":"KrCh"}],"file_date_updated":"2022-08-29T09:17:01Z","_id":"12000","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CAV: Computer Aided Verification","start_date":"2022-08-07","end_date":"2022-08-10","location":"Haifa, Israel"},"type":"conference","language":[{"iso":"eng"}],"file":[{"file_size":505094,"date_updated":"2022-08-29T09:17:01Z","creator":"alisjak","file_name":"2022_LNCS_Chatterjee.pdf","date_created":"2022-08-29T09:17:01Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"12003","checksum":"24e0f810ec52735a90ade95198bc641d"}],"publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031131844"],"issn":["0302-9743"]},"ec_funded":1,"volume":13371,"related_material":{"record":[{"status":"public","id":"14539","relation":"dissertation_contains"}]},"oa_version":"Published Version","abstract":[{"text":"We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold p∈[0,1], we aim for certificates proving that the program terminates with probability at least 1−p. The basic idea of our approach is to find a terminating stochastic invariant, i.e. a subset SI of program states such that (i) the probability of the program ever leaving SI is no more than p, and (ii) almost-surely, the program either leaves SI or terminates.\r\n\r\nWhile stochastic invariants are already well-known, we provide the first proof that the idea above is not only sound, but also complete for quantitative termination analysis. We then introduce a novel sound and complete characterization of stochastic invariants that enables template-based approaches for easy synthesis of quantitative termination certificates, especially in affine or polynomial forms. Finally, by combining this idea with the existing martingale-based methods that are relatively complete for qualitative termination analysis, we obtain the first automated, sound, and relatively complete algorithm for quantitative termination analysis. Notably, our completeness guarantees for quantitative termination analysis are as strong as the best-known methods for the qualitative variant.\r\n\r\nOur prototype implementation demonstrates the effectiveness of our approach on various probabilistic programs. We also demonstrate that our algorithm certifies lower bounds on termination probability for probabilistic programs that are beyond the reach of previous methods.","lang":"eng"}],"intvolume":" 13371","month":"08","alternative_title":["LNCS"],"scopus_import":"1"},{"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385.","quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"year":"2022","day":"28","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","page":"7326-7336","date_published":"2022-06-28T00:00:00Z","doi":"10.1609/aaai.v36i7.20695","date_created":"2023-02-05T17:29:50Z","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"citation":{"mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i7.20695","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(7):7326-7336. doi:10.1609/aaai.v36i7.20695","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i7.20695.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"article_processing_charge":"No","external_id":{"arxiv":["2112.09495"]},"title":"Stability verification in stochastic control systems via neural network supermartingales","abstract":[{"text":"We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. \r\n In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present a method for learning neural network RSMs. \r\n We prove that our approach guarantees a.s. asymptotic stability of the system and\r\n provides the first method to obtain bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n Finally, we validate our approach experimentally on a set of nonlinear stochastic reinforcement learning environments with neural network policies.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2112.09495"}],"month":"06","intvolume":" 36","publication_identifier":{"isbn":["9781577358350"],"eissn":["2374-3468"],"issn":["2159-5399"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"14539","status":"public","relation":"dissertation_contains"}]},"issue":"7","volume":36,"ec_funded":1,"_id":"12511","article_type":"original","type":"journal_article","status":"public","keyword":["General Medicine"],"date_updated":"2023-11-30T10:55:37Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}]},{"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2205.11991","open_access":"1"}],"month":"05","abstract":[{"text":"In this work, we address the problem of learning provably stable neural\r\nnetwork policies for stochastic control systems. While recent work has\r\ndemonstrated the feasibility of certifying given policies using martingale\r\ntheory, the problem of how to learn such policies is little explored. Here, we\r\nstudy the effectiveness of jointly learning a policy together with a martingale\r\ncertificate that proves its stability using a single learning algorithm. We\r\nobserve that the joint optimization problem becomes easily stuck in local\r\nminima when starting from a randomly initialized policy. Our results suggest\r\nthat some form of pre-training of the policy is required for the joint\r\noptimization to repair and verify the policy successfully.","lang":"eng"}],"oa_version":"Preprint","ec_funded":1,"date_created":"2023-11-24T13:22:30Z","date_published":"2022-05-24T00:00:00Z","doi":"10.48550/arXiv.2205.11991","related_material":{"record":[{"relation":"dissertation_contains","id":"14539","status":"public"}]},"publication_status":"submitted","year":"2022","language":[{"iso":"eng"}],"publication":"arXiv","day":"24","type":"preprint","status":"public","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"_id":"14601","article_processing_charge":"No","external_id":{"arxiv":["2205.11991"]},"author":[{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Learning stabilizing policies in stochastic control systems","date_updated":"2023-11-30T10:55:37Z","citation":{"mla":"Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, doi:10.48550/arXiv.2205.11991.","apa":"Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991","ama":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv. doi:10.48550/arXiv.2205.11991","short":"D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).","ieee":"D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .","chicago":"Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.11991.","ista":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 10.48550/arXiv.2205.11991."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"type":"preprint","status":"public","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"_id":"14600","article_processing_charge":"No","external_id":{"arxiv":["2210.05308"]},"author":[{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"title":"Learning control policies for stochastic systems with reach-avoid guarantees","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, doi:10.48550/ARXIV.2210.05308.","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” arXiv. .","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. doi:10.48550/ARXIV.2210.05308","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. https://doi.org/10.48550/ARXIV.2210.05308","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 10.48550/ARXIV.2210.05308."},"date_updated":"2024-01-22T14:08:29Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2210.05308"}],"month":"11","abstract":[{"lang":"eng","text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold $p\\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on $3$ stochastic non-linear reinforcement learning tasks."}],"oa_version":"Preprint","date_created":"2023-11-24T13:10:09Z","ec_funded":1,"date_published":"2022-11-29T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14539"},{"id":"14830","status":"public","relation":"later_version"}]},"doi":"10.48550/ARXIV.2210.05308","year":"2022","publication_status":"submitted","language":[{"iso":"eng"}],"publication":"arXiv","day":"29"},{"acknowledgement":"Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411. Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project FE 560/9-1.\r\n","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","quality_controlled":"1","oa":1,"day":"13","publication":"32nd International Conference on Concurrency Theory","has_accepted_license":"1","year":"2021","date_published":"2021-08-13T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2021.18","date_created":"2021-09-27T14:33:14Z","article_number":"18","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.","short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ama":"Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18","apa":"Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18","mla":"Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.","ista":"Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.","chicago":"Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.” In 32nd International Conference on Concurrency Theory, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18."},"title":"Decomposing permutation automata","author":[{"full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"first_name":"Nicolas","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas"},{"first_name":"Petra","full_name":"Wolf, Petra","last_name":"Wolf"}],"external_id":{"arxiv":["2107.04683"]},"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet."}],"month":"08","intvolume":" 203","scopus_import":"1","alternative_title":["LIPIcs"],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"10064","checksum":"4722c81be82265cf45e78adf9db91250","creator":"cchlebak","file_size":1003552,"date_updated":"2021-10-01T11:10:53Z","file_name":"2021_CONCUR_Jecker.pdf","date_created":"2021-10-01T11:10:53Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7203-7"]},"publication_status":"published","volume":203,"ec_funded":1,"_id":"10052","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2021-08-27","location":"Paris, France","start_date":"2021-08-23","name":"CONCUR: Conference on Concurrency Theory"},"ddc":["000"],"date_updated":"2022-05-13T08:12:52Z","file_date_updated":"2021-10-01T11:10:53Z","department":[{"_id":"KrCh"}]},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","oa":1,"acknowledgement":"Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt). Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","doi":"10.4230/LIPIcs.ICALP.2021.124","date_published":"2021-07-02T00:00:00Z","date_created":"2021-09-27T14:33:15Z","day":"02","publication":"48th International Colloquium on Automata, Languages, and Programming","has_accepted_license":"1","year":"2021","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"article_number":"124","title":"Faster algorithms for bounded liveness in graphs and game graphs","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sagar Sudhir","full_name":"Kale, Sagar Sudhir","last_name":"Kale"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” 48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.","ama":"Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124","apa":"Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124","ieee":"K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.","short":"K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.","ista":"Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124."},"month":"07","intvolume":" 198","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a \"good\" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives."}],"volume":198,"ec_funded":1,"file":[{"checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","file_id":"10062","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2021-10-01T08:49:26Z","file_name":"2021_LIPIcs_Chatterjee.pdf","creator":"cchlebak","date_updated":"2021-10-01T08:49:26Z","file_size":854576}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-195-5"]},"publication_status":"published","status":"public","type":"conference","conference":{"location":"Glasgow, Scotland","end_date":"2021-07-16","start_date":"2021-07-12","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"10054","department":[{"_id":"KrCh"}],"file_date_updated":"2021-10-01T08:49:26Z","ddc":["000"],"date_updated":"2022-08-12T10:55:02Z"},{"_id":"10075","type":"conference","conference":{"start_date":"2021-08-23","location":"Tallinn, Estonia","end_date":"2021-08-27","name":"MFCS: Mathematical Foundations of Computer Science"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2022-05-13T08:21:56Z","ddc":["000"],"file_date_updated":"2021-10-06T12:44:05Z","department":[{"_id":"KrCh"}],"abstract":[{"text":"We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","month":"08","intvolume":" 202","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7201-3"]},"publication_status":"published","file":[{"file_size":825567,"date_updated":"2021-10-06T12:44:05Z","creator":"cchlebak","file_name":"2021_LIPIcs_Guha.pdf","date_created":"2021-10-06T12:44:05Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","file_id":"10097"}],"language":[{"iso":"eng"}],"volume":202,"ec_funded":1,"article_number":"53","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"citation":{"chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In 46th International Symposium on Mathematical Foundations of Computer Science, Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.MFCS.2021.53.","ista":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.","mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.","short":"S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ieee":"S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.","ama":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53","apa":"Guha, S., Jecker, I. R., Lehtinen, K., & Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.53"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Guha","full_name":"Guha, Shibashis","first_name":"Shibashis"},{"last_name":"Jecker","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"last_name":"Lehtinen","full_name":"Lehtinen, Karoliina","first_name":"Karoliina"},{"first_name":"Martin","full_name":"Zimmermann, Martin","last_name":"Zimmermann"}],"external_id":{"arxiv":["2105.02611"]},"article_processing_charge":"No","title":"A bit of nondeterminism makes pushdown automata expressive and succinct","acknowledgement":"Ismaël Jecker: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411. Karoliina Lehtinen: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 892704.","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2021","day":"18","publication":"46th International Symposium on Mathematical Foundations of Computer Science","date_published":"2021-08-18T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2021.53","date_created":"2021-10-03T22:01:23Z"},{"day":"29","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","has_accepted_license":"1","year":"2021","date_published":"2021-11-29T00:00:00Z","doi":"10.4230/LIPIcs.FSTTCS.2021.34","date_created":"2022-01-16T23:01:29Z","acknowledgement":"We like to thank Lukas Fleischer and Michael Wehar for our discussions. This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie in der Automatentheorie https://www.dagstuhl.de/20483.\r\n","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.","chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34.","apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., & Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34","ieee":"E. Arrighi et al., “On the complexity of intersection non-emptiness for star-free language classes,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34."},"title":"On the complexity of intersection non-emptiness for star-free language classes","author":[{"full_name":"Arrighi, Emmanuel","last_name":"Arrighi","first_name":"Emmanuel"},{"first_name":"Henning","last_name":"Fernau","full_name":"Fernau, Henning"},{"first_name":"Stefan","last_name":"Hoffmann","full_name":"Hoffmann, Stefan"},{"first_name":"Markus","last_name":"Holzer","full_name":"Holzer, Markus"},{"last_name":"Jecker","full_name":"Jecker, Ismael R","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"first_name":"Mateus","last_name":"De Oliveira Oliveira","full_name":"De Oliveira Oliveira, Mateus"},{"first_name":"Petra","full_name":"Wolf, Petra","last_name":"Wolf"}],"article_processing_charge":"No","external_id":{"arxiv":["2110.01279"]},"article_number":"34","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"file":[{"date_updated":"2022-01-17T10:49:03Z","file_size":844224,"creator":"cchlebak","date_created":"2022-01-17T10:49:03Z","file_name":"2021_LIPIcs_Arrighi.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"10634","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"publication_status":"published","volume":213,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all automata accept a language from the level B_1. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC^0 when restricted to level L_0; complete for L or NL, depending on the input representation, when restricted to languages in the level L_{1/2}; NP-complete when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally, PSPACE-complete when the input automata accept languages in level L_2 or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation."}],"month":"11","intvolume":" 213","scopus_import":"1","alternative_title":["LIPIcs"],"ddc":["000"],"date_updated":"2022-01-17T10:56:19Z","department":[{"_id":"KrCh"}],"file_date_updated":"2022-01-17T10:49:03Z","_id":"10630","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2021-12-15","end_date":"2021-12-17","location":"Virtual","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"}},{"citation":{"mla":"Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"article_processing_charge":"No","title":"Quantitative verification on product graphs of small treewidth","article_number":"42","has_accepted_license":"1","year":"2021","day":"29","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","date_published":"2021-11-29T00:00:00Z","doi":"10.4230/LIPIcs.FSTTCS.2021.42","date_created":"2022-01-16T23:01:28Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_updated":"2022-01-17T10:39:40Z","ddc":["000"],"file_date_updated":"2022-01-17T10:36:08Z","department":[{"_id":"KrCh"}],"_id":"10629","type":"conference","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15","end_date":"2021-12-17","location":"Virtual"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"10633","checksum":"71141acdeffa9056f24d6dbef952d254","creator":"cchlebak","file_size":891566,"date_updated":"2022-01-17T10:36:08Z","file_name":"2021_LIPIcs_Chatterjee.pdf","date_created":"2022-01-17T10:36:08Z"}],"language":[{"iso":"eng"}],"volume":213,"abstract":[{"lang":"eng","text":"Product graphs arise naturally in formal verification and program analysis. For example, the analysis of two concurrent threads requires the product of two component control-flow graphs, and for language inclusion of deterministic automata the product of two automata is constructed. In many cases, the component graphs have constant treewidth, e.g., when the input contains control-flow graphs of programs. We consider the algorithmic analysis of products of two constant-treewidth graphs with respect to three classic specification languages, namely, (a) algebraic properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur main contributions are as follows. Consider a graph G that is the product of two constant-treewidth graphs of size n each. First, given an idempotent semiring, we present an algorithm that computes the semiring transitive closure of G in time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time algorithm for deciding whether the value of a starting state is non-negative, improving the previously known O(n⁴) bound. Third, given an initial credit for energy objective, we present an O(n⁵)-time algorithm for computing the minimum initial credit for all nodes of G, improving the previously known O(n⁸) bound. At the heart of our approach lies an algorithm for the efficient construction of strongly-balanced tree decompositions of constant-treewidth graphs. Given a constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm constructs a binary tree decomposition of G' of width O(λ) with the property that the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ})."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"11","intvolume":" 213"},{"abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"scopus_import":"1","month":"01","publication_status":"published","publication_identifier":{"isbn":["978-1-61197-646-5"]},"language":[{"iso":"eng"}],"ec_funded":1,"_id":"10694","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10","end_date":"2021-01-13","location":"Virtual"},"type":"conference","status":"public","date_updated":"2022-01-27T12:58:43Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","oa":1,"publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","year":"2021","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","day":"01","page":"617-636","date_created":"2022-01-27T12:11:23Z","doi":"10.1137/1.9781611976465.38","date_published":"2021-01-01T00:00:00Z","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"citation":{"ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976465.38.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","external_id":{"arxiv":["2005.06636"]},"author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"title":"Infinite-duration all-pay bidding games","editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}]},{"department":[{"_id":"KrCh"}],"date_updated":"2022-08-05T09:05:06Z","status":"public","type":"conference","conference":{"end_date":"2021-08-27","location":"Virtual, Online","start_date":"2021-08-19","name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization"},"_id":"10847","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1045-0823"],"isbn":["9780999241196"]},"publication_status":"published","month":"09","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2021/575","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game."}],"title":"Solving partially observable stochastic shortest-path games","author":[{"full_name":"Tomášek, Petr","last_name":"Tomášek","first_name":"Petr"},{"last_name":"Horák","full_name":"Horák, Karel","first_name":"Karel"},{"last_name":"Aradhye","full_name":"Aradhye, Aditya","first_name":"Aditya"},{"last_name":"Bošanský","full_name":"Bošanský, Branislav","first_name":"Branislav"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/575","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: 30th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:10.24963/ijcai.2021/575","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.","ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.","chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/575."},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"date_published":"2021-09-01T00:00:00Z","doi":"10.24963/ijcai.2021/575","date_created":"2022-03-13T23:01:47Z","page":"4182-4189","day":"01","publication":"30th International Joint Conference on Artificial Intelligence","year":"2021","quality_controlled":"1","publisher":"International Joint Conferences on Artificial Intelligence","oa":1,"acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. "},{"conference":{"name":"WALCOM: Algorithms and Computation","location":"Yangon, Myanmar","end_date":"2021-03-02","start_date":"2021-02-28"},"type":"conference","status":"public","_id":"9296","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"date_updated":"2023-02-21T16:33:44Z","main_file_link":[{"url":"https://arxiv.org/abs/2101.03928","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 12635","month":"02","abstract":[{"lang":"eng","text":" matching is compatible to two or more labeled point sets of size n with labels {1,…,n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled convex sets of n points there exists a compatible matching with ⌊2n−−√⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ) . As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(logn) copies of any set of n points are necessary and sufficient for the existence of a labeling such that any compatible matching consists only of a single edge."}],"oa_version":"Preprint","ec_funded":1,"related_material":{"record":[{"relation":"later_version","id":"11938","status":"public"}]},"volume":12635,"publication_status":"published","publication_identifier":{"isbn":["9783030682101"],"eissn":["16113349"],"issn":["03029743"]},"language":[{"iso":"eng"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","external_id":{"arxiv":["2101.03928"]},"author":[{"last_name":"Aichholzer","full_name":"Aichholzer, Oswin","first_name":"Oswin"},{"full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M"},{"last_name":"Masárová","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Irene","full_name":"Parada, Irene","last_name":"Parada"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"first_name":"Alexander","full_name":"Pilz, Alexander","last_name":"Pilz"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"first_name":"Birgit","last_name":"Vogtenhuber","full_name":"Vogtenhuber, Birgit"}],"title":"On compatible matchings","citation":{"ieee":"O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: 15th International Conference on Algorithms and Computation. Vol 12635. Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” In 15th International Conference on Algorithms and Computation, 12635:221–33. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-68211-8_18."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","page":"221-233","date_created":"2021-03-28T22:01:41Z","doi":"10.1007/978-3-030-68211-8_18","date_published":"2021-02-16T00:00:00Z","year":"2021","publication":"15th International Conference on Algorithms and Computation","day":"16"},{"intvolume":" 29","month":"03","oa":1,"main_file_link":[{"url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf","open_access":"1"}],"quality_controlled":"1","publisher":"MIT Press","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore."}],"date_created":"2021-05-19T12:25:42Z","date_published":"2021-03-01T00:00:00Z","volume":29,"page":"139-152","publication":"Deliberate Ignorance: Choosing Not To Know","language":[{"iso":"eng"}],"day":"01","year":"2021","publication_identifier":{"isbn":["978-0-262-04559-9"]},"status":"public","type":"book_chapter","_id":"9403","series_title":"Strüngmann Forum Reports","title":"The evolution of strategic ignorance in strategic interaction","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"editor":[{"first_name":"Ralph","full_name":"Hertwig, Ralph","last_name":"Hertwig"},{"first_name":"Christoph","full_name":"Engel, Christoph","last_name":"Engel"}],"article_processing_charge":"No","author":[{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","last_name":"Schmid","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329"},{"full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T13:57:04Z","citation":{"chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021.","ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","apa":"Schmid, L., & Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig & C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.","ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. Deliberate Ignorance: Choosing Not To Know. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152."}},{"citation":{"ista":"Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.","chicago":"Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.” In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-72016-2.","short":"S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.","ieee":"S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.","ama":"Bansal S, Chatterjee K, Vardi MY. On satisficing in quantitative games. In: 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12651. Springer Nature; 2021:20-37. doi:10.1007/978-3-030-72016-2","apa":"Bansal, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. https://doi.org/10.1007/978-3-030-72016-2","mla":"Bansal, Suguman, et al. “On Satisficing in Quantitative Games.” 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bansal, Suguman","last_name":"Bansal","first_name":"Suguman"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Moshe Y.","full_name":"Vardi, Moshe Y.","last_name":"Vardi"}],"article_processing_charge":"No","external_id":{"arxiv":["2101.02594"]},"title":"On satisficing in quantitative games","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"has_accepted_license":"1","year":"2021","day":"21","publication":"27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","page":"20-37","doi":"10.1007/978-3-030-72016-2","date_published":"2021-03-21T00:00:00Z","date_created":"2023-03-26T22:01:09Z","acknowledgement":"We thank anonymous reviewers for valuable inputs. This work is supported in part by NSF grant 2030859 to the CRA for the CIFellows Project, NSF grants IIS-1527668, CCF-1704883, IIS-1830549, the ERC CoG 863818 (ForM-SMArt), and an award from the Maryland Procurement Office.","publisher":"Springer Nature","quality_controlled":"1","oa":1,"date_updated":"2023-03-28T11:03:11Z","ddc":["000"],"file_date_updated":"2023-03-28T11:00:33Z","department":[{"_id":"KrCh"}],"_id":"12767","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2021-03-27","end_date":"2021-04-01","location":"Luxembourg City, Luxembourg"},"status":"public","publication_identifier":{"isbn":["9783030720155"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","file":[{"checksum":"b020b78b23587ce7610b1aafb4e63438","file_id":"12777","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-03-28T11:00:33Z","file_name":"2021_LNCS_Bansal.pdf","creator":"dernst","date_updated":"2023-03-28T11:00:33Z","file_size":747418}],"language":[{"iso":"eng"}],"volume":12651,"ec_funded":1,"abstract":[{"text":"Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound.\r\nThis work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LNCS"],"month":"03","intvolume":" 12651"},{"status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","end_date":"2021-12-10","start_date":"2021-12-06"},"type":"conference","_id":"10667","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2022-01-26T07:39:59Z","ddc":["000"],"date_updated":"2023-06-23T07:01:11Z","month":"12","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"alternative_title":[" Advances in Neural Information Processing Systems"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"language":[{"iso":"eng"}],"file":[{"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_id":"10682","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","creator":"mlechner","date_updated":"2022-01-26T07:39:59Z","file_size":452492}],"publication_status":"published","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"Infinite time horizon safety of Bayesian neural networks","external_id":{"arxiv":["2111.03165"]},"article_processing_charge":"No","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: 35th Conference on Neural Information Processing Systems. ; 2021. doi:10.48550/arXiv.2111.03165","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual. https://doi.org/10.48550/arXiv.2111.03165","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165."},"oa":1,"quality_controlled":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), 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.","date_created":"2022-01-25T15:45:58Z","date_published":"2021-12-01T00:00:00Z","doi":"10.48550/arXiv.2111.03165","publication":"35th Conference on Neural Information Processing Systems","day":"01","year":"2021","has_accepted_license":"1"},{"abstract":[{"lang":"eng","text":"We study optimal election sequences for repeatedly selecting a (very) small group of leaders among a set of participants (players) with publicly known unique ids. In every time slot, every player has to select exactly one player that it considers to be the current leader, oblivious to the selection of the other players, but with the overarching goal of maximizing a given parameterized global (“social”) payoff function in the limit. We consider a quite generic model, where the local payoff achieved by a given player depends, weighted by some arbitrary but fixed real parameter, on the number of different leaders chosen in a round, the number of players that choose the given player as the leader, and whether the chosen leader has changed w.r.t. the previous round or not. The social payoff can be the maximum, average or minimum local payoff of the players. Possible applications include quite diverse examples such as rotating coordinator-based distributed algorithms and long-haul formation flying of social birds. Depending on the weights and the particular social payoff, optimal sequences can be very different, from simple round-robin where all players chose the same leader alternatingly every time slot to very exotic patterns, where a small group of leaders (at most 2) is elected in every time slot. Moreover, we study the question if and when a single player would not benefit w.r.t. its local payoff when deviating from the given optimal sequence, i.e., when our optimal sequences are Nash equilibria in the restricted strategy space of oblivious strategies. As this is the case for many parameterizations of our model, our results reveal that no punishment is needed to make it rational for the players to optimize the social payoff."}],"oa_version":"Published Version","scopus_import":"1","month":"01","intvolume":" 289","publication_identifier":{"issn":["0166218X"]},"publication_status":"published","file":[{"success":1,"checksum":"f1039ff5a2d6ca116720efdb84ee9d5e","file_id":"9089","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2021_DiscreteApplMath_Zeiner.pdf","date_created":"2021-02-04T11:28:42Z","file_size":652739,"date_updated":"2021-02-04T11:28:42Z","creator":"dernst"}],"language":[{"iso":"eng"}],"issue":"1","volume":289,"_id":"8793","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2023-08-04T11:12:41Z","ddc":["510"],"file_date_updated":"2021-02-04T11:28:42Z","department":[{"_id":"KrCh"}],"acknowledgement":"We are grateful to Matthias Függer and Thomas Nowak for having raised our interest in the problem studied in this paper.\r\nThis work has been supported the Austrian Science Fund (FWF) projects S11405, S11407 (RiSE), and P28182 (ADynNet).","quality_controlled":"1","publisher":"Elsevier","oa":1,"isi":1,"has_accepted_license":"1","year":"2021","day":"31","publication":"Discrete Applied Mathematics","page":"392-415","date_published":"2021-01-31T00:00:00Z","doi":"10.1016/j.dam.2020.10.022","date_created":"2020-11-22T23:01:26Z","project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.","ieee":"M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.","short":"M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.","apa":"Zeiner, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2020.10.022","ama":"Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 2021;289(1):392-415. doi:10.1016/j.dam.2020.10.022","chicago":"Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.dam.2020.10.022.","ista":"Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 289(1), 392–415."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Martin","full_name":"Zeiner, Martin","last_name":"Zeiner"},{"full_name":"Schmid, Ulrich","last_name":"Schmid","first_name":"Ulrich"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"isi":["000596823800035"]},"title":"Optimal strategies for selecting coordinators"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology. Public Library of Science, 2021. https://doi.org/10.1371/journal.pcbi.1008523.","ista":"Kleshnina M, Streipert SS, Filar JA, Chatterjee K. 2021. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 17(4), e1008523.","mla":"Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008523.","ieee":"M. Kleshnina, S. S. Streipert, J. A. Filar, and K. Chatterjee, “Mistakes can stabilise the dynamics of rock-paper-scissors games,” PLoS Computational Biology, vol. 17, no. 4. Public Library of Science, 2021.","short":"M. Kleshnina, S.S. Streipert, J.A. Filar, K. Chatterjee, PLoS Computational Biology 17 (2021).","ama":"Kleshnina M, Streipert SS, Filar JA, Chatterjee K. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 2021;17(4). doi:10.1371/journal.pcbi.1008523","apa":"Kleshnina, M., Streipert, S. S., Filar, J. A., & Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008523"},"title":"Mistakes can stabilise the dynamics of rock-paper-scissors games","author":[{"id":"4E21749C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Kleshnina","full_name":"Kleshnina, Maria"},{"first_name":"Sabrina S.","full_name":"Streipert, Sabrina S.","last_name":"Streipert"},{"full_name":"Filar, Jerzy A.","last_name":"Filar","first_name":"Jerzy A."},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000639711200001"]},"article_processing_charge":"No","article_number":"e1008523","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"day":"01","publication":"PLoS Computational Biology","has_accepted_license":"1","isi":1,"year":"2021","date_published":"2021-04-01T00:00:00Z","doi":"10.1371/journal.pcbi.1008523","date_created":"2021-05-09T22:01:38Z","acknowledgement":"Authors would like to thank Christian Hilbe and Martin Nowak for their inspiring and very helpful feedback on the manuscript.","publisher":"Public Library of Science","quality_controlled":"1","oa":1,"ddc":["000"],"date_updated":"2023-08-08T13:31:08Z","file_date_updated":"2021-05-11T13:50:06Z","department":[{"_id":"KrCh"}],"_id":"9381","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"date_created":"2021-05-11T13:50:06Z","file_name":"2021_pcbi_Kleshnina.pdf","date_updated":"2021-05-11T13:50:06Z","file_size":1323820,"creator":"kschuh","file_id":"9385","checksum":"a94ebe0c4116f5047eaa6029e54d2dac","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["15537358"],"issn":["1553734X"]},"publication_status":"published","issue":"4","volume":17,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium."}],"month":"04","intvolume":" 17","scopus_import":"1"},{"date_created":"2021-07-11T22:01:15Z","date_published":"2021-06-29T00:00:00Z","doi":"10.1038/s41467-021-24271-w","publication":"Nature Communications","day":"29","year":"2021","has_accepted_license":"1","isi":1,"oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"K.C. acknowledges support from ERC Start grant no. (279307: Graph Games), ERC Consolidator grant no. (863818: ForM-SMart), Austrian Science Fund (FWF) grant no. P23499-N23 and S11407-N23 (RiSE). M.A.N. acknowledges support from Office of Naval Research grant N00014-16-1-2914 and from the John Templeton Foundation.","title":"Fast and strong amplifiers of natural selection","article_processing_charge":"No","external_id":{"isi":["000671752100003"],"pmid":["34188036"]},"author":[{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin A.","full_name":"Nowak, Martin A.","last_name":"Nowak"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers of natural selection. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-24271-w","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-24271-w","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-24271-w.","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009."},"project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"article_number":"4009","ec_funded":1,"volume":12,"issue":"1","language":[{"iso":"eng"}],"file":[{"file_name":"2021_NatCoom_Tkadlec.pdf","date_created":"2021-07-19T13:02:20Z","file_size":628992,"date_updated":"2021-07-19T13:02:20Z","creator":"cziletti","success":1,"file_id":"9692","checksum":"5767418926a7f7fb76151de29473dae0","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"eissn":["20411723"]},"intvolume":" 12","month":"06","scopus_import":"1","pmid":1,"oa_version":"Published Version","abstract":[{"text":"Selection and random drift determine the probability that novel mutations fixate in a population. Population structure is known to affect the dynamics of the evolutionary process. Amplifiers of selection are population structures that increase the fixation probability of beneficial mutants compared to well-mixed populations. Over the past 15 years, extensive research has produced remarkable structures called strong amplifiers which guarantee that every beneficial mutation fixates with high probability. But strong amplification has come at the cost of considerably delaying the fixation event, which can slow down the overall rate of evolution. However, the precise relationship between fixation probability and time has remained elusive. Here we characterize the slowdown effect of strong amplification. First, we prove that all strong amplifiers must delay the fixation event at least to some extent. Second, we construct strong amplifiers that delay the fixation event only marginally as compared to the well-mixed populations. Our results thus establish a tight relationship between fixation probability and time: Strong amplification always comes at a cost of a slowdown, but more than a marginal slowdown is not needed.","lang":"eng"}],"file_date_updated":"2021-07-19T13:02:20Z","department":[{"_id":"KrCh"}],"ddc":["510"],"date_updated":"2023-08-10T14:05:09Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"9640"},{"oa_version":"Preprint","abstract":[{"text":"We consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on the assertion violation probability. The main novelty of our approach is that we prove new and dedicated fixed-point theorems which serve as the theoretical basis of our algorithms and enable us to reason about assertion violation bounds in terms of pre and post fixed-point functions. To synthesize such fixed-points, we devise algorithms that utilize a wide range of mathematical tools, including repulsing ranking supermartingales, Hoeffding's lemma, Minkowski decompositions, Jensen's inequality, and convex optimization. On the theoretical side, we provide (i) the first automated algorithm for lower-bounds on assertion violation probabilities, (ii) the first complete algorithm for upper-bounds of exponential form in affine programs, and (iii) provably and significantly tighter upper-bounds than the previous approaches. On the practical side, we show our algorithms can handle a wide variety of programs from the literature and synthesize bounds that are remarkably tighter than previous results, in some cases by thousands of orders of magnitude.","lang":"eng"}],"month":"06","main_file_link":[{"url":"https://arxiv.org/abs/2011.14617","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781450383912"]},"ec_funded":1,"_id":"9646","status":"public","conference":{"name":"PLDI: Programming Language Design and Implementation","start_date":"2021-06-20","location":"Online","end_date":"2021-06-26"},"type":"conference","date_updated":"2023-08-10T14:14:08Z","department":[{"_id":"KrCh"}],"acknowledgement":"We are very thankful to the anonymous reviewers for the helpful and valuable comments. The work was partially supported by the National Natural Science Foundation of China (NSFC) Grant No. 61802254, the Huawei Innovation Research Program, the ERC CoG 863818 (ForM-SMArt), the Facebook PhD Fellowship Program and DOC Fellowship #24956 of the Austrian Academy of Sciences (ÖAW).","oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","day":"01","year":"2021","isi":1,"date_created":"2021-07-11T22:01:18Z","date_published":"2021-06-01T00:00:00Z","doi":"10.1145/3453483.3454102","page":"1171-1186","project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.","ama":"Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. Quantitative analysis of assertion violations in probabilistic programs. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1171-1186. doi:10.1145/3453483.3454102","apa":"Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454102","ieee":"J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.","short":"J. Wang, Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–1186.","chicago":"Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454102.","ista":"Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. 2021. Quantitative analysis of assertion violations in probabilistic programs. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1171–1186."},"title":"Quantitative analysis of assertion violations in probabilistic programs","external_id":{"arxiv":["2011.14617"],"isi":["000723661700076"]},"article_processing_charge":"No","author":[{"first_name":"Jinyi","full_name":"Wang, Jinyi","last_name":"Wang"},{"first_name":"Yican","last_name":"Sun","full_name":"Sun, Yican"},{"last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"}]},{"status":"public","type":"conference","conference":{"start_date":"2021-06-20","location":"Online","end_date":"2021-06-26","name":" PLDI: Programming Language Design and Implementation"},"_id":"9645","department":[{"_id":"KrCh"}],"date_updated":"2023-08-10T14:13:39Z","month":"06","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-03183862/"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis.\r\n\r\nWe first show that our IRW-based approach is sound and complete for reachability analysis of imperative programs. Then, we focus on linear and polynomial programs and develop automated methods for synthesizing linear and polynomial IRWs. In the linear case, we follow the well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial case, where we present a push-button semi-complete algorithm. We achieve this using a novel combination of classical theorems in real algebraic geometry, such as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally, our experimental results show we can prove complex reachability objectives over various benchmarks that were beyond the reach of previous methods."}],"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450383912"]},"publication_status":"published","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"title":"Polynomial reachability witnesses via Stellensätze","author":[{"last_name":"Asadi","full_name":"Asadi, Ali","first_name":"Ali"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"full_name":"Mahdavi, Mohammad","last_name":"Mahdavi","first_name":"Mohammad"}],"external_id":{"isi":["000723661700050"]},"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 772–787.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454076.","ieee":"A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.","short":"A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–787.","ama":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. Polynomial reachability witnesses via Stellensätze. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:772-787. doi:10.1145/3453483.3454076","apa":"Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076","mla":"Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–87, doi:10.1145/3453483.3454076."},"quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the National Natural Science Foundation of China (NSFC) Grant No. 61802254, the Huawei Innovation Research Program, the Facebook PhD Fellowship Program, and DOC Fellowship No. 24956 of the Austrian Academy of Sciences (ÖAW).","doi":"10.1145/3453483.3454076","date_published":"2021-06-01T00:00:00Z","date_created":"2021-07-11T22:01:17Z","page":"772-787","day":"01","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","isi":1,"year":"2021"},{"date_updated":"2023-08-14T06:51:33Z","department":[{"_id":"KrCh"}],"_id":"10002","status":"public","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"type":"conference","conference":{"name":"LICS: Symposium on Logic in Computer Science","location":"Rome, Italy","end_date":"2021-07-02","start_date":"2021-06-29"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-6654-4896-3"],"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"]},"publication_status":"published","ec_funded":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 ."}],"month":"07","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07466"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.","ista":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.","ieee":"K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","short":"K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ama":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739","apa":"Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739"},"title":"Symbolic time and space tradeoffs for probabilistic verification","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dvorak","full_name":"Dvorak, Wolfgang","first_name":"Wolfgang"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"external_id":{"isi":["000947350400089"],"arxiv":["2104.07466"]},"article_processing_charge":"No","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"day":"07","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","isi":1,"year":"2021","date_published":"2021-07-07T00:00:00Z","doi":"10.1109/LICS52264.2021.9470739","date_created":"2021-09-12T22:01:24Z","page":"1-13","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","oa":1},{"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"]},"month":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07278"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.","lang":"eng"}],"department":[{"_id":"KrCh"}],"date_updated":"2023-08-14T06:52:07Z","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"status":"public","conference":{"name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","location":"Rome, Italy","end_date":"2021-07-02"},"type":"conference","_id":"10004","date_created":"2021-09-12T22:01:25Z","doi":"10.1109/LICS52264.2021.9470595","date_published":"2021-07-07T00:00:00Z","page":"1-13","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"07","year":"2021","isi":1,"oa":1,"publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","title":"Stochastic processes with expected stopping time","external_id":{"arxiv":["2104.07278"],"isi":["000947350400036"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.","ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.","apa":"Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13."},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}]},{"publication_status":"published","publication_identifier":{"isbn":["978-3-9597-7180-1"],"issn":["1868-8969"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"17432a05733f408de300e17e390a90e4","file_id":"10063","file_size":720250,"date_updated":"2021-10-01T09:55:00Z","creator":"cchlebak","file_name":"2021_LIPIcs_Jecker.pdf","date_created":"2021-10-01T09:55:00Z"}],"ec_funded":1,"volume":187,"abstract":[{"lang":"eng","text":"Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 187","month":"03","date_updated":"2023-08-14T07:03:23Z","ddc":["000"],"file_date_updated":"2021-10-01T09:55:00Z","department":[{"_id":"KrCh"}],"_id":"10055","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2021-03-19","location":"Saarbrücken, Germany","start_date":"2021-03-16"},"type":"conference","status":"public","year":"2021","isi":1,"has_accepted_license":"1","publication":"38th International Symposium on Theoretical Aspects of Computer Science","day":"10","date_created":"2021-09-27T14:33:15Z","date_published":"2021-03-10T00:00:00Z","doi":"10.4230/LIPIcs.STACS.2021.44","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman for their valuable insights concerning Green’s relations.","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","citation":{"ama":"Jecker IR. A Ramsey theorem for finite monoids. In: 38th International Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.","ista":"Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.","chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In 38th International Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.44."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000635691700044"]},"article_processing_charge":"No","author":[{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","last_name":"Jecker"}],"title":"A Ramsey theorem for finite monoids","article_number":"44","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}]},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","page":"341-366","doi":"10.1007/978-3-030-81685-8_16","date_published":"2021-07-15T00:00:00Z","date_created":"2021-09-05T22:01:24Z","has_accepted_license":"1","isi":1,"year":"2021","day":"15","publication":"33rd International Conference on Computer-Aided Verification ","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"author":[{"last_name":"Agarwal","full_name":"Agarwal, Pratyush","first_name":"Pratyush"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Shreya","last_name":"Pathak","full_name":"Pathak, Shreya"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor"}],"external_id":{"arxiv":["2105.06424"],"isi":["000698732400016"]},"article_processing_charge":"Yes","title":"Stateless model checking under a reads-value-from equivalence","citation":{"ista":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.","chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.","apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16","ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16","short":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.","ieee":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.","mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","alternative_title":["LNCS"],"month":"07","abstract":[{"lang":"eng","text":"Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, RVF-SMC generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task."}],"oa_version":"Published Version","volume":"12759 ","related_material":{"record":[{"relation":"dissertation_contains","id":"10199","status":"public"}]},"ec_funded":1,"publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-030-81684-1"],"issn":["0302-9743"],"eisbn":["978-3-030-81685-8"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"11368","checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","file_size":1516756,"date_updated":"2022-05-13T07:00:20Z","creator":"dernst","file_name":"2021_LNCS_Agarwal.pdf","date_created":"2022-05-13T07:00:20Z"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"name":"CAV: Computer Aided Verification ","start_date":"2021-07-20","location":"Virtual","end_date":"2021-07-23"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"9987","department":[{"_id":"KrCh"}],"file_date_updated":"2022-05-13T07:00:20Z","date_updated":"2023-09-07T13:30:27Z","ddc":["000"]},{"article_processing_charge":"No","external_id":{"arxiv":["2011.11763"]},"author":[{"full_name":"Bui, Truc Lam","last_name":"Bui","first_name":"Truc Lam"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Gautam","full_name":"Gautam, Tushar","first_name":"Tushar"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman"}],"title":"The reads-from equivalence for the TSO and PSO memory models","citation":{"mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"article_number":"164","date_created":"2021-10-27T15:05:34Z","doi":"10.1145/3485541","date_published":"2021-10-15T00:00:00Z","year":"2021","has_accepted_license":"1","publication":"Proceedings of the ACM on Programming Languages","day":"15","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"file_date_updated":"2021-11-04T07:24:48Z","date_updated":"2023-09-07T13:30:27Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","keyword":["safety","risk","reliability and quality","software"],"status":"public","_id":"10191","ec_funded":1,"volume":5,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"issue":"OOPSLA","publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"10215","checksum":"9d6dce7b611853c529bb7b1915ac579e","success":1,"date_updated":"2021-11-04T07:24:48Z","file_size":2903485,"creator":"cchlebak","date_created":"2021-11-04T07:24:48Z","file_name":"2021_ProcACMPL_Bui.pdf"}],"scopus_import":"1","intvolume":" 5","month":"10","abstract":[{"text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n","lang":"eng"}],"oa_version":"Published Version"},{"year":"2021","has_accepted_license":"1","day":"31","page":"166","date_created":"2021-10-29T20:09:01Z","date_published":"2021-10-31T00:00:00Z","doi":"10.15479/at:ista:10199","oa":1,"publisher":"Institute of Science and Technology Austria","citation":{"mla":"Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.","apa":"Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor","last_name":"Toman","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X"}],"title":"Improved verification techniques for concurrent systems","project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"10225","checksum":"4f412a1ee60952221b499a4b1268df35","file_size":2915234,"date_updated":"2021-11-08T14:12:22Z","creator":"vtoman","file_name":"toman_th_final.pdf","date_created":"2021-11-08T14:12:22Z"},{"file_name":"toman_thesis.zip","date_created":"2021-11-08T14:12:46Z","file_size":8616056,"date_updated":"2021-11-09T09:00:50Z","creator":"vtoman","checksum":"9584943f99127be2dd2963f6784c37d4","file_id":"10226","content_type":"application/zip","relation":"source_file","access_level":"closed"}],"ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"10190"},{"relation":"part_of_dissertation","status":"public","id":"10191"},{"relation":"part_of_dissertation","id":"9987","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"141"}]},"abstract":[{"lang":"eng","text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness."}],"acknowledged_ssus":[{"_id":"SSU"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"10","date_updated":"2023-09-19T09:59:54Z","supervisor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"ddc":["000"],"file_date_updated":"2021-11-09T09:00:50Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"_id":"10199","type":"dissertation","keyword":["concurrency","verification","model checking"],"status":"public"},{"publisher":"Elsevier","quality_controlled":"1","oa":1,"doi":"10.1016/j.artint.2021.103499","date_published":"2021-03-16T00:00:00Z","date_created":"2021-03-28T22:01:40Z","isi":1,"year":"2021","day":"16","publication":"Artificial Intelligence","article_number":"103499","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Dvořák, Wolfgang","last_name":"Dvořák","first_name":"Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"external_id":{"arxiv":["1804.07031"],"isi":["000657537500003"]},"article_processing_charge":"No","title":"Algorithms and conditional lower bounds for planning problems","citation":{"mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2021.103499","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 2021;297(8). doi:10.1016/j.artint.2021.103499","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"month":"03","intvolume":" 297","abstract":[{"text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.","lang":"eng"}],"oa_version":"Preprint","issue":"8","related_material":{"record":[{"id":"35","status":"public","relation":"earlier_version"}]},"volume":297,"publication_identifier":{"issn":["0004-3702"]},"publication_status":"published","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","_id":"9293","department":[{"_id":"KrCh"}],"date_updated":"2023-09-26T10:41:42Z"},{"month":"09","intvolume":" 57","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07384"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"volume":57,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0925-9856"],"eissn":["1572-8102"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","_id":"9393","department":[{"_id":"KrCh"}],"date_updated":"2023-10-10T11:13:20Z","publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.","doi":"10.1007/s10703-021-00373-5","date_published":"2021-09-01T00:00:00Z","date_created":"2021-05-16T22:01:47Z","page":"401-428","day":"01","publication":"Formal Methods in System Design","isi":1,"year":"2021","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Faster algorithms for quantitative verification in bounded treewidth graphs","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"external_id":{"isi":["000645490300001"],"arxiv":["1504.07384"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5."}},{"abstract":[{"lang":"eng","text":"We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it handles programs with non-determinism, provides relative completeness guarantees and supports programs with polynomial arithmetic. The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving a non-trivial improvement under a proper configuration of its parameters."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.01189"}],"scopus_import":"1","month":"06","publication_status":"published","publication_identifier":{"isbn":["9781450383912"]},"language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14539"}]},"_id":"9644","conference":{"name":"PLDI: Programming Language Design and Implementation","start_date":"2021-06-20","end_date":"2021-06-26","location":"Online"},"type":"conference","status":"public","date_updated":"2023-11-30T10:55:37Z","department":[{"_id":"KrCh"}],"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was partially supported by the ERCCoG 863818 (ForM-SMArt) and the Czech Science Foundation grant No. GJ19-15134Y.","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","year":"2021","isi":1,"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","day":"01","page":"1033-1048","date_created":"2021-07-11T22:01:17Z","doi":"10.1145/3453483.3454093","date_published":"2021-06-01T00:00:00Z","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.","short":"K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454093","ama":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1033-1048. doi:10.1145/3453483.3454093","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.","ista":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","external_id":{"arxiv":["2104.01189"],"isi":["000723661700067"]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Ehsan Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic"}],"title":"Proving non-termination by program reversal"},{"department":[{"_id":"KrCh"}],"date_updated":"2024-01-17T08:19:41Z","status":"public","type":"conference","conference":{"location":"Virtual","end_date":"2021-11-26","start_date":"2021-11-20","name":"FM: Formal Methods"},"_id":"10414","related_material":{"record":[{"id":"14539","status":"public","relation":"dissertation_contains"},{"id":"14778","status":"public","relation":"later_version"}]},"volume":13047,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-030-90870-6"],"eissn":["1611-3349"],"isbn":["9-783-0309-0869-0"],"issn":["0302-9743"]},"publication_status":"published","month":"11","intvolume":" 13047","scopus_import":"1","alternative_title":["LNCS"],"main_file_link":[{"url":"https://arxiv.org/abs/2108.02188","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs."}],"title":"On lexicographic proof rules for probabilistic termination","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Ehsan Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar"},{"full_name":"Novotný, Petr","last_name":"Novotný","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zárevúcky, Jiří","last_name":"Zárevúcky","first_name":"Jiří"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"article_processing_charge":"No","external_id":{"isi":["000758218600033"],"arxiv":["2108.02188"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.","short":"K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.","ama":"Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” 24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33."},"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-030-90870-6_33","date_published":"2021-11-10T00:00:00Z","date_created":"2021-12-05T23:01:45Z","page":"619-639","day":"10","publication":"24th International Symposium on Formal Methods","isi":1,"year":"2021","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385."},{"month":"01","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.\r\nWe use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades.","lang":"eng"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","related_material":{"record":[{"status":"public","id":"1386","relation":"part_of_dissertation"},{"status":"public","id":"1437","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"311","status":"public"},{"relation":"part_of_dissertation","id":"6056","status":"public"},{"status":"public","id":"6380","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"639","status":"public"},{"status":"public","id":"66","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"6780","status":"public"},{"relation":"part_of_dissertation","id":"6918","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"7810"},{"relation":"part_of_dissertation","id":"6175","status":"public"},{"relation":"part_of_dissertation","id":"6378","status":"public"},{"relation":"part_of_dissertation","id":"6490","status":"public"},{"status":"public","id":"7014","relation":"part_of_dissertation"},{"status":"public","id":"8089","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8728"},{"relation":"part_of_dissertation","status":"public","id":"7158"},{"status":"public","id":"5977","relation":"part_of_dissertation"},{"status":"public","id":"6009","relation":"part_of_dissertation"},{"id":"6340","status":"public","relation":"part_of_dissertation"},{"id":"949","status":"public","relation":"part_of_dissertation"}]},"language":[{"iso":"eng"}],"file":[{"file_id":"8969","checksum":"d1b9db3725aed34dadd81274aeb9426c","embargo":"2021-12-22","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-12-22T20:08:44Z","file_name":"Thesis-pdfa.pdf","creator":"akafshda","date_updated":"2021-12-23T23:30:04Z","file_size":5251507},{"file_name":"source.zip","date_created":"2020-12-22T20:08:50Z","creator":"akafshda","file_size":10636756,"date_updated":"2021-03-04T23:30:04Z","file_id":"8970","checksum":"1661df7b393e6866d2460eba3c905130","relation":"source_file","access_level":"closed","embargo_to":"open_access","content_type":"application/zip"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"status":"public","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"type":"dissertation","_id":"8934","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"file_date_updated":"2021-12-23T23:30:04Z","ddc":["005"],"date_updated":"2023-09-22T10:03:21Z","supervisor":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"oa":1,"publisher":"Institute of Science and Technology Austria","acknowledgement":"The research was partially supported by an IBM PhD fellowship, a Facebook PhD fellowship, and DOC fellowship #24956 of the Austrian Academy of Sciences (OeAW).","date_created":"2020-12-10T12:17:07Z","date_published":"2021-01-01T00:00:00Z","doi":"10.15479/AT:ISTA:8934","page":"278","day":"01","year":"2021","has_accepted_license":"1","project":[{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"title":"Parameterized and algebro-geometric advances in static program analysis","article_processing_charge":"No","author":[{"orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:8934.","ista":"Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria.","mla":"Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934.","apa":"Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934","ama":"Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:10.15479/AT:ISTA:8934","ieee":"A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.","short":"A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021."}},{"publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2021-11-17T00:00:00Z","doi":"10.15479/at:ista:10293","date_created":"2021-11-15T17:12:57Z","page":"171","day":"17","has_accepted_license":"1","year":"2021","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"Evolution of cooperation via (in)direct reciprocity under imperfect information","author":[{"first_name":"Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","last_name":"Schmid"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10293.","ista":"Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.","mla":"Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293.","ieee":"L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021.","short":"L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021.","apa":"Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293","ama":"Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:10.15479/at:ista:10293"},"month":"11","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more\r\nthan their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations\r\nare more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient.","lang":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"9997","status":"public"},{"status":"public","id":"2","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9402"}]},"ec_funded":1,"file":[{"relation":"source_file","access_level":"closed","embargo_to":"open_access","content_type":"application/zip","checksum":"86a05b430756ca12ae8107b6e6f3c1e5","file_id":"10305","creator":"lschmid","file_size":29703124,"date_updated":"2022-12-20T23:30:08Z","file_name":"submission_new.zip","date_created":"2021-11-18T12:41:46Z"},{"file_size":8320985,"date_updated":"2022-12-20T23:30:08Z","creator":"lschmid","file_name":"thesis_new_upload.pdf","date_created":"2021-11-18T12:59:15Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","embargo":"2022-10-18","file_id":"10306","checksum":"d940af042e94660c6b6a7b4f0b184d47"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","status":"public","type":"dissertation","_id":"10293","file_date_updated":"2022-12-20T23:30:08Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"ddc":["519","576"],"supervisor":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"date_updated":"2023-11-07T08:28:29Z"},{"doi":"10.1038/s41598-021-96932-1","date_published":"2021-08-31T00:00:00Z","date_created":"2021-09-11T16:22:02Z","day":"31","publication":"Scientific Reports","isi":1,"has_accepted_license":"1","year":"2021","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). L.S. received additional partial support by the Austrian Science Fund (FWF) under Grant Z211-N23 (Wittgenstein Award).","title":"The evolution of indirect reciprocity under action and assessment generosity","author":[{"last_name":"Schmid","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","first_name":"Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Shati","full_name":"Shati, Pouya","first_name":"Pouya"},{"first_name":"Christian","full_name":"Hilbe, Christian","last_name":"Hilbe"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"external_id":{"isi":["000692406400018"],"pmid":["34465830"]},"article_processing_charge":"Yes","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-96932-1.","ista":"Schmid L, Shati P, Hilbe C, Chatterjee K. 2021. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 11(1), 17443.","mla":"Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.","ieee":"L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021.","short":"L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).","apa":"Schmid, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-96932-1","ama":"Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 2021;11(1). doi:10.1038/s41598-021-96932-1"},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"article_number":"17443","issue":"1","related_material":{"record":[{"id":"10293","status":"public","relation":"dissertation_contains"}]},"volume":11,"ec_funded":1,"file":[{"file_name":"2021_ScientificReports_Schmid.pdf","date_created":"2021-09-13T10:31:21Z","creator":"cchlebak","file_size":2424943,"date_updated":"2021-09-13T10:31:21Z","success":1,"checksum":"19df8816cf958b272b85841565c73182","file_id":"10006","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2045-2322"]},"publication_status":"published","month":"08","intvolume":" 11","pmid":1,"oa_version":"Published Version","abstract":[{"text":"Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms.","lang":"eng"}],"file_date_updated":"2021-09-13T10:31:21Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"ddc":["003"],"date_updated":"2024-03-27T23:30:44Z","status":"public","keyword":["Multidisciplinary"],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"9997"}]