[{"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"abstract":[{"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.","lang":"eng"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"date_published":"2021-07-02T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","quality_controlled":"1","volume":198,"department":[{"_id":"KrCh"}],"year":"2021","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.","citation":{"apa":"Chatterjee, K., Henzinger, M. H., Kale, S. S., &#38; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In <i>48th International Colloquium on Automata, Languages, and Programming</i> (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In <i>48th International Colloquium on Automata, Languages, and Programming</i>, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” <i>48th International Colloquium on Automata, Languages, and Programming</i>, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>.","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.","ama":"Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: <i>48th International Colloquium on Automata, Languages, and Programming</i>. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>","ieee":"K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in <i>48th International Colloquium on Automata, Languages, and Programming</i>, 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."},"date_created":"2021-09-27T14:33:15Z","article_number":"124","ec_funded":1,"_id":"10054","file_date_updated":"2021-10-01T08:49:26Z","doi":"10.4230/LIPIcs.ICALP.2021.124","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Kale, Sagar Sudhir","first_name":"Sagar Sudhir","last_name":"Kale"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-195-5"]},"month":"07","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2021-07-12","location":"Glasgow, Scotland","end_date":"2021-07-16"},"file":[{"creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","file_size":854576,"relation":"main_file","checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","file_name":"2021_LIPIcs_Chatterjee.pdf","file_id":"10062","success":1,"date_updated":"2021-10-01T08:49:26Z","date_created":"2021-10-01T08:49:26Z"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","day":"02","status":"public","type":"conference","alternative_title":["LIPIcs"],"article_processing_charge":"No","oa":1,"date_updated":"2025-07-14T09:10:08Z","title":"Faster algorithms for bounded liveness in graphs and game graphs","intvolume":"       198","scopus_import":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"48th International Colloquium on Automata, Languages, and Programming"},{"publication":"38th International Symposium on Theoretical Aspects of Computer Science","language":[{"iso":"eng"}],"has_accepted_license":"1","scopus_import":"1","intvolume":"       187","isi":1,"title":"A Ramsey theorem for finite monoids","article_processing_charge":"No","oa":1,"date_updated":"2023-08-14T07:03:23Z","status":"public","type":"conference","alternative_title":["LIPIcs"],"file":[{"creator":"cchlebak","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_size":720250,"checksum":"17432a05733f408de300e17e390a90e4","file_id":"10063","file_name":"2021_LIPIcs_Jecker.pdf","success":1,"date_updated":"2021-10-01T09:55:00Z","date_created":"2021-10-01T09:55:00Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"10","oa_version":"Published Version","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7180-1"]},"month":"03","conference":{"location":"Saarbrücken, Germany","end_date":"2021-03-19","name":"STACS: Symposium on Theoretical Aspects of Computer Science","start_date":"2021-03-16"},"author":[{"first_name":"Ismael R","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker"}],"doi":"10.4230/LIPIcs.STACS.2021.44","_id":"10055","file_date_updated":"2021-10-01T09:55:00Z","article_number":"44","ec_funded":1,"date_created":"2021-09-27T14:33:15Z","citation":{"chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Vol. 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>.","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.","ama":"Jecker IR. A Ramsey theorem for finite monoids. In: <i>38th International Symposium on Theoretical Aspects of Computer Science</i>. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>","ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Saarbrücken, Germany, 2021, vol. 187.","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In <i>38th International Symposium on Theoretical Aspects of Computer Science</i> (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>"},"year":"2021","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.","quality_controlled":"1","volume":187,"department":[{"_id":"KrCh"}],"date_published":"2021-03-10T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"abstract":[{"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.","lang":"eng"}],"external_id":{"isi":["000635691700044"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"publication_status":"published"},{"doi":"10.4230/LIPIcs.MFCS.2021.53","_id":"10075","file_date_updated":"2021-10-06T12:44:05Z","article_number":"53","ec_funded":1,"date_created":"2021-10-03T22:01:23Z","citation":{"apa":"Guha, S., Jecker, I. R., Lehtinen, K., &#38; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In <i>46th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>","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 <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, 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: <i>46th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>","chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>.","mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>.","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."},"year":"2021","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.","quality_controlled":"1","volume":202,"department":[{"_id":"KrCh"}],"date_published":"2021-08-18T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"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"}],"external_id":{"arxiv":["2105.02611"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"publication_status":"published","publication":"46th International Symposium on Mathematical Foundations of Computer Science","language":[{"iso":"eng"}],"scopus_import":"1","has_accepted_license":"1","intvolume":"       202","title":"A bit of nondeterminism makes pushdown automata expressive and succinct","article_processing_charge":"No","oa":1,"date_updated":"2022-05-13T08:21:56Z","status":"public","type":"conference","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2021-10-06T12:44:05Z","date_created":"2021-10-06T12:44:05Z","file_id":"10097","file_name":"2021_LIPIcs_Guha.pdf","checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","success":1,"file_size":825567,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"cchlebak"}],"oa_version":"Published Version","day":"18","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7201-3"]},"month":"08","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2021-08-23","location":"Tallinn, Estonia","end_date":"2021-08-27"},"arxiv":1,"author":[{"last_name":"Guha","first_name":"Shibashis","full_name":"Guha, Shibashis"},{"last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","first_name":"Ismael R"},{"last_name":"Lehtinen","first_name":"Karoliina","full_name":"Lehtinen, Karoliina"},{"first_name":"Martin","full_name":"Zimmermann, Martin","last_name":"Zimmermann"}]},{"file_date_updated":"2021-11-04T07:24:48Z","article_type":"original","_id":"10191","doi":"10.1145/3485541","date_created":"2021-10-27T15:05:34Z","citation":{"apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>.","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.","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>"},"keyword":["safety","risk","reliability and quality","software"],"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.","year":"2021","ec_funded":1,"article_number":"164","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10199"}]},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"volume":5,"quality_controlled":"1","publisher":"Association for Computing Machinery","date_published":"2021-10-15T00:00:00Z","publication_status":"published","external_id":{"arxiv":["2011.11763"]},"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"}],"ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","title":"The reads-from equivalence for the TSO and PSO memory models","oa":1,"date_updated":"2025-07-14T09:10:16Z","article_processing_charge":"No","issue":"OOPSLA","has_accepted_license":"1","scopus_import":"1","intvolume":"         5","type":"journal_article","status":"public","author":[{"last_name":"Bui","first_name":"Truc Lam","full_name":"Bui, Truc Lam"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Gautam","full_name":"Gautam, Tushar","first_name":"Tushar"},{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"orcid":"0000-0001-9036-063X","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","first_name":"Viktor"}],"arxiv":1,"day":"15","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_updated":"2021-11-04T07:24:48Z","date_created":"2021-11-04T07:24:48Z","checksum":"9d6dce7b611853c529bb7b1915ac579e","file_id":"10215","file_name":"2021_ProcACMPL_Bui.pdf","success":1,"access_level":"open_access","relation":"main_file","file_size":2903485,"content_type":"application/pdf","creator":"cchlebak"}],"month":"10","publication_identifier":{"eissn":["2475-1421"]}},{"alternative_title":["ISTA Thesis"],"type":"dissertation","status":"public","month":"10","publication_identifier":{"issn":["2663-337X"]},"day":"31","oa_version":"Published Version","file":[{"relation":"main_file","content_type":"application/pdf","file_size":2915234,"access_level":"open_access","creator":"vtoman","date_created":"2021-11-08T14:12:22Z","date_updated":"2021-11-08T14:12:22Z","file_name":"toman_th_final.pdf","checksum":"4f412a1ee60952221b499a4b1268df35","file_id":"10225"},{"creator":"vtoman","content_type":"application/zip","file_size":8616056,"access_level":"closed","relation":"source_file","checksum":"9584943f99127be2dd2963f6784c37d4","file_name":"toman_thesis.zip","file_id":"10226","date_created":"2021-11-08T14:12:46Z","date_updated":"2021-11-09T09:00:50Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Toman, Viktor","first_name":"Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2025-07-14T09:10:16Z","oa":1,"article_processing_charge":"No","title":"Improved verification techniques for concurrent systems","publisher":"Institute of Science and Technology Austria","date_published":"2021-10-31T00:00:00Z","supervisor":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"page":"166","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"ddc":["000"],"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."}],"publication_status":"published","doi":"10.15479/at:ista:10199","file_date_updated":"2021-11-09T09:00:50Z","_id":"10199","acknowledged_ssus":[{"_id":"SSU"}],"ec_funded":1,"degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","id":"10190","status":"public"},{"status":"public","id":"9987","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"141"},{"status":"public","relation":"part_of_dissertation","id":"10191"}]},"year":"2021","date_created":"2021-10-29T20:09:01Z","citation":{"apa":"Toman, V. (2021). <i>Improved verification techniques for concurrent systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>","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.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>","mla":"Toman, Viktor. <i>Improved Verification Techniques for Concurrent Systems</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>."},"keyword":["concurrency","verification","model checking"]},{"ec_funded":1,"degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","id":"9997","status":"public"},{"id":"2","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9402"}]},"citation":{"mla":"Schmid, Laura. <i>Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10293\">10.15479/at:ista:10293</a>.","ista":"Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.","chicago":"Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10293\">https://doi.org/10.15479/at:ista:10293</a>.","ama":"Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10293\">10.15479/at:ista:10293</a>","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). <i>Evolution of cooperation via (in)direct reciprocity under imperfect information</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10293\">https://doi.org/10.15479/at:ista:10293</a>"},"date_created":"2021-11-15T17:12:57Z","year":"2021","doi":"10.15479/at:ista:10293","file_date_updated":"2022-12-20T23:30:08Z","_id":"10293","abstract":[{"lang":"eng","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."}],"ddc":["519","576"],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"page":"171","publisher":"Institute of Science and Technology Austria","supervisor":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"date_published":"2021-11-17T00:00:00Z","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"has_accepted_license":"1","title":"Evolution of cooperation via (in)direct reciprocity under imperfect information","oa":1,"date_updated":"2025-07-14T09:10:09Z","article_processing_charge":"No","language":[{"iso":"eng"}],"day":"17","oa_version":"Published Version","file":[{"file_name":"submission_new.zip","file_id":"10305","checksum":"86a05b430756ca12ae8107b6e6f3c1e5","date_created":"2021-11-18T12:41:46Z","date_updated":"2022-12-20T23:30:08Z","creator":"lschmid","embargo_to":"open_access","file_size":29703124,"relation":"source_file","content_type":"application/zip","access_level":"closed"},{"embargo":"2022-10-18","file_name":"thesis_new_upload.pdf","file_id":"10306","checksum":"d940af042e94660c6b6a7b4f0b184d47","date_created":"2021-11-18T12:59:15Z","date_updated":"2022-12-20T23:30:08Z","creator":"lschmid","file_size":8320985,"content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"11","publication_identifier":{"issn":["2663-337X"]},"author":[{"orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","full_name":"Schmid, Laura","first_name":"Laura"}],"alternative_title":["ISTA Thesis"],"status":"public","type":"dissertation"},{"publication_status":"published","abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["2108.02188"],"isi":["000758218600033"]},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"}],"volume":13047,"quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"619-639","date_published":"2021-11-10T00:00:00Z","publisher":"Springer Nature","citation":{"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: <i>24th International Symposium on Formal Methods</i>. Vol 13047. Springer Nature; 2021:619-639. doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in <i>24th International Symposium on Formal Methods</i>, Virtual, 2021, vol. 13047, pp. 619–639.","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 <i>24th International Symposium on Formal Methods</i>, 13047:619–39. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>.","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” <i>24th International Symposium on Formal Methods</i>, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>.","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., &#38; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In <i>24th International Symposium on Formal Methods</i> (Vol. 13047, pp. 619–639). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>"},"date_created":"2021-12-05T23:01:45Z","year":"2021","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.","related_material":{"record":[{"relation":"dissertation_contains","id":"14539","status":"public"},{"status":"public","relation":"later_version","id":"14778"}]},"ec_funded":1,"_id":"10414","doi":"10.1007/978-3-030-90870-6_33","arxiv":1,"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar","last_name":"Goharshady"},{"full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zárevúcky","full_name":"Zárevúcky, Jiří","first_name":"Jiří"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","orcid":"0000-0002-4681-1699"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/2108.02188","open_access":"1"}],"day":"10","oa_version":"Preprint","publication_identifier":{"isbn":["9-783-0309-0869-0"],"eissn":["1611-3349"],"eisbn":["978-3-030-90870-6"],"issn":["0302-9743"]},"month":"11","conference":{"start_date":"2021-11-20","name":"FM: Formal Methods","end_date":"2021-11-26","location":"Virtual"},"status":"public","type":"conference","alternative_title":["LNCS"],"title":"On lexicographic proof rules for probabilistic termination","article_processing_charge":"No","date_updated":"2025-07-14T09:10:11Z","oa":1,"intvolume":"     13047","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"publication":"24th International Symposium on Formal Methods"},{"article_processing_charge":"No","date_updated":"2022-01-17T10:39:40Z","oa":1,"title":"Quantitative verification on product graphs of small treewidth","intvolume":"       213","scopus_import":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"}],"month":"11","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"conference":{"location":"Virtual","end_date":"2021-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_created":"2022-01-17T10:36:08Z","date_updated":"2022-01-17T10:36:08Z","success":1,"checksum":"71141acdeffa9056f24d6dbef952d254","file_id":"10633","file_name":"2021_LIPIcs_Chatterjee.pdf","relation":"main_file","access_level":"open_access","file_size":891566,"content_type":"application/pdf","creator":"cchlebak"}],"oa_version":"Published Version","day":"29","type":"conference","status":"public","alternative_title":["LIPIcs"],"year":"2021","date_created":"2022-01-16T23:01:28Z","citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 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.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>.","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.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>"},"article_number":"42","_id":"10629","file_date_updated":"2022-01-17T10:36:08Z","doi":"10.4230/LIPIcs.FSTTCS.2021.42","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"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^{-λ})."}],"date_published":"2021-11-29T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","volume":213,"department":[{"_id":"KrCh"}]},{"publication_status":"published","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."}],"external_id":{"arxiv":["2110.01279"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"volume":213,"quality_controlled":"1","department":[{"_id":"KrCh"}],"date_published":"2021-11-29T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","date_created":"2022-01-16T23:01:29Z","citation":{"apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &#38; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>","ieee":"E. Arrighi <i>et al.</i>, “On the complexity of intersection non-emptiness for star-free language classes,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>","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.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>.","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 <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>."},"year":"2021","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","article_number":"34","ec_funded":1,"_id":"10630","file_date_updated":"2022-01-17T10:49:03Z","doi":"10.4230/LIPIcs.FSTTCS.2021.34","arxiv":1,"author":[{"first_name":"Emmanuel","full_name":"Arrighi, Emmanuel","last_name":"Arrighi"},{"last_name":"Fernau","full_name":"Fernau, Henning","first_name":"Henning"},{"last_name":"Hoffmann","first_name":"Stefan","full_name":"Hoffmann, Stefan"},{"first_name":"Markus","full_name":"Holzer, Markus","last_name":"Holzer"},{"last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R"},{"first_name":"Mateus","full_name":"De Oliveira Oliveira, Mateus","last_name":"De Oliveira Oliveira"},{"last_name":"Wolf","full_name":"Wolf, Petra","first_name":"Petra"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_updated":"2022-01-17T10:49:03Z","date_created":"2022-01-17T10:49:03Z","file_id":"10634","file_name":"2021_LIPIcs_Arrighi.pdf","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","success":1,"access_level":"open_access","file_size":844224,"relation":"main_file","content_type":"application/pdf","creator":"cchlebak"}],"oa_version":"Published Version","day":"29","month":"11","publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"conference":{"start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2021-12-17","location":"Virtual"},"status":"public","type":"conference","alternative_title":["LIPIcs"],"title":"On the complexity of intersection non-emptiness for star-free language classes","article_processing_charge":"No","oa":1,"date_updated":"2022-01-17T10:56:19Z","scopus_import":"1","intvolume":"       213","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science"},{"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"quality_controlled":"1","date_published":"2021-12-01T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","publication_status":"published","external_id":{"arxiv":["2111.03165"]},"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."}],"ddc":["000"],"tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"file_date_updated":"2022-01-26T07:39:59Z","_id":"10667","doi":"10.48550/arXiv.2111.03165","citation":{"short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","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 <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>"},"date_created":"2022-01-25T15:45:58Z","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.","year":"2021","ec_funded":1,"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"alternative_title":[" Advances in Neural Information Processing Systems"],"status":"public","type":"conference","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Žikelić","full_name":"Žikelić, Ðorđe","first_name":"Ðorđe"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"arxiv":1,"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"day":"01","oa_version":"Published Version","file":[{"success":1,"file_name":"infinite_time_horizon_safety_o.pdf","file_id":"10682","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","date_created":"2022-01-26T07:39:59Z","date_updated":"2022-01-26T07:39:59Z","creator":"mlechner","content_type":"application/pdf","file_size":452492,"relation":"main_file","access_level":"open_access"}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06"},"month":"12","language":[{"iso":"eng"}],"publication":"35th Conference on Neural Information Processing Systems","title":"Infinite time horizon safety of Bayesian neural networks","oa":1,"date_updated":"2025-07-14T09:10:12Z","article_processing_charge":"No","has_accepted_license":"1"},{"ec_funded":1,"year":"2021","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.","citation":{"apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","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.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","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."},"date_created":"2022-01-27T12:11:23Z","doi":"10.1137/1.9781611976465.38","_id":"10694","abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["2005.06636"]},"publication_status":"published","date_published":"2021-01-01T00:00:00Z","publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","page":"617-636","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"editor":[{"last_name":"Marx","full_name":"Marx, Dániel","first_name":"Dániel"}],"scopus_import":"1","article_processing_charge":"No","date_updated":"2025-07-14T09:10:12Z","oa":1,"title":"Infinite-duration all-pay bidding games","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-61197-646-5"]},"month":"01","conference":{"start_date":"2021-01-10","name":"SODA: Symposium on Discrete Algorithms","end_date":"2021-01-13","location":"Virtual"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Preprint","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"arxiv":1,"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy"},{"first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"status":"public","type":"conference"},{"language":[{"iso":"eng"}],"publication":"Nature Communications","issue":"1","article_processing_charge":"No","date_updated":"2025-07-14T09:10:05Z","oa":1,"title":"Fast and strong amplifiers of natural selection","isi":1,"has_accepted_license":"1","intvolume":"        12","scopus_import":"1","type":"journal_article","status":"public","pmid":1,"author":[{"first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin A.","full_name":"Nowak, Martin A.","last_name":"Nowak"}],"publication_identifier":{"eissn":["20411723"]},"month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"checksum":"5767418926a7f7fb76151de29473dae0","file_name":"2021_NatCoom_Tkadlec.pdf","file_id":"9692","success":1,"date_updated":"2021-07-19T13:02:20Z","date_created":"2021-07-19T13:02:20Z","creator":"cziletti","access_level":"open_access","file_size":628992,"content_type":"application/pdf","relation":"main_file"}],"day":"29","oa_version":"Published Version","_id":"9640","article_type":"original","file_date_updated":"2021-07-19T13:02:20Z","doi":"10.1038/s41467-021-24271-w","year":"2021","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.","date_created":"2021-07-11T22:01:15Z","citation":{"apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &#38; Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-24271-w\">https://doi.org/10.1038/s41467-021-24271-w</a>","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers of natural selection. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-24271-w\">10.1038/s41467-021-24271-w</a>","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009.","mla":"Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.” <i>Nature Communications</i>, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-24271-w\">10.1038/s41467-021-24271-w</a>.","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-24271-w\">https://doi.org/10.1038/s41467-021-24271-w</a>."},"article_number":"4009","ec_funded":1,"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"date_published":"2021-06-29T00:00:00Z","publisher":"Springer Nature","quality_controlled":"1","volume":12,"department":[{"_id":"KrCh"}],"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["510"],"abstract":[{"lang":"eng","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."}],"external_id":{"isi":["000671752100003"],"pmid":["34188036"]}},{"related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"}]},"ec_funded":1,"citation":{"apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., &#38; Zikelic, D. (2021). Proving non-termination by program reversal. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 1033–1048). Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454093\">https://doi.org/10.1145/3453483.3454093</a>","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 1033–48. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454093\">https://doi.org/10.1145/3453483.3454093</a>.","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.","mla":"Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 1033–48, doi:<a href=\"https://doi.org/10.1145/3453483.3454093\">10.1145/3453483.3454093</a>.","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Online, 2021, pp. 1033–1048.","ama":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:1033-1048. doi:<a href=\"https://doi.org/10.1145/3453483.3454093\">10.1145/3453483.3454093</a>","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."},"date_created":"2021-07-11T22:01:17Z","year":"2021","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.","doi":"10.1145/3453483.3454093","_id":"9644","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."}],"external_id":{"isi":["000723661700067"],"arxiv":["2104.01189"]},"publication_status":"published","quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"1033-1048","date_published":"2021-06-01T00:00:00Z","publisher":"Association for Computing Machinery","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"scopus_import":"1","isi":1,"title":"Proving non-termination by program reversal","article_processing_charge":"No","oa":1,"date_updated":"2025-07-14T09:10:06Z","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/2104.01189","open_access":"1"}],"month":"06","publication_identifier":{"isbn":["9781450383912"]},"conference":{"end_date":"2021-06-26","location":"Online","start_date":"2021-06-20","name":"PLDI: Programming Language Design and Implementation"},"arxiv":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"},{"last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotný, Petr"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde","first_name":"Dorde"}],"type":"conference","status":"public"},{"status":"public","type":"conference","author":[{"last_name":"Asadi","full_name":"Asadi, Ali","first_name":"Ali"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar"},{"full_name":"Mahdavi, Mohammad","first_name":"Mohammad","last_name":"Mahdavi"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-03183862/"}],"day":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","conference":{"end_date":"2021-06-26","location":"Online","start_date":"2021-06-20","name":" PLDI: Programming Language Design and Implementation"},"month":"06","publication_identifier":{"isbn":["9781450383912"]},"language":[{"iso":"eng"}],"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","title":"Polynomial reachability witnesses via Stellensätze","oa":1,"date_updated":"2025-07-14T09:10:06Z","article_processing_charge":"No","scopus_import":"1","isi":1,"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"page":"772-787","department":[{"_id":"KrCh"}],"quality_controlled":"1","publisher":"Association for Computing Machinery","date_published":"2021-06-01T00:00:00Z","publication_status":"published","external_id":{"isi":["000723661700050"]},"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."}],"_id":"9645","doi":"10.1145/3453483.3454076","date_created":"2021-07-11T22:01:17Z","citation":{"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: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:772-787. doi:<a href=\"https://doi.org/10.1145/3453483.3454076\">10.1145/3453483.3454076</a>","ieee":"A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Online, 2021, pp. 772–787.","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.","mla":"Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 772–87, doi:<a href=\"https://doi.org/10.1145/3453483.3454076\">10.1145/3453483.3454076</a>.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 772–87. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454076\">https://doi.org/10.1145/3453483.3454076</a>.","apa":"Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., &#38; Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 772–787). Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454076\">https://doi.org/10.1145/3453483.3454076</a>"},"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).","year":"2021","ec_funded":1},{"doi":"10.1145/3453483.3454102","_id":"9646","ec_funded":1,"citation":{"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.","ama":"Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. Quantitative analysis of assertion violations in probabilistic programs. In: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:1171-1186. doi:<a href=\"https://doi.org/10.1145/3453483.3454102\">10.1145/3453483.3454102</a>","ieee":"J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Online, 2021, pp. 1171–1186.","mla":"Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 1171–86, doi:<a href=\"https://doi.org/10.1145/3453483.3454102\">10.1145/3453483.3454102</a>.","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.","chicago":"Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 1171–86. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454102\">https://doi.org/10.1145/3453483.3454102</a>.","apa":"Wang, J., Sun, Y., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 1171–1186). Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454102\">https://doi.org/10.1145/3453483.3454102</a>"},"date_created":"2021-07-11T22:01:18Z","year":"2021","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).","quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"1171-1186","date_published":"2021-06-01T00:00:00Z","publisher":"Association for Computing Machinery","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","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"}],"abstract":[{"lang":"eng","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."}],"external_id":{"isi":["000723661700076"],"arxiv":["2011.14617"]},"publication_status":"published","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","language":[{"iso":"eng"}],"scopus_import":"1","isi":1,"title":"Quantitative analysis of assertion violations in probabilistic programs","article_processing_charge":"No","date_updated":"2025-07-14T09:10:06Z","oa":1,"type":"conference","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.14617"}],"day":"01","month":"06","publication_identifier":{"isbn":["9781450383912"]},"conference":{"end_date":"2021-06-26","location":"Online","start_date":"2021-06-20","name":"PLDI: Programming Language Design and Implementation"},"arxiv":1,"author":[{"first_name":"Jinyi","full_name":"Wang, Jinyi","last_name":"Wang"},{"full_name":"Sun, Yican","first_name":"Yican","last_name":"Sun"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"}]},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"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."}],"external_id":{"isi":["000698732400016"],"arxiv":["2105.06424"]},"publication_status":"published","date_published":"2021-07-15T00:00:00Z","publisher":"Springer Nature","volume":"12759 ","quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"341-366","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10199"}]},"ec_funded":1,"year":"2021","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.","citation":{"apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., &#38; Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In <i>33rd International Conference on Computer-Aided Verification </i> (Vol. 12759, pp. 341–366). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">https://doi.org/10.1007/978-3-030-81685-8_16</a>","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 <i>33rd International Conference on Computer-Aided Verification </i>, Virtual, 2021, vol. 12759, pp. 341–366.","ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: <i>33rd International Conference on Computer-Aided Verification </i>. Vol 12759. Springer Nature; 2021:341-366. doi:<a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">10.1007/978-3-030-81685-8_16</a>","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.","mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” <i>33rd International Conference on Computer-Aided Verification </i>, vol. 12759, Springer Nature, 2021, pp. 341–66, doi:<a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">10.1007/978-3-030-81685-8_16</a>.","chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In <i>33rd International Conference on Computer-Aided Verification </i>, 12759:341–66. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">https://doi.org/10.1007/978-3-030-81685-8_16</a>."},"date_created":"2021-09-05T22:01:24Z","doi":"10.1007/978-3-030-81685-8_16","_id":"9987","file_date_updated":"2022-05-13T07:00:20Z","month":"07","publication_identifier":{"isbn":["978-3-030-81684-1"],"eisbn":["978-3-030-81685-8"],"eissn":["1611-3349"],"issn":["0302-9743"]},"conference":{"end_date":"2021-07-23","location":"Virtual","start_date":"2021-07-20","name":"CAV: Computer Aided Verification "},"file":[{"content_type":"application/pdf","file_size":1516756,"access_level":"open_access","relation":"main_file","creator":"dernst","date_created":"2022-05-13T07:00:20Z","date_updated":"2022-05-13T07:00:20Z","success":1,"file_name":"2021_LNCS_Agarwal.pdf","checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","file_id":"11368"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"15","oa_version":"Published Version","arxiv":1,"author":[{"full_name":"Agarwal, Pratyush","first_name":"Pratyush","last_name":"Agarwal"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Pathak","full_name":"Pathak, Shreya","first_name":"Shreya"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"},{"first_name":"Viktor","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"status":"public","type":"conference","alternative_title":["LNCS"],"isi":1,"has_accepted_license":"1","scopus_import":"1","article_processing_charge":"Yes","date_updated":"2025-07-14T09:10:15Z","oa":1,"title":"Stateless model checking under a reads-value-from equivalence","publication":"33rd International Conference on Computer-Aided Verification ","language":[{"iso":"eng"}]},{"related_material":{"record":[{"id":"10293","relation":"dissertation_contains","status":"public"}]},"article_number":"17443","ec_funded":1,"keyword":["Multidisciplinary"],"citation":{"apa":"Schmid, L., Shati, P., Hilbe, C., &#38; Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-96932-1\">https://doi.org/10.1038/s41598-021-96932-1</a>","ama":"Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. <i>Scientific Reports</i>. 2021;11(1). doi:<a href=\"https://doi.org/10.1038/s41598-021-96932-1\">10.1038/s41598-021-96932-1</a>","ieee":"L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” <i>Scientific Reports</i>, vol. 11, no. 1. Springer Nature, 2021.","short":"L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).","chicago":"Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-96932-1\">https://doi.org/10.1038/s41598-021-96932-1</a>.","mla":"Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” <i>Scientific Reports</i>, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-96932-1\">10.1038/s41598-021-96932-1</a>.","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."},"date_created":"2021-09-11T16:22:02Z","year":"2021","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).","doi":"10.1038/s41598-021-96932-1","_id":"9997","article_type":"original","file_date_updated":"2021-09-13T10:31:21Z","abstract":[{"lang":"eng","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."}],"external_id":{"isi":["000692406400018"],"pmid":["34465830"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["003"],"publication_status":"published","quality_controlled":"1","volume":11,"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"date_published":"2021-08-31T00:00:00Z","publisher":"Springer Nature","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"intvolume":"        11","has_accepted_license":"1","isi":1,"title":"The evolution of indirect reciprocity under action and assessment generosity","article_processing_charge":"Yes","issue":"1","oa":1,"date_updated":"2025-07-14T09:10:09Z","publication":"Scientific Reports","language":[{"iso":"eng"}],"file":[{"creator":"cchlebak","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_size":2424943,"success":1,"file_name":"2021_ScientificReports_Schmid.pdf","checksum":"19df8816cf958b272b85841565c73182","file_id":"10006","date_created":"2021-09-13T10:31:21Z","date_updated":"2021-09-13T10:31:21Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","day":"31","month":"08","publication_identifier":{"eissn":["2045-2322"]},"author":[{"orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","full_name":"Schmid, Laura","first_name":"Laura"},{"full_name":"Shati, Pouya","first_name":"Pouya","last_name":"Shati"},{"first_name":"Christian","full_name":"Hilbe, Christian","last_name":"Hilbe"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"}],"type":"journal_article","status":"public","pmid":1},{"month":"09","publication_identifier":{"isbn":["9780999241196"],"issn":["1045-0823"]},"conference":{"end_date":"2021-08-27","location":"Virtual, Online","start_date":"2021-08-19","name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"oa_version":"Published Version","day":"01","author":[{"last_name":"Tomášek","first_name":"Petr","full_name":"Tomášek, Petr"},{"last_name":"Horák","first_name":"Karel","full_name":"Horák, Karel"},{"first_name":"Aditya","full_name":"Aradhye, Aditya","last_name":"Aradhye"},{"last_name":"Bošanský","full_name":"Bošanský, Branislav","first_name":"Branislav"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"}],"status":"public","type":"conference","scopus_import":"1","article_processing_charge":"No","oa":1,"date_updated":"2025-07-14T09:10:13Z","title":"Solving partially observable stochastic shortest-path games","publication":"30th International Joint Conference on Artificial Intelligence","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","date_published":"2021-09-01T00:00:00Z","publisher":"International Joint Conferences on Artificial Intelligence","quality_controlled":"1","page":"4182-4189","department":[{"_id":"KrCh"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"ec_funded":1,"year":"2021","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. ","date_created":"2022-03-13T23:01:47Z","citation":{"mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” <i>30th International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>.","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 <i>30th International Joint Conference on Artificial Intelligence</i>, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>.","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.","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: <i>30th International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in <i>30th International Joint Conference on Artificial Intelligence</i>, Virtual, Online, 2021, pp. 4182–4189.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., &#38; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In <i>30th International Joint Conference on Artificial Intelligence</i> (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>"},"doi":"10.24963/ijcai.2021/575","_id":"10847"},{"doi":"10.5061/DRYAD.CRJDFN318","_id":"13060","related_material":{"record":[{"id":"7343","relation":"used_in_publication","status":"public"}]},"title":"Social immunity modulates competition between coinfecting pathogens","citation":{"apa":"Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., &#38; Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">https://doi.org/10.5061/DRYAD.CRJDFN318</a>","ama":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social immunity modulates competition between coinfecting pathogens. 2020. doi:<a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>","ieee":"B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens.” Dryad, 2020.","short":"B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer, (2020).","chicago":"Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Dryad, 2020. <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">https://doi.org/10.5061/DRYAD.CRJDFN318</a>.","mla":"Milutinovic, Barbara, et al. <i>Social Immunity Modulates Competition between Coinfecting Pathogens</i>. Dryad, 2020, doi:<a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>.","ista":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.CRJDFN318\">10.5061/DRYAD.CRJDFN318</a>."},"date_created":"2023-05-23T16:11:22Z","oa":1,"date_updated":"2023-09-05T16:04:48Z","article_processing_charge":"No","year":"2020","department":[{"_id":"SyCr"},{"_id":"KrCh"}],"publisher":"Dryad","date_published":"2020-12-19T00:00:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","type":"research_data_reference","status":"public","day":"19","main_file_link":[{"url":"https://doi.org/10.5061/dryad.crjdfn318","open_access":"1"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Coinfections with multiple pathogens can result in complex within-host dynamics affecting virulence and transmission. Whilst multiple infections are intensively studied in solitary hosts, it is so far unresolved how social host interactions interfere with pathogen competition, and if this depends on coinfection diversity. We studied how the collective disease defenses of ants – their social immunity ­– influence pathogen competition in coinfections of same or different fungal pathogen species. Social immunity reduced virulence for all pathogen combinations, but interfered with spore production only in different-species coinfections. Here, it decreased overall pathogen sporulation success, whilst simultaneously increasing co-sporulation on individual cadavers and maintaining a higher pathogen diversity at the community-level. Mathematical modeling revealed that host sanitary care alone can modulate competitive outcomes between pathogens, giving advantage to fast-germinating, thus less grooming-sensitive ones. Host social interactions can hence modulate infection dynamics in coinfected group members, thereby altering pathogen communities at the host- and population-level."}],"ddc":["570"],"month":"12","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)"},"author":[{"full_name":"Milutinovic, Barbara","first_name":"Barbara","orcid":"0000-0002-8214-4758","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","last_name":"Milutinovic"},{"first_name":"Miriam","full_name":"Stock, Miriam","last_name":"Stock","id":"42462816-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anna V","full_name":"Grasse, Anna V","last_name":"Grasse","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"id":"31757262-F248-11E8-B48F-1D18A9856A87","last_name":"Naderlinger","full_name":"Naderlinger, Elisabeth","first_name":"Elisabeth"},{"full_name":"Hilbe, Christian","first_name":"Christian","orcid":"0000-0001-5116-955X","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868"}]},{"day":"14","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_size":625056,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"dernst","date_created":"2020-08-17T11:32:44Z","date_updated":"2020-08-17T11:32:44Z","success":1,"file_name":"2020_LNCS_CAV_Chatterjee.pdf","checksum":"093d4788d7d5b2ce0ffe64fbe7820043","file_id":"8276"}],"conference":{"name":"CAV: Computer Aided Verification"},"month":"07","publication_identifier":{"issn":["03029743"],"isbn":["9783030532901"],"eissn":["16113349"]},"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"4524F760-F248-11E8-B48F-1D18A9856A87","last_name":"Katoen","first_name":"Joost P","full_name":"Katoen, Joost P"},{"full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"}],"arxiv":1,"alternative_title":["LNCS"],"type":"conference","status":"public","has_accepted_license":"1","intvolume":"     12225","scopus_import":"1","isi":1,"title":"Stochastic games with lexicographic reachability-safety objectives","oa":1,"date_updated":"2025-07-14T09:10:14Z","article_processing_charge":"No","publication":"International Conference on Computer Aided Verification","language":[{"iso":"eng"}],"external_id":{"arxiv":["2005.04018"],"isi":["000695272500021"]},"abstract":[{"text":"We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in   NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is   PSPACE -hard and can be solved in   NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies.","lang":"eng"}],"ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","page":"398-420","department":[{"_id":"KrCh"}],"quality_controlled":"1","volume":12225,"publisher":"Springer Nature","date_published":"2020-07-14T00:00:00Z","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"ec_funded":1,"related_material":{"record":[{"id":"12738","relation":"later_version","status":"public"}]},"date_created":"2020-08-16T22:00:58Z","citation":{"ista":"Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” <i>International Conference on Computer Aided Verification</i>, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>.","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In <i>International Conference on Computer Aided Verification</i>, 12225:398–420. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>.","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in <i>International Conference on Computer Aided Verification</i>, 2020, vol. 12225, pp. 398–420.","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: <i>International Conference on Computer Aided Verification</i>. Vol 12225. Springer Nature; 2020:398-420. doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>","apa":"Chatterjee, K., Katoen, J. P., Weininger, M., &#38; Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In <i>International Conference on Computer Aided Verification</i> (Vol. 12225, pp. 398–420). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>"},"year":"2020","doi":"10.1007/978-3-030-53291-8_21","file_date_updated":"2020-08-17T11:32:44Z","_id":"8272"}]