[{"month":"07","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377051"],"eissn":["1611-3349"]},"conference":{"name":"CAV: Computer Aided Verification","start_date":"2023-07-17","location":"Paris, France","end_date":"2023-07-22"},"doi":"10.1007/978-3-031-37706-8_20","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","file_date_updated":"2023-09-06T08:25:50Z","author":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"last_name":"Prokop","first_name":"Maximilian","full_name":"Prokop, Maximilian"},{"full_name":"Rieder, Sabine","first_name":"Sabine","last_name":"Rieder"}],"date_created":"2023-09-03T22:01:16Z","date_updated":"2023-09-06T08:27:33Z","volume":13964,"acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).","year":"2023","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"day":"17","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","date_published":"2023-07-17T00:00:00Z","publication":"35th International Conference on Computer Aided Verification ","citation":{"short":"J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International Conference on Computer Aided Verification , Springer Nature, 2023, pp. 390–414.","mla":"Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” 35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In 35th International Conference on Computer Aided Verification , 13964:390–414. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_20.","ama":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20","ieee":"J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.","apa":"Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20","ista":"Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies in LTL synthesis by semantic learning. 35th International Conference on Computer Aided Verification . CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414."},"page":"390-414","abstract":[{"lang":"eng","text":"We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_LNCS_CAV_Kretinsky.pdf","content_type":"application/pdf","file_size":428354,"creator":"dernst","relation":"main_file","file_id":"14276","checksum":"ed66278b61bb869e1baba3d9b9081271","success":1,"date_updated":"2023-09-06T08:25:50Z","date_created":"2023-09-06T08:25:50Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14259","ddc":["000"],"status":"public","title":"Guessing winning policies in LTL synthesis by semantic learning","intvolume":" 13964"},{"ec_funded":1,"file_date_updated":"2023-09-20T08:24:47Z","year":"2023","acknowledgement":"We thank Prof. Bican Xia for valuable information on the exponential theory of reals. The work is partially supported by the National Natural Science Foundation of China (NSFC) with Grant No. 62172271, ERC CoG 863818 (ForM-SMArt), the Hong Kong Research Grants Council ECS Project Number 26208122, the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055 and the HKUST Startup Grant R9272.","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"link":[{"relation":"software","url":"https://github.com/boyvolcano/PRR"}]},"author":[{"first_name":"Yican","last_name":"Sun","full_name":"Sun, Yican"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"}],"volume":13966,"date_created":"2023-09-10T22:01:12Z","date_updated":"2023-09-20T08:25:57Z","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031377082"],"issn":["0302-9743"]},"month":"07","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"quality_controlled":"1","doi":"10.1007/978-3-031-37709-9_2","conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","start_date":"2023-07-17","location":"Paris, France"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail probability Pr[T≥κ], i.e., the probability that the randomized runtime T of the PRR exceeds κ. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound u≥Pr[T≥κ]. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), while other approaches are mostly limited to deriving tail bounds of specific PRRs via involved custom analysis.\r\nIn this work, we propose a novel approach for deriving the common exponentially-decreasing tail bounds for PRRs whose preprocessing time and random passed sizes observe discrete or (piecewise) uniform distribution and whose recursive call is either a single procedure call or a divide-and-conquer. We first establish a theoretical approach via Markov’s inequality, and then instantiate the theoretical approach with a template-based algorithmic approach via a refined treatment of exponentiation. Experimental evaluation shows that our algorithmic approach is capable of deriving tail bounds that are (i) asymptotically tighter than Karp’s method, (ii) match the best-known manually-derived asymptotic tail bound for QuickSelect, and (iii) is only slightly worse (with a loglogn factor) than the manually-proven optimal asymptotic tail bound for QuickSort. Moreover, our algorithmic approach handles all examples (including realistic PRRs such as QuickSort, QuickSelect, DiameterComputation, etc.) in less than 0.1 s, showing that our approach is efficient in practice."}],"_id":"14318","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13966","ddc":["000"],"title":"Automated tail bound analysis for probabilistic recurrence relations","status":"public","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"14348","date_created":"2023-09-20T08:24:47Z","date_updated":"2023-09-20T08:24:47Z","checksum":"42917e086f8c7699f3bccf84f74fe000","success":1,"file_name":"2023_LNCS_Sun.pdf","access_level":"open_access","file_size":624647,"content_type":"application/pdf","creator":"dernst"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","day":"17","citation":{"ama":"Sun Y, Fu H, Chatterjee K, Goharshady AK. Automated tail bound analysis for probabilistic recurrence relations. In: Computer Aided Verification. Vol 13966. Springer Nature; 2023:16-39. doi:10.1007/978-3-031-37709-9_2","ieee":"Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.","apa":"Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_2","ista":"Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.","short":"Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Computer Aided Verification, Springer Nature, 2023, pp. 16–39.","mla":"Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:10.1007/978-3-031-37709-9_2.","chicago":"Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In Computer Aided Verification, 13966:16–39. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_2."},"publication":"Computer Aided Verification","page":"16-39","date_published":"2023-07-17T00:00:00Z"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"conference":{"location":"Paris, France","start_date":"2023-07-17","end_date":"2023-07-22","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-031-37709-9_5","language":[{"iso":"eng"}],"month":"07","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377082"],"eissn":["1611-3349"]},"year":"2023","acknowledgement":"This work was supported in part by the ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 as well as DST/CEFIPRA/INRIA project EQuaVE and SERB Matrices grant MTR/2018/00074.","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","author":[{"last_name":"Akshay","first_name":"S.","full_name":"Akshay, S."},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"}],"date_created":"2023-09-10T22:01:12Z","date_updated":"2023-09-20T09:04:40Z","volume":13966,"file_date_updated":"2023-09-20T08:46:43Z","ec_funded":1,"publication":"International Conference on Computer Aided Verification","citation":{"ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112.","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_5","ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2023. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: International Conference on Computer Aided Verification. Vol 13966. Springer Nature; 2023:86-112. doi:10.1007/978-3-031-37709-9_5","chicago":"Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_5.","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 86–112.","mla":"Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5."},"page":"86-112","date_published":"2023-07-17T00:00:00Z","scopus_import":"1","day":"17","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","_id":"14317","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"MDPs as distribution transformers: Affine invariant synthesis for safety objectives","status":"public","intvolume":" 13966","file":[{"relation":"main_file","file_id":"14349","date_created":"2023-09-20T08:46:43Z","date_updated":"2023-09-20T08:46:43Z","checksum":"f143c8eedf609f20f2aad2eeb496d53f","success":1,"file_name":"2023_LNCS_Akshay.pdf","access_level":"open_access","content_type":"application/pdf","file_size":531745,"creator":"dernst"}],"oa_version":"Published Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.\r\nIn light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples.","lang":"eng"}]},{"abstract":[{"text":"We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist 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 the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12738","ddc":["000"],"status":"public","title":"Stochastic games with lexicographic objectives","day":"08","article_processing_charge":"No","scopus_import":"1","date_published":"2023-03-08T00:00:00Z","publication":"Formal Methods in System Design","citation":{"ieee":"K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” Formal Methods in System Design. Springer Nature, 2023.","apa":"Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. https://doi.org/10.1007/s10703-023-00411-4","ista":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design.","ama":"Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. Stochastic games with lexicographic objectives. Formal Methods in System Design. 2023. doi:10.1007/s10703-023-00411-4","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design. Springer Nature, 2023. https://doi.org/10.1007/s10703-023-00411-4.","short":"K. Chatterjee, J.P. Katoen, S. Mohr, M. Weininger, T. Winkler, Formal Methods in System Design (2023).","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design, Springer Nature, 2023, doi:10.1007/s10703-023-00411-4."},"article_type":"original","ec_funded":1,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P"},{"full_name":"Mohr, Stefanie","first_name":"Stefanie","last_name":"Mohr"},{"last_name":"Weininger","first_name":"Maximilian","full_name":"Weininger, Maximilian"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"8272"}]},"date_updated":"2023-10-03T11:36:13Z","date_created":"2023-03-19T23:00:59Z","acknowledgement":"Tobias Winkler and Joost-Pieter Katoen are supported by the DFG RTG 2236 UnRAVeL and the innovation programme under the Marie Skłodowska-Curie grant agreement No. 101008233 (Mission). Krishnendu Chatterjee is supported by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) Project ICT15-003. Maximilian Weininger is supported by the DFG projects 383882557 Statistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic Verification (GOPro). Stefanie Mohr is supported by the DFG RTG 2428 CONVEY. Open Access funding enabled and organized by Projekt DEAL.","year":"2023","publication_status":"epub_ahead","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"month":"03","publication_identifier":{"eissn":["1572-8102"]},"doi":"10.1007/s10703-023-00411-4","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s10703-023-00411-4"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000946174300001"]},"oa":1,"quality_controlled":"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":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}]},{"ec_funded":1,"file_date_updated":"2022-02-21T08:54:17Z","author":[{"full_name":"Graham, Thomas","last_name":"Graham","first_name":"Thomas"},{"first_name":"Maria","last_name":"Kleshnina","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","full_name":"Kleshnina, Maria"},{"last_name":"Filar","first_name":"Jerzy A.","full_name":"Filar, Jerzy A."}],"volume":13,"date_updated":"2023-10-04T09:24:30Z","date_created":"2022-02-20T23:01:32Z","year":"2023","acknowledgement":"The authors would like to acknowledge stimulating email discussions with Dr Wayne Lobb of W.A. Lobb LLC on the topic of evolutionary games. We also thank Dr Thomas Taimre for his input to the material in Sect. 3.\r\nThe authors would like to acknowledge partial support from the Australian Research Council under the Discovery grant DP180101602 and support by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411.","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","publication_identifier":{"issn":["2153-0785"],"eissn":["2153-0793"]},"month":"03","doi":"10.1007/s13235-022-00425-3","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000753777100001"]},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"isi":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings."}],"type":"journal_article","file":[{"relation":"main_file","file_id":"10781","date_updated":"2022-02-21T08:54:17Z","date_created":"2022-02-21T08:54:17Z","checksum":"cd53b07e96f9030ddb348f305e5b58c7","success":1,"file_name":"2022_DynamicGamesApplic_Graham.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1890512,"creator":"dernst"}],"oa_version":"Published Version","_id":"10770","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13","status":"public","title":"Where do mistakes lead? A survey of games with incompetent players","ddc":["000"],"has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2023-03-01T00:00:00Z","citation":{"chicago":"Graham, Thomas, Maria Kleshnina, and Jerzy A. Filar. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” Dynamic Games and Applications. Springer Nature, 2023. https://doi.org/10.1007/s13235-022-00425-3.","short":"T. Graham, M. Kleshnina, J.A. Filar, Dynamic Games and Applications 13 (2023) 231–264.","mla":"Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.” Dynamic Games and Applications, vol. 13, Springer Nature, 2023, pp. 231–64, doi:10.1007/s13235-022-00425-3.","apa":"Graham, T., Kleshnina, M., & Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-022-00425-3","ieee":"T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications, vol. 13. Springer Nature, pp. 231–264, 2023.","ista":"Graham T, Kleshnina M, Filar JA. 2023. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 13, 231–264.","ama":"Graham T, Kleshnina M, Filar JA. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. 2023;13:231-264. doi:10.1007/s13235-022-00425-3"},"publication":"Dynamic Games and Applications","page":"231-264","article_type":"original"},{"volume":272,"date_created":"2023-10-09T09:21:05Z","date_updated":"2023-10-09T09:22:37Z","author":[{"first_name":"Christel","last_name":"Baier","full_name":"Baier, Christel"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"},{"full_name":"Piribauer, Jakob","last_name":"Piribauer","first_name":"Jakob"}],"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","acknowledgement":"This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the DFG Grant\r\n389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of\r\nExcellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy), and the DFG projects BA-1679/11-1 and BA-1679/12-1.","year":"2023","ec_funded":1,"file_date_updated":"2023-10-09T09:19:11Z","article_number":"15","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2023.15","conference":{"end_date":"2023-09-01","location":"Bordeaux, France","start_date":"2023-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2307.06611"]},"oa":1,"publication_identifier":{"isbn":["9783959772921"],"eissn":["1868-8969"]},"month":"08","oa_version":"Published Version","file":[{"file_id":"14418","relation":"main_file","date_updated":"2023-10-09T09:19:11Z","date_created":"2023-10-09T09:19:11Z","success":1,"checksum":"402281b17ed669bbf149d0fdf68ac201","file_name":"2023_LIPIcsMFCS_Baier.pdf","access_level":"open_access","creator":"dernst","file_size":826843,"content_type":"application/pdf"}],"intvolume":" 272","title":"Entropic risk for turn-based stochastic games","status":"public","ddc":["000"],"_id":"14417","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided."}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2023-08-21T00:00:00Z","citation":{"ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: 48th International Symposium on Mathematical Foundations of Computer Science. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.MFCS.2023.15","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 48th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” 48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15.","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15."},"publication":"48th International Symposium on Mathematical Foundations of Computer Science","article_processing_charge":"Yes","has_accepted_license":"1","day":"21","scopus_import":"1"},{"day":"27","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2023-02-27T00:00:00Z","article_type":"original","page":"e0279838","publication":"PLoS One","citation":{"mla":"Mckerral, Jody C., et al. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.” PLoS One, vol. 18, no. 2, Public Library of Science, 2023, p. e0279838, doi:10.1371/journal.pone.0279838.","short":"J.C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J.G. Mitchell, J.A. Filar, PLoS One 18 (2023) e0279838.","chicago":"Mckerral, Jody C., Maria Kleshnina, Vladimir Ejov, Louise Bartle, James G. Mitchell, and Jerzy A. Filar. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.” PLoS One. Public Library of Science, 2023. https://doi.org/10.1371/journal.pone.0279838.","ama":"Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 2023;18(2):e0279838. doi:10.1371/journal.pone.0279838","ista":"Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. 2023. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 18(2), e0279838.","apa":"Mckerral, J. C., Kleshnina, M., Ejov, V., Bartle, L., Mitchell, J. G., & Filar, J. A. (2023). Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0279838","ieee":"J. C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J. G. Mitchell, and J. A. Filar, “Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations,” PLoS One, vol. 18, no. 2. Public Library of Science, p. e0279838, 2023."},"abstract":[{"text":"Allometric settings of population dynamics models are appealing due to their parsimonious nature and broad utility when studying system level effects. Here, we parameterise the size-scaled Rosenzweig-MacArthur differential equations to eliminate prey-mass dependency, facilitating an in depth analytic study of the equations which incorporates scaling parameters’ contributions to coexistence. We define the functional response term to match empirical findings, and examine situations where metabolic theory derivations and observation diverge. The dynamical properties of the Rosenzweig-MacArthur system, encompassing the distribution of size-abundance equilibria, the scaling of period and amplitude of population cycling, and relationships between predator and prey abundances, are consistent with empirical observation. Our parameterisation is an accurate minimal model across 15+ orders of mass magnitude.","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"12712","date_created":"2023-03-07T10:26:45Z","date_updated":"2023-03-07T10:26:45Z","checksum":"798ed5739a4117b03173e5d56e0534c9","success":1,"file_name":"2023_PLOSOne_Mckerral.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1257003,"creator":"cchlebak"}],"status":"public","title":"Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations","ddc":["000"],"intvolume":" 18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12706","month":"02","publication_identifier":{"eissn":["1932-6203"]},"language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0279838","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["36848357"],"isi":["000996122900022"]},"file_date_updated":"2023-03-07T10:26:45Z","date_updated":"2023-10-17T12:53:30Z","date_created":"2023-03-05T23:01:05Z","volume":18,"author":[{"full_name":"Mckerral, Jody C.","first_name":"Jody C.","last_name":"Mckerral"},{"full_name":"Kleshnina, Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","last_name":"Kleshnina","first_name":"Maria"},{"first_name":"Vladimir","last_name":"Ejov","full_name":"Ejov, Vladimir"},{"full_name":"Bartle, Louise","first_name":"Louise","last_name":"Bartle"},{"full_name":"Mitchell, James G.","last_name":"Mitchell","first_name":"James G."},{"full_name":"Filar, Jerzy A.","last_name":"Filar","first_name":"Jerzy A."}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","year":"2023","acknowledgement":"This research was supported by an Australian Government Research Training Program\r\n(RTP) Scholarship to JCM (https://www.dese.gov.au), and LB is supported by the Centre de\r\nrecherche sur le vieillissement Fellowship Program. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","pmid":1},{"intvolume":" 372","title":"Reachability poorman discrete-bidding games","ddc":["000"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14518","file":[{"content_type":"application/pdf","file_size":501011,"creator":"dernst","file_name":"2023_FAIA_Avni.pdf","access_level":"open_access","date_updated":"2023-11-13T10:16:10Z","date_created":"2023-11-13T10:16:10Z","checksum":"1390ca38480fa4cf286b0f1a42e8c12f","success":1,"relation":"main_file","file_id":"14529"}],"oa_version":"Published Version","type":"conference","abstract":[{"text":"We consider bidding games, a class of two-player zero-sum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in favor of Player 1. Player 1 wins the game iff the token visits a designated target vertex. We consider, for the first time, poorman discrete-bidding in which the granularity of the bids is restricted and the higher bid is paid to the bank. Previous work either did not impose granularity restrictions or considered Richman bidding (bids are paid to the opponent). While the latter mechanisms are technically more accessible, the former is more appealing from a practical standpoint. Our study focuses on threshold budgets, which is the necessary and sufficient initial budget required for Player 1 to ensure winning against a given Player 2 budget. We first show existence of thresholds. In DAGs, we show that threshold budgets can be approximated with error bounds by thresholds under continuous-bidding and that they exhibit a periodic behavior. We identify closed-form solutions in special cases. We implement and experiment with an algorithm to find threshold budgets.","lang":"eng"}],"page":"141-148","citation":{"apa":"Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., & Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press. https://doi.org/10.3233/FAIA230264","ieee":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.","ista":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.","ama":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman discrete-bidding games. In: Frontiers in Artificial Intelligence and Applications. Vol 372. IOS Press; 2023:141-148. doi:10.3233/FAIA230264","chicago":"Avni, Guy, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, and Dorde Zikelic. “Reachability Poorman Discrete-Bidding Games.” In Frontiers in Artificial Intelligence and Applications, 372:141–48. IOS Press, 2023. https://doi.org/10.3233/FAIA230264.","short":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.","mla":"Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.” Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp. 141–48, doi:10.3233/FAIA230264."},"publication":"Frontiers in Artificial Intelligence and Applications","date_published":"2023-09-28T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"28","publisher":"IOS Press","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","year":"2023","acknowledgement":"This research was supported in part by ISF grant no. 1679/21, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie Grant Agreement No. 665385.","volume":372,"date_updated":"2023-11-13T10:18:45Z","date_created":"2023-11-12T23:00:56Z","author":[{"full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","first_name":"Tobias","last_name":"Meggendorfer"},{"last_name":"Sadhukhan","first_name":"Suman","full_name":"Sadhukhan, Suman"},{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","ec_funded":1,"file_date_updated":"2023-11-13T10:16:10Z","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"external_id":{"arxiv":["2307.15218"]},"language":[{"iso":"eng"}],"doi":"10.3233/FAIA230264","conference":{"name":"ECAI: European Conference on Artificial Intelligence","end_date":"2023-10-04","location":"Krakow, Poland","start_date":"2023-09-30"},"publication_identifier":{"issn":["0922-6389"],"isbn":["9781643684369"]},"month":"09"},{"month":"10","publication_identifier":{"isbn":["9783031453281"],"eissn":["1611-3349"],"issn":["0302-9743"]},"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2023-10-27","start_date":"2023-10-24","location":"Singapore, Singapore"},"doi":"10.1007/978-3-031-45329-8_17","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"author":[{"last_name":"Ansaripour","first_name":"Matin","full_name":"Ansaripour, Matin"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"}],"date_created":"2023-11-19T23:00:56Z","date_updated":"2023-11-20T08:30:20Z","volume":14215,"year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"day":"22","article_processing_charge":"No","scopus_import":"1","date_published":"2023-10-22T00:00:00Z","publication":"21st International Symposium on Automated Technology for Verification and Analysis","citation":{"chicago":"Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-45329-8_17.","mla":"Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” 21st International Symposium on Automated Technology for Verification and Analysis, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:10.1007/978-3-031-45329-8_17.","short":"M. Ansaripour, K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, 21st International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2023, pp. 357–379.","ista":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379.","apa":"Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. https://doi.org/10.1007/978-3-031-45329-8_17","ieee":"M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in 21st International Symposium on Automated Technology for Verification and Analysis, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.","ama":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. Learning provably stabilizing neural controllers for discrete-time stochastic systems. In: 21st International Symposium on Automated Technology for Verification and Analysis. Vol 14215. Springer Nature; 2023:357-379. doi:10.1007/978-3-031-45329-8_17"},"page":"357-379","abstract":[{"lang":"eng","text":"We consider the problem of learning control policies in discrete-time stochastic systems which guarantee that the system stabilizes within some specified stabilization region with probability 1. Our approach is based on the novel notion of stabilizing ranking supermartingales (sRSMs) that we introduce in this work. Our sRSMs overcome the limitation of methods proposed in previous works whose applicability is restricted to systems in which the stabilizing region cannot be left once entered under any control policy. We present a learning procedure that learns a control policy together with an sRSM that formally certifies probability 1 stability, both learned as neural networks. We show that this procedure can also be adapted to formally verifying that, under a given Lipschitz continuous control policy, the stochastic system stabilizes within some stabilizing region with probability 1. Our experimental evaluation shows that our learning procedure can successfully learn provably stabilizing policies in practice."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"None","_id":"14559","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","status":"public","intvolume":" 14215"},{"abstract":[{"lang":"eng","text":"We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1+ε)⋅(1+3–√) for some arbitrary ε>0.\r\n."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","status":"public","title":"Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation","intvolume":" 13892","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13238","day":"25","article_processing_charge":"No","scopus_import":"1","date_published":"2023-05-25T00:00:00Z","page":"576-594","publication":"SIROCCO 2023: Structural Information and Communication Complexity ","citation":{"mla":"Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” SIROCCO 2023: Structural Information and Communication Complexity , vol. 13892, Springer Nature, 2023, pp. 576–94, doi:10.1007/978-3-031-32733-9_26.","short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, SIROCCO 2023: Structural Information and Communication Complexity , Springer Nature, 2023, pp. 576–594.","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In SIROCCO 2023: Structural Information and Communication Complexity , 13892:576–94. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-32733-9_26.","ama":"Schmid S, Svoboda J, Yeo MX. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: SIROCCO 2023: Structural Information and Communication Complexity . Vol 13892. Springer Nature; 2023:576-594. doi:10.1007/978-3-031-32733-9_26","ista":"Schmid S, Svoboda J, Yeo MX. 2023. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. SIROCCO 2023: Structural Information and Communication Complexity . SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 13892, 576–594.","apa":"Schmid, S., Svoboda, J., & Yeo, M. X. (2023). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In SIROCCO 2023: Structural Information and Communication Complexity (Vol. 13892, pp. 576–594). Alcala de Henares, Spain: Springer Nature. https://doi.org/10.1007/978-3-031-32733-9_26","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in SIROCCO 2023: Structural Information and Communication Complexity , Alcala de Henares, Spain, 2023, vol. 13892, pp. 576–594."},"ec_funded":1,"date_updated":"2023-11-30T10:54:51Z","date_created":"2023-07-16T22:01:12Z","volume":13892,"author":[{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","first_name":"Jakub","last_name":"Svoboda"},{"last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X"}],"related_material":{"record":[{"id":"14506","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrPi"},{"_id":"KrCh"}],"year":"2023","acknowledgement":"We thank Mahsa Bastankhah and Mohammad Ali Maddah-Ali for fruitful discussions about different variants of the problem. This work is supported by the European Research Council (ERC) Consolidator Project 864228 (AdjustNet), 2020-2025, the ERC CoG 863818 (ForM-SMArt), and the German Research Foundation (DFG) grant 470029389 (FlexNets), 2021–2024.","month":"05","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031327322"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2023-06-09","location":"Alcala de Henares, Spain","start_date":"2023-06-06","name":"SIROCCO: Structural Information and Communication Complexity"},"doi":"10.1007/978-3-031-32733-9_26","quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"oa":1,"external_id":{"arxiv":["2204.13459"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2204.13459"}]},{"type":"journal_article","issue":"208","abstract":[{"lang":"eng","text":"Natural selection is usually studied between mutants that differ in reproductive rate, but are subject to the same population structure. Here we explore how natural selection acts on mutants that have the same reproductive rate, but different population structures. In our framework, population structure is given by a graph that specifies where offspring can disperse. The invading mutant disperses offspring on a different graph than the resident wild-type. We find that more densely connected dispersal graphs tend to increase the invader’s fixation probability, but the exact relationship between structure and fixation probability is subtle. We present three main results. First, we prove that if both invader and resident are on complete dispersal graphs, then removing a single edge in the invader’s dispersal graph reduces its fixation probability. Second, we show that for certain island models higher invader’s connectivity increases its fixation probability, but the magnitude of the effect depends on the exact layout of the connections. Third, we show that for lattices the effect of different connectivity is comparable to that of different fitness: for large population size, the invader’s fixation probability is either constant or exponentially small, depending on whether it is more or less connected than the resident."}],"_id":"14657","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 20","ddc":["000","570"],"title":"Evolutionary dynamics of mutants that modify population structure","status":"public","oa_version":"Published Version","file":[{"file_id":"14673","relation":"main_file","date_updated":"2023-12-11T11:10:32Z","date_created":"2023-12-11T11:10:32Z","success":1,"checksum":"2eefab13127c7786dbd33303c482a004","file_name":"2023_RoyalInterface_Tkadlec.pdf","access_level":"open_access","creator":"dernst","file_size":1720243,"content_type":"application/pdf"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","day":"29","citation":{"ista":"Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. 2023. Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. 20(208), 20230355.","ieee":"J. Tkadlec, K. Kaveh, K. Chatterjee, and M. A. Nowak, “Evolutionary dynamics of mutants that modify population structure,” Journal of the Royal Society, Interface, vol. 20, no. 208. The Royal Society, 2023.","apa":"Tkadlec, J., Kaveh, K., Chatterjee, K., & Nowak, M. A. (2023). Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. The Royal Society. https://doi.org/10.1098/rsif.2023.0355","ama":"Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. 2023;20(208). doi:10.1098/rsif.2023.0355","chicago":"Tkadlec, Josef, Kamran Kaveh, Krishnendu Chatterjee, and Martin A. Nowak. “Evolutionary Dynamics of Mutants That Modify Population Structure.” Journal of the Royal Society, Interface. The Royal Society, 2023. https://doi.org/10.1098/rsif.2023.0355.","mla":"Tkadlec, Josef, et al. “Evolutionary Dynamics of Mutants That Modify Population Structure.” Journal of the Royal Society, Interface, vol. 20, no. 208, 20230355, The Royal Society, 2023, doi:10.1098/rsif.2023.0355.","short":"J. Tkadlec, K. Kaveh, K. Chatterjee, M.A. Nowak, Journal of the Royal Society, Interface 20 (2023)."},"publication":"Journal of the Royal Society, Interface","article_type":"original","date_published":"2023-11-29T00:00:00Z","article_number":"20230355","ec_funded":1,"file_date_updated":"2023-12-11T11:10:32Z","pmid":1,"year":"2023","acknowledgement":"K.C. acknowledges support from the ERC CoG 863818(ForM-SMArt). J.T. is supported by Center for Foundations ofModern Computer Science (Charles Univ. project UNCE/SCI/004).","publisher":"The Royal Society","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"full_name":"Kaveh, Kamran","last_name":"Kaveh","first_name":"Kamran"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin A.","last_name":"Nowak","first_name":"Martin A."}],"volume":20,"date_updated":"2023-12-11T11:17:53Z","date_created":"2023-12-10T23:00:58Z","publication_identifier":{"eissn":["1742-5662"]},"month":"11","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["38016637"]},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"quality_controlled":"1","doi":"10.1098/rsif.2023.0355","language":[{"iso":"eng"}]},{"date_published":"2023-07-12T00:00:00Z","citation":{"ama":"Kleshnina M, Hilbe C, Simsa S, Chatterjee K, Nowak MA. The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. 2023;14. doi:10.1038/s41467-023-39625-9","ista":"Kleshnina M, Hilbe C, Simsa S, Chatterjee K, Nowak MA. 2023. The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. 14, 4153.","ieee":"M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, and M. A. Nowak, “The effect of environmental information on evolution of cooperation in stochastic games,” Nature Communications, vol. 14. Springer Nature, 2023.","apa":"Kleshnina, M., Hilbe, C., Simsa, S., Chatterjee, K., & Nowak, M. A. (2023). The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-39625-9","mla":"Kleshnina, Maria, et al. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” Nature Communications, vol. 14, 4153, Springer Nature, 2023, doi:10.1038/s41467-023-39625-9.","short":"M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, M.A. Nowak, Nature Communications 14 (2023).","chicago":"Kleshnina, Maria, Christian Hilbe, Stepan Simsa, Krishnendu Chatterjee, and Martin A. Nowak. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-39625-9."},"publication":"Nature Communications","article_type":"original","has_accepted_license":"1","article_processing_charge":"Yes","day":"12","scopus_import":"1","file":[{"access_level":"open_access","file_name":"2023_NatureComm_Kleshnina.pdf","content_type":"application/pdf","file_size":1601682,"creator":"dernst","relation":"main_file","file_id":"13337","checksum":"5aceefdfe76686267b93ae4fe81899f1","success":1,"date_updated":"2023-07-31T11:32:36Z","date_created":"2023-07-31T11:32:36Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13258","intvolume":" 14","title":"The effect of environmental information on evolution of cooperation in stochastic games","ddc":["000"],"status":"public","abstract":[{"lang":"eng","text":"Many human interactions feature the characteristics of social dilemmas where individual actions have consequences for the group and the environment. The feedback between behavior and environment can be studied with the framework of stochastic games. In stochastic games, the state of the environment can change, depending on the choices made by group members. Past work suggests that such feedback can reinforce cooperative behaviors. In particular, cooperation can evolve in stochastic games even if it is infeasible in each separate repeated game. In stochastic games, participants have an interest in conditioning their strategies on the state of the environment. Yet in many applications, precise information about the state could be scarce. Here, we study how the availability of information (or lack thereof) shapes evolution of cooperation. Already for simple examples of two state games we find surprising effects. In some cases, cooperation is only possible if there is precise information about the state of the environment. In other cases, cooperation is most abundant when there is no information about the state of the environment. We systematically analyze all stochastic games of a given complexity class, to determine when receiving information about the environment is better, neutral, or worse for evolution of cooperation."}],"type":"journal_article","doi":"10.1038/s41467-023-39625-9","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["001029450400031"],"pmid":["37438341"]},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"isi":1,"quality_controlled":"1","publication_identifier":{"eissn":["2041-1723"]},"month":"07","related_material":{"record":[{"id":"13336","status":"public","relation":"research_data"}]},"author":[{"id":"4E21749C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Kleshnina","full_name":"Kleshnina, Maria"},{"first_name":"Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"first_name":"Stepan","last_name":"Simsa","id":"409d615c-2f95-11ee-b934-90a352102c1e","orcid":"0000-0001-6687-1210","full_name":"Simsa, Stepan"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"volume":14,"date_created":"2023-07-23T22:01:11Z","date_updated":"2023-12-13T11:42:38Z","pmid":1,"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir programme, ANR-17-EURE-0010) (to M.K.).","year":"2023","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","ec_funded":1,"file_date_updated":"2023-07-31T11:32:36Z","article_number":"4153"},{"citation":{"chicago":"Kleshnina, Maria. “Kleshnina/Stochgames_info: The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8059564.","short":"M. Kleshnina, (2023).","mla":"Kleshnina, Maria. Kleshnina/Stochgames_info: The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games. Zenodo, 2023, doi:10.5281/ZENODO.8059564.","apa":"Kleshnina, M. (2023). kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games. Zenodo. https://doi.org/10.5281/ZENODO.8059564","ieee":"M. Kleshnina, “kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games.” Zenodo, 2023.","ista":"Kleshnina M. 2023. kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games, Zenodo, 10.5281/ZENODO.8059564.","ama":"Kleshnina M. kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games. 2023. doi:10.5281/ZENODO.8059564"},"oa":1,"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8059564","open_access":"1"}],"doi":"10.5281/ZENODO.8059564","date_published":"2023-06-20T00:00:00Z","article_processing_charge":"No","day":"20","month":"06","publisher":"Zenodo","department":[{"_id":"KrCh"}],"title":"kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games","ddc":["000"],"status":"public","_id":"13336","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_created":"2023-07-31T11:30:46Z","date_updated":"2023-12-13T11:42:37Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"13258"}]},"author":[{"full_name":"Kleshnina, Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Kleshnina"}],"type":"research_data_reference"},{"oa":1,"external_id":{"isi":["001036707700042"],"arxiv":["2304.09930"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.09930"}],"quality_controlled":"1","isi":1,"doi":"10.1109/LICS56636.2023.10175771","conference":{"location":"Boston, MA, United States","start_date":"2023-06-26","end_date":"2023-06-29","name":"LICS: Symposium on Logic in Computer Science"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798350335873"],"issn":["1043-6871"]},"month":"07","year":"2023","acknowledgement":"This research was funded in part by DFG projects 383882557 “SUV” and 427755713 “GOPro”.","publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky"},{"first_name":"Tobias","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"last_name":"Weininger","first_name":"Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian"}],"volume":2023,"date_updated":"2023-12-13T12:06:10Z","date_created":"2023-08-06T22:01:10Z","citation":{"ista":"Kretinsky J, Meggendorfer T, Weininger M. 2023. Stopping criteria for value iteration on stochastic games with quantitative objectives. 38th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science vol. 2023.","ieee":"J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, MA, United States, 2023, vol. 2023.","apa":"Kretinsky, J., Meggendorfer, T., & Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In 38th Annual ACM/IEEE Symposium on Logic in Computer Science (Vol. 2023). Boston, MA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS56636.2023.10175771","ama":"Kretinsky J, Meggendorfer T, Weininger M. Stopping criteria for value iteration on stochastic games with quantitative objectives. In: 38th Annual ACM/IEEE Symposium on Logic in Computer Science. Vol 2023. Institute of Electrical and Electronics Engineers; 2023. doi:10.1109/LICS56636.2023.10175771","chicago":"Kretinsky, Jan, Tobias Meggendorfer, and Maximilian Weininger. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.” In 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Vol. 2023. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/LICS56636.2023.10175771.","mla":"Kretinsky, Jan, et al. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.” 38th Annual ACM/IEEE Symposium on Logic in Computer Science, vol. 2023, Institute of Electrical and Electronics Engineers, 2023, doi:10.1109/LICS56636.2023.10175771.","short":"J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2023."},"publication":"38th Annual ACM/IEEE Symposium on Logic in Computer Science","date_published":"2023-07-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","_id":"13967","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2023","title":"Stopping criteria for value iteration on stochastic games with quantitative objectives","status":"public","oa_version":"Preprint","type":"conference","abstract":[{"text":"A classic solution technique for Markov decision processes (MDP) and stochastic games (SG) is value iteration (VI). Due to its good practical performance, this approximative approach is typically preferred over exact techniques, even though no practical bounds on the imprecision of the result could be given until recently. As a consequence, even the most used model checkers could return arbitrarily wrong results. Over the past decade, different works derived stopping criteria, indicating when the precision reaches the desired level, for various settings, in particular MDP with reachability, total reward, and mean payoff, and SG with reachability.In this paper, we provide the first stopping criteria for VI on SG with total reward and mean payoff, yielding the first anytime algorithms in these settings. To this end, we provide the solution in two flavours: First through a reduction to the MDP case and second directly on SG. The former is simpler and automatically utilizes any advances on MDP. The latter allows for more local computations, heading towards better practical efficiency.Our solution unifies the previously mentioned approaches for MDP and SG and their underlying ideas. To achieve this, we isolate objective-specific subroutines as well as identify objective-independent concepts. These structural concepts, while surprisingly simple, form the very essence of the unified solution.","lang":"eng"}]},{"article_type":"original","citation":{"ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. 2023. Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. 24(2), 9.","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (2023). Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. EPI Sciences. https://doi.org/10.46298/DMTCS.8383","ieee":"A. Biniaz et al., “Token swapping on trees,” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2. EPI Sciences, 2023.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. 2023;24(2). doi:10.46298/DMTCS.8383","chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” Discrete Mathematics and Theoretical Computer Science. EPI Sciences, 2023. https://doi.org/10.46298/DMTCS.8383.","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, Discrete Mathematics and Theoretical Computer Science 24 (2023)."},"publication":"Discrete Mathematics and Theoretical Computer Science","date_published":"2023-01-18T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"18","intvolume":" 24","ddc":["000"],"status":"public","title":"Token swapping on trees","_id":"12833","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2022_DMTCS_Biniaz.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2072197,"creator":"dernst","relation":"main_file","file_id":"12844","date_created":"2023-04-17T08:10:28Z","date_updated":"2023-04-17T08:10:28Z","checksum":"439102ea4f6e2aeefd7107dfb9ccf532","success":1}],"oa_version":"Published Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete. We present some partial results: 1. An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan. 2. Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3. Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2. 3. A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars. In this version, tokens and vertices have colours, and colours have weights. The goal is to get every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved."}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1903.06981"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.46298/DMTCS.8383","publication_identifier":{"issn":["1462-7264"],"eissn":["1365-8050"]},"month":"01","publisher":"EPI Sciences","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"UlWa"}],"publication_status":"published","year":"2023","acknowledgement":"This work was begun at the University of Waterloo and was partially supported by the Natural Sciences and Engineering Council of Canada (NSERC).\r\n","volume":24,"date_updated":"2024-01-04T12:42:09Z","date_created":"2023-04-16T22:01:08Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7950"}]},"author":[{"full_name":"Biniaz, Ahmad","first_name":"Ahmad","last_name":"Biniaz"},{"last_name":"Jain","first_name":"Kshitij","full_name":"Jain, Kshitij"},{"last_name":"Lubiw","first_name":"Anna","full_name":"Lubiw, Anna"},{"full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","first_name":"Zuzana","last_name":"Masárová"},{"full_name":"Miltzow, Tillmann","first_name":"Tillmann","last_name":"Miltzow"},{"first_name":"Debajyoti","last_name":"Mondal","full_name":"Mondal, Debajyoti"},{"full_name":"Naredla, Anurag Murty","last_name":"Naredla","first_name":"Anurag Murty"},{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec"},{"last_name":"Turcotte","first_name":"Alexi","full_name":"Turcotte, Alexi"}],"article_number":"9","file_date_updated":"2023-04-17T08:10:28Z"},{"month":"12","publication_identifier":{"eisbn":["9783031477546"],"issn":["0302-9743"],"isbn":["9783031477539"],"eissn":["1611-3349"]},"quality_controlled":"1","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"language":[{"iso":"eng"}],"conference":{"name":"FC: Financial Cryptography and Data Security","location":"Bol, Brac, Croatia","start_date":"2023-05-01","end_date":"2023-05-05"},"doi":"10.1007/978-3-031-47754-6_18","ec_funded":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","year":"2023","date_created":"2024-01-08T09:30:22Z","date_updated":"2024-01-08T09:36:36Z","volume":13950,"author":[{"first_name":"Mahsa","last_name":"Bastankhah","full_name":"Bastankhah, Mahsa"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maddah-Ali","first_name":"Mohammad Ali","full_name":"Maddah-Ali, Mohammad Ali"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X"}],"day":"01","article_processing_charge":"No","page":"309-325","publication":"27th International Conference on Financial Cryptography and Data Security","citation":{"apa":"Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., & Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. https://doi.org/10.1007/978-3-031-47754-6_18","ieee":"M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in 27th International Conference on Financial Cryptography and Data Security, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325.","ista":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.","ama":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. R2: Boosting liquidity in payment channel networks with online admission control. In: 27th International Conference on Financial Cryptography and Data Security. Vol 13950. Springer Nature; 2023:309-325. doi:10.1007/978-3-031-47754-6_18","chicago":"Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-47754-6_18.","short":"M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.","mla":"Bastankhah, Mahsa, et al. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” 27th International Conference on Financial Cryptography and Data Security, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:10.1007/978-3-031-47754-6_18."},"date_published":"2023-12-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks.","lang":"eng"}],"status":"public","title":"R2: Boosting liquidity in payment channel networks with online admission control","intvolume":" 13950","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14736","oa_version":"None"},{"year":"2023","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"author":[{"full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1194"},{"id":"12000","status":"public","relation":"part_of_dissertation"},{"id":"9644","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"12511"},{"status":"public","relation":"part_of_dissertation","id":"14600"},{"id":"14601","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"10414"}]},"date_created":"2023-11-15T13:39:10Z","date_updated":"2024-01-16T11:58:15Z","file_date_updated":"2023-11-15T13:44:24Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"doi":"10.15479/14539","supervisor":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"isbn":["978-3-99078-036-7"],"issn":["2663 - 337X"]},"_id":"14539","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ddc":["000"],"status":"public","title":"Automated verification and control of infinite state stochastic systems","oa_version":"Published Version","file":[{"date_updated":"2023-11-15T13:43:28Z","date_created":"2023-11-15T13:43:28Z","success":1,"checksum":"f23e002b0059ca78e1fbb864da52dd7e","file_id":"14540","relation":"main_file","creator":"cchlebak","file_size":2116426,"content_type":"application/pdf","file_name":"main.pdf","access_level":"open_access"},{"file_name":"thesis_source.zip","access_level":"closed","creator":"cchlebak","file_size":35884057,"content_type":"application/x-zip-compressed","file_id":"14541","relation":"source_file","date_created":"2023-11-15T13:44:24Z","date_updated":"2023-11-15T13:44:24Z","checksum":"80ca37618a3c7b59866875f8be9b15ed"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"Stochastic systems provide a formal framework for modelling and quantifying uncertainty in systems and have been widely adopted in many application domains. Formal\r\nverification and control of finite state stochastic systems, a subfield of formal methods\r\nalso known as probabilistic model checking, is well studied. In contrast, formal verification and control of infinite state stochastic systems have received comparatively\r\nless attention. However, infinite state stochastic systems commonly arise in practice.\r\nFor instance, probabilistic models that contain continuous probability distributions such\r\nas normal or uniform, or stochastic dynamical systems which are a classical model for\r\ncontrol under uncertainty, both give rise to infinite state systems.\r\nThe goal of this thesis is to contribute to laying theoretical and algorithmic foundations\r\nof fully automated formal verification and control of infinite state stochastic systems,\r\nwith a particular focus on systems that may be executed over a long or infinite time.\r\nWe consider formal verification of infinite state stochastic systems in the setting of\r\nstatic analysis of probabilistic programs and formal control in the setting of controller\r\nsynthesis in stochastic dynamical systems. For both problems, we present some of the\r\nfirst fully automated methods for probabilistic (a.k.a. quantitative) reachability and\r\nsafety analysis applicable to infinite time horizon systems. We also advance the state\r\nof the art of probability 1 (a.k.a. qualitative) reachability analysis for both problems.\r\nFinally, for formal controller synthesis in stochastic dynamical systems, we present a\r\nnovel framework for learning neural network control policies in stochastic dynamical\r\nsystems with formal guarantees on correctness with respect to quantitative reachability,\r\nsafety or reach-avoid specifications.\r\n","lang":"eng"}],"citation":{"chicago":"Zikelic, Dorde. “Automated Verification and Control of Infinite State Stochastic Systems.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/14539.","short":"D. Zikelic, Automated Verification and Control of Infinite State Stochastic Systems, Institute of Science and Technology Austria, 2023.","mla":"Zikelic, Dorde. Automated Verification and Control of Infinite State Stochastic Systems. Institute of Science and Technology Austria, 2023, doi:10.15479/14539.","ieee":"D. Zikelic, “Automated verification and control of infinite state stochastic systems,” Institute of Science and Technology Austria, 2023.","apa":"Zikelic, D. (2023). Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria. https://doi.org/10.15479/14539","ista":"Zikelic D. 2023. Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria.","ama":"Zikelic D. Automated verification and control of infinite state stochastic systems. 2023. doi:10.15479/14539"},"page":"256","date_published":"2023-11-15T00:00:00Z","day":"15","article_processing_charge":"No"},{"publication":"Formal Aspects of Computing","citation":{"mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.","short":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, Formal Aspects of Computing 35 (2023).","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing. Association for Computing Machinery, 2023. https://doi.org/10.1145/3585391.","ama":"Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. 2023;35(2). doi:10.1145/3585391","ista":"Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2023. On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. 35(2), 11.","ieee":"K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” Formal Aspects of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.","apa":"Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery. https://doi.org/10.1145/3585391"},"article_type":"original","date_published":"2023-06-23T00:00:00Z","keyword":["Theoretical Computer Science","Software"],"day":"23","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14778","title":"On lexicographic proof rules for probabilistic termination","status":"public","ddc":["000"],"intvolume":" 35","oa_version":"Published Version","file":[{"date_created":"2024-01-16T08:11:24Z","date_updated":"2024-01-16T08:11:24Z","checksum":"3bb133eeb27ec01649a9a36445d952d9","success":1,"relation":"main_file","file_id":"14804","content_type":"application/pdf","file_size":502522,"creator":"dernst","file_name":"2023_FormalAspectsComputing_Chatterjee.pdf","access_level":"open_access"}],"type":"journal_article","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 a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that 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"}],"issue":"2","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2108.02188"]},"quality_controlled":"1","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"}],"doi":"10.1145/3585391","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"eissn":["1433-299X"],"issn":["0934-5043"]},"acknowledgement":"This research was partially supported by the ERC CoG (grant no. 863818; ForM-SMArt), the Czech Science Foundation (grant no. GA21-24711S), and the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2023","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Ehsan","last_name":"Kafshdar Goharshady","full_name":"Kafshdar Goharshady, Ehsan"},{"first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"full_name":"Zárevúcky, Jiří","last_name":"Zárevúcky","first_name":"Jiří"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10414"}]},"date_created":"2024-01-10T09:27:43Z","date_updated":"2024-01-17T08:19:41Z","volume":35,"article_number":"11","file_date_updated":"2024-01-16T08:11:24Z","ec_funded":1},{"article_processing_charge":"No","day":"21","scopus_import":"1","date_published":"2023-09-21T00:00:00Z","citation":{"chicago":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” In 24th International Symposium on Fundamentals of Computation Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.","short":"J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals of Computation Theory, Springer Nature, 2023, pp. 333–347.","mla":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.” 24th International Symposium on Fundamentals of Computation Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.","ieee":"J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under token sliding,” in 24th International Symposium on Fundamentals of Computation Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.","apa":"Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In 24th International Symposium on Fundamentals of Computation Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24","ista":"Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under token sliding. 24th International Symposium on Fundamentals of Computation Theory. FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.","ama":"Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token sliding. In: 24th International Symposium on Fundamentals of Computation Theory. Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24"},"publication":"24th International Symposium on Fundamentals of Computation Theory","page":"333-347","abstract":[{"lang":"eng","text":"In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Preprint","_id":"14456","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 14292","title":"Shortest dominating set reconfiguration under token sliding","status":"public","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031435867"],"issn":["0302-9743"]},"month":"09","doi":"10.1007/978-3-031-43587-4_24","conference":{"start_date":"2023-09-18","location":"Trier, Germany","end_date":"2023-09-21","name":"FCT: Fundamentals of Computation Theory"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.10847","open_access":"1"}],"external_id":{"arxiv":["2307.10847"]},"quality_controlled":"1","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/978-3-031-43587-4_31"}]},"author":[{"full_name":"Křišťan, Jan Matyáš","last_name":"Křišťan","first_name":"Jan Matyáš"},{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub"}],"volume":14292,"date_updated":"2024-01-22T08:10:49Z","date_created":"2023-10-29T23:01:16Z","year":"2023","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published"},{"related_material":{"record":[{"id":"14600","relation":"earlier_version","status":"public"}]},"author":[{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"volume":37,"date_updated":"2024-01-22T14:08:29Z","date_created":"2024-01-18T07:44:31Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2023","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Association for the Advancement of Artificial Intelligence","publication_status":"published","ec_funded":1,"doi":"10.1609/aaai.v37i10.26407","conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","start_date":"2023-02-07","location":"Washington, DC, United States"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2210.05308"]},"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"quality_controlled":"1","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"]},"month":"06","oa_version":"Preprint","_id":"14830","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 37","title":"Learning control policies for stochastic systems with reach-avoid guarantees","status":"public","issue":"10","abstract":[{"lang":"eng","text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold p in [0,1] over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on 3 stochastic non-linear reinforcement learning tasks."}],"type":"conference","date_published":"2023-06-26T00:00:00Z","citation":{"ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935.","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v37i10.26407","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. 2023. Learning control policies for stochastic systems with reach-avoid guarantees. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 11926–11935.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:11926-11935. doi:10.1609/aaai.v37i10.26407","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i10.26407.","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–11935.","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 10, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–35, doi:10.1609/aaai.v37i10.26407."},"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","page":"11926-11935","article_processing_charge":"No","day":"26","keyword":["General Medicine"]},{"file":[{"access_level":"open_access","file_name":"2023_LNCS_Meggendorfer.pdf","file_size":521951,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"13148","checksum":"59f707a3949c03793251b0d04c62542a","success":1,"date_updated":"2023-06-19T07:18:40Z","date_created":"2023-06-19T07:18:40Z"}],"oa_version":"Published Version","_id":"13139","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Correct approximation of stationary distributions","ddc":["000"],"intvolume":" 13993","abstract":[{"lang":"eng","text":"A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to large instances, and iterative solutions are desirable. It turns out that a naive approach, as used by current model checkers, may yield completely wrong results. We present a new approach, which utilizes recent advances in partial exploration and mean payoff computation to obtain a correct, converging approximation."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2023-04-22T00:00:00Z","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","citation":{"mla":"Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.” TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13993, Springer Nature, 2023, pp. 489–507, doi:10.1007/978-3-031-30823-9_25.","short":"T. Meggendorfer, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 489–507.","chicago":"Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.” In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13993:489–507. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_25.","ama":"Meggendorfer T. Correct approximation of stationary distributions. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13993. Springer Nature; 2023:489-507. doi:10.1007/978-3-031-30823-9_25","ista":"Meggendorfer T. 2023. Correct approximation of stationary distributions. TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 489–507.","ieee":"T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.","apa":"Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_25"},"page":"489-507","day":"22","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","author":[{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"}],"related_material":{"record":[{"id":"14990","status":"public","relation":"research_data"}]},"date_updated":"2024-02-27T07:19:33Z","date_created":"2023-06-18T22:00:46Z","volume":13993,"year":"2023","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","file_date_updated":"2023-06-19T07:18:40Z","conference":{"end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"doi":"10.1007/978-3-031-30823-9_25","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2301.08137"]},"quality_controlled":"1","month":"04","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031308222"]}},{"type":"research_data_reference","abstract":[{"text":"The software artefact to evaluate the approximation of stationary distributions implementation.","lang":"eng"}],"publisher":"Zenodo","department":[{"_id":"KrCh"}],"status":"public","ddc":["000"],"title":"Artefact for: Correct Approximation of Stationary Distributions","year":"2023","_id":"14990","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_updated":"2024-02-27T07:19:32Z","date_created":"2024-02-14T14:27:06Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"13139"}]},"author":[{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"has_accepted_license":"1","article_processing_charge":"No","day":"18","month":"01","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"oa":1,"citation":{"apa":"Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. https://doi.org/10.5281/ZENODO.7548214","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.","ista":"Meggendorfer T. 2023. Artefact for: Correct Approximation of Stationary Distributions, Zenodo, 10.5281/ZENODO.7548214.","ama":"Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:10.5281/ZENODO.7548214","chicago":"Meggendorfer, Tobias. “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.7548214.","short":"T. Meggendorfer, (2023).","mla":"Meggendorfer, Tobias. Artefact for: Correct Approximation of Stationary Distributions. Zenodo, 2023, doi:10.5281/ZENODO.7548214."},"date_published":"2023-01-18T00:00:00Z","doi":"10.5281/ZENODO.7548214"},{"article_processing_charge":"No","month":"12","day":"15","date_published":"2023-12-15T00:00:00Z","conference":{"end_date":"2023-12-16","location":"New Orleans, LO, United States","start_date":"2023-12-10","name":"NeurIPS: Neural Information Processing Systems"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2312.01456"]},"citation":{"chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In 37th Conference on Neural Information Processing Systems, 2023.","mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” 37th Conference on Neural Information Processing Systems, 2023.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., & Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: 37th Conference on Neural Information Processing Systems. ; 2023."},"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.01456","open_access":"1"}],"publication":"37th Conference on Neural Information Processing Systems","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"quality_controlled":"1","ec_funded":1,"abstract":[{"lang":"eng","text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment."}],"type":"conference","author":[{"full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699"},{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"full_name":"Verma, Abhinav","last_name":"Verma","first_name":"Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"}],"oa_version":"Preprint","date_created":"2024-02-25T09:23:24Z","date_updated":"2024-02-28T12:20:11Z","_id":"15023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Compositional policy learning in stochastic control systems with formal guarantees","publication_status":"epub_ahead","status":"public"},{"publication_identifier":{"isbn":["9783959772617"],"issn":["1868-8969"]},"month":"12","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.4230/LIPIcs.FSTTCS.2022.29","conference":{"name":"FSTTC: Foundations of Software Technology and Theoretical Computer Science","start_date":"2022-12-18","location":"Madras, India","end_date":"2022-12-20"},"language":[{"iso":"eng"}],"article_number":"29","ec_funded":1,"file_date_updated":"2023-01-20T10:39:44Z","acknowledgement":"The research was partially supported by the Hong Kong Research Grants Council ECS\r\nProject No. 26208122, ERC CoG 863818 (FoRM-SMArt), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, HKUST– Kaisa Joint Research Institute Project Grant HKJRI3A-055 and HKUST Startup Grant R9272. Ali Ahmadi and Roodabeh Safavi were interns at HKUST.","year":"2022","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","author":[{"last_name":"Ahmadi","first_name":"Ali","full_name":"Ahmadi, Ali"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar"},{"full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165"},{"full_name":"Safavi Hemami, Roodabeh","id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","last_name":"Safavi Hemami","first_name":"Roodabeh"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde"}],"volume":250,"date_updated":"2023-02-07T09:19:43Z","date_created":"2023-01-01T23:00:50Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"14","citation":{"chicago":"Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29.","short":"A. Ahmadi, K. Chatterjee, A.K. Goharshady, T. Meggendorfer, R. Safavi Hemami, D. Zikelic, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29.","apa":"Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29","ieee":"A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.","ista":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.","ama":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29"},"publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","date_published":"2022-12-14T00:00:00Z","type":"conference","abstract":[{"text":"Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset.","lang":"eng"}],"_id":"12102","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 250","status":"public","title":"Algorithms and hardness results for computing cores of Markov chains","ddc":["000"],"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":872534,"creator":"dernst","file_name":"2022_LIPICs_Ahmadi.pdf","access_level":"open_access","date_created":"2023-01-20T10:39:44Z","date_updated":"2023-01-20T10:39:44Z","checksum":"6660c802489013f034c9e8bd57f4d46e","success":1,"relation":"main_file","file_id":"12324"}]},{"volume":250,"date_created":"2023-01-01T23:00:50Z","date_updated":"2023-02-13T09:06:43Z","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Jecker, Ismael R","first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","last_name":"Svoboda"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2022","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the ERC CoG 863818\r\n(ForM-SMArt).\r\nIsmaël Jecker: The research was partially supported by the ERC grant 950398 (INFSYS).\r\nJakub Svoboda: The research was partially supported by the ERC CoG 863818 (ForM-SMArt)","ec_funded":1,"file_date_updated":"2023-01-20T10:19:19Z","article_number":"11:1-11:14","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.FSTTCS.2022.11","conference":{"end_date":"2022-12-20","start_date":"2022-12-18","location":"Madras, India","name":"FSTTC: Foundations of Software Technology and Theoretical Computer Science"},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"isbn":["9783959772617"],"issn":["1868-8969"]},"month":"12","oa_version":"Published Version","file":[{"file_size":657396,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2022_LIPICs_Chatterjee.pdf","checksum":"a21e3ba2421e2c4a06aa2cb6d530ede1","success":1,"date_updated":"2023-01-20T10:19:19Z","date_created":"2023-01-20T10:19:19Z","relation":"main_file","file_id":"12323"}],"intvolume":" 250","ddc":["000"],"status":"public","title":"Complexity of spatial games","_id":"12101","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Spatial games form a widely-studied class of games from biology and physics modeling the evolution of social behavior. Formally, such a game is defined by a square (d by d) payoff matrix M and an undirected graph G. Each vertex of G represents an individual, that initially follows some strategy i ∈ {1,2,…,d}. In each round of the game, every individual plays the matrix game with each of its neighbors: An individual following strategy i meeting a neighbor following strategy j receives a payoff equal to the entry (i,j) of M. Then, each individual updates its strategy to its neighbors' strategy with the highest sum of payoffs, and the next round starts. The basic computational problems consist of reachability between configurations and the average frequency of a strategy. For general spatial games and graphs, these problems are in PSPACE. In this paper, we examine restricted setting: the game is a prisoner’s dilemma; and G is a subgraph of grid. We prove that basic computational problems for spatial games with prisoner’s dilemma on a subgraph of a grid are PSPACE-hard.","lang":"eng"}],"type":"conference","date_published":"2022-12-14T00:00:00Z","citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.11","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.","ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11."},"publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","has_accepted_license":"1","article_processing_charge":"No","day":"14","scopus_import":"1"},{"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Association for the Advancement of Artificial Intelligence","year":"2022","date_updated":"2023-02-20T07:19:12Z","date_created":"2023-02-19T23:00:56Z","volume":36,"author":[{"full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","first_name":"Tobias","last_name":"Meggendorfer"}],"month":"06","publication_identifier":{"isbn":["1577358767"],"eissn":["2374-3468"]},"quality_controlled":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2203.01640","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2203.01640"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2022-03-01","start_date":"2022-02-22","location":"Virtual","name":"Conference on Artificial Intelligence"},"doi":"10.1609/aaai.v36i9.21222","type":"conference","abstract":[{"text":"We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered for SSP, which however is oblivious to the incurred risk. We present an alternative view, instead optimizing conditional value-at-risk (CVaR), an established risk measure. We treat both Markov chains as well as MDP and introduce, through novel insights, two algorithms, based on linear programming and value iteration, respectively. Both algorithms offer precise and provably correct solutions. Evaluation of our prototype implementation shows that risk-aware control is feasible on several moderately sized models.","lang":"eng"}],"issue":"9","status":"public","title":"Risk-aware stochastic shortest path","intvolume":" 36","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12568","oa_version":"Preprint","scopus_import":"1","day":"28","article_processing_charge":"No","page":"9858-9867","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022","citation":{"ama":"Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222","ieee":"T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.","apa":"Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21222","ista":"Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867.","short":"T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.","mla":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222.","chicago":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 36:9858–67. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i9.21222."},"date_published":"2022-06-28T00:00:00Z"},{"acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","year":"2022","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"publisher":"Brown University","publication_status":"published","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"9296"}]},"author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","last_name":"Arroyo Guevara","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M"},{"full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","first_name":"Zuzana","last_name":"Masárová"},{"last_name":"Parada","first_name":"Irene","full_name":"Parada, Irene"},{"first_name":"Daniel","last_name":"Perz","full_name":"Perz, Daniel"},{"full_name":"Pilz, Alexander","first_name":"Alexander","last_name":"Pilz"},{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}],"volume":26,"date_created":"2022-08-21T22:01:56Z","date_updated":"2023-02-23T13:54:21Z","ec_funded":1,"file_date_updated":"2022-08-22T06:42:42Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2101.03928"]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"quality_controlled":"1","doi":"10.7155/jgaa.00591","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1526-1719"]},"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11938","intvolume":" 26","status":"public","ddc":["000"],"title":"On compatible matchings","file":[{"checksum":"dc6e255e3558faff924fd9e370886c11","success":1,"date_created":"2022-08-22T06:42:42Z","date_updated":"2022-08-22T06:42:42Z","relation":"main_file","file_id":"11940","file_size":694538,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf"}],"oa_version":"Published Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge."}],"citation":{"chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” Journal of Graph Algorithms and Applications. Brown University, 2022. https://doi.org/10.7155/jgaa.00591.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240.","ieee":"O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591"},"publication":"Journal of Graph Algorithms and Applications","page":"225-240","article_type":"original","date_published":"2022-06-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01"},{"ec_funded":1,"abstract":[{"text":"In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal.","lang":"eng"}],"type":"preprint","article_number":"2209.14368","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Mona","last_name":"Mohammadi","id":"4363614d-b686-11ed-a7d5-ac9e4a24bc2e","full_name":"Mohammadi, Mona"},{"orcid":"0000-0001-5103-038X","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J"}],"oa_version":"Preprint","date_created":"2023-02-24T12:21:40Z","date_updated":"2023-02-27T10:07:40Z","_id":"12677","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","year":"2022","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"title":"Repeated prophet inequality with near-optimal bounds","publication_status":"submitted","status":"public","article_processing_charge":"No","month":"09","day":"28","date_published":"2022-09-28T00:00:00Z","doi":"10.48550/ARXIV.2209.14368","language":[{"iso":"eng"}],"oa":1,"citation":{"short":"K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).","mla":"Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, 2209.14368, doi:10.48550/ARXIV.2209.14368.","chicago":"Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2209.14368.","ama":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv. doi:10.48550/ARXIV.2209.14368","ieee":"K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. .","apa":"Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv. https://doi.org/10.48550/ARXIV.2209.14368","ista":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368."},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2209.14368","open_access":"1"}],"external_id":{"arxiv":["2209.14368"]},"publication":"arXiv","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}]},{"publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2022","acknowledgement":"This work is partially funded by the German Research Foundation (DFG) projects Verified Model Checkers (No. 317422601) and Statistical Unbounded Verification (No. 383882557), and the Alexander von Humboldt Foundation with funds from the German Federal Ministry of Education and Research. It is an extended version of [21], including all proofs together with further explanations and examples. Moreover, we provide a new, more efficient construction based on (total) preorders, unifying previous optimizations. Experiments are performed with a new, performant implementation, comparing our approach to the current state of the art.","volume":59,"date_created":"2022-01-06T12:37:27Z","date_updated":"2023-08-02T13:49:28Z","author":[{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Waldmann","first_name":"Clara","full_name":"Waldmann, Clara"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"}],"file_date_updated":"2022-01-07T07:50:31Z","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000735765500001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00236-021-00412-y","publication_identifier":{"issn":["0001-5903"],"eissn":["1432-0525"]},"month":"10","intvolume":" 59","title":"Index appearance record with preorders","status":"public","ddc":["000"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"10602","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2021_ActaInfor_Křetínský.pdf","creator":"cchlebak","content_type":"application/pdf","file_size":1066082,"file_id":"10603","relation":"main_file","success":1,"checksum":"bf1c195b6aaf59e8530cf9e3a9d731f7","date_created":"2022-01-07T07:50:31Z","date_updated":"2022-01-07T07:50:31Z"}],"type":"journal_article","abstract":[{"text":"Transforming ω-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches.","lang":"eng"}],"page":"585-618","article_type":"original","citation":{"mla":"Kretinsky, Jan, et al. “Index Appearance Record with Preorders.” Acta Informatica, vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y.","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record with Preorders.” Acta Informatica. Springer Nature, 2022. https://doi.org/10.1007/s00236-021-00412-y.","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. Acta Informatica. 2022;59:585-618. doi:10.1007/s00236-021-00412-y","ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance record with preorders. Acta Informatica. 59, 585–618.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature. https://doi.org/10.1007/s00236-021-00412-y","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022."},"publication":"Acta Informatica","date_published":"2022-10-01T00:00:00Z","keyword":["computer networks and communications","information systems","software"],"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01"},{"acknowledgement":"K.C. acknowledges support from ERC Consolidator Grant No. (863818: ForM-SMart). A.P. acknowledges support from FWF Grant No. J-4220. M.A.N. acknowledges support from Office of Naval Research grant N00014-16-1-2914 and from the John Templeton Foundation.","year":"2022","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","author":[{"full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec"},{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}],"volume":12,"date_updated":"2023-08-02T14:13:07Z","date_created":"2022-02-06T23:01:30Z","article_number":"1526","ec_funded":1,"file_date_updated":"2022-02-07T14:57:59Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2012.15155"],"isi":["000749198000039"]},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"isi":1,"quality_controlled":"1","doi":"10.1038/s41598-022-05333-5","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2045-2322"]},"month":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"10731","intvolume":" 12","status":"public","ddc":["570"],"title":"Infection dynamics of COVID-19 virus under lockdown and reopening","oa_version":"Published Version","file":[{"creator":"alisjak","file_size":2971922,"content_type":"application/pdf","access_level":"open_access","file_name":"2022_ScientificReports_Svoboda.pdf","success":1,"checksum":"247afd30c173390940f099ead35a28ed","date_updated":"2022-02-07T14:57:59Z","date_created":"2022-02-07T14:57:59Z","file_id":"10744","relation":"main_file"}],"type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"Motivated by COVID-19, we develop and analyze a simple stochastic model for the spread of disease in human population. We track how the number of infected and critically ill people develops over time in order to estimate the demand that is imposed on the hospital system. To keep this demand under control, we consider a class of simple policies for slowing down and reopening society and we compare their efficiency in mitigating the spread of the virus from several different points of view. We find that in order to avoid overwhelming of the hospital system, a policy must impose a harsh lockdown or it must react swiftly (or both). While reacting swiftly is universally beneficial, being harsh pays off only when the country is patient about reopening and when the neighboring countries coordinate their mitigation efforts. Our work highlights the importance of acting decisively when closing down and the importance of patience and coordination between neighboring countries when reopening."}],"citation":{"ama":"Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 2022;12(1). doi:10.1038/s41598-022-05333-5","ista":"Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2022. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 12(1), 1526.","ieee":"J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.","apa":"Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-05333-5","mla":"Svoboda, Jakub, et al. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.” Scientific Reports, vol. 12, no. 1, 1526, Springer Nature, 2022, doi:10.1038/s41598-022-05333-5.","short":"J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Scientific Reports 12 (2022).","chicago":"Svoboda, Jakub, Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.” Scientific Reports. Springer Nature, 2022. https://doi.org/10.1038/s41598-022-05333-5."},"publication":"Scientific Reports","article_type":"original","date_published":"2022-01-27T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"27"},{"publication":"Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation","citation":{"short":"D. Zikelic, B.-Y.E. Chang, P. Bolignano, F. Raimondi, in:, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–457.","mla":"Zikelic, Dorde, et al. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.” Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–57, doi:10.1145/3519939.3523435.","chicago":"Zikelic, Dorde, Bor-Yuh Evan Chang, Pauline Bolignano, and Franco Raimondi. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.” In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 442–57. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519939.3523435.","ama":"Zikelic D, Chang B-YE, Bolignano P, Raimondi F. Differential cost analysis with simultaneous potentials and anti-potentials. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2022:442-457. doi:10.1145/3519939.3523435","apa":"Zikelic, D., Chang, B.-Y. E., Bolignano, P., & Raimondi, F. (2022). Differential cost analysis with simultaneous potentials and anti-potentials. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 442–457). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3519939.3523435","ieee":"D. Zikelic, B.-Y. E. Chang, P. Bolignano, and F. Raimondi, “Differential cost analysis with simultaneous potentials and anti-potentials,” in Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, United States, 2022, pp. 442–457.","ista":"Zikelic D, Chang B-YE, Bolignano P, Raimondi F. 2022. Differential cost analysis with simultaneous potentials and anti-potentials. Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 442–457."},"page":"442-457","date_published":"2022-06-09T00:00:00Z","scopus_import":"1","day":"09","article_processing_charge":"No","has_accepted_license":"1","_id":"11459","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["000"],"status":"public","title":"Differential cost analysis with simultaneous potentials and anti-potentials","file":[{"date_created":"2022-06-27T07:38:21Z","date_updated":"2022-06-27T07:38:21Z","checksum":"7eb915a2ca5b5ce4729321f33b2e16e1","success":1,"relation":"main_file","file_id":"11466","content_type":"application/pdf","file_size":318697,"creator":"dernst","file_name":"2022_PLDI_Zikelic.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"conference","abstract":[{"text":"We present a novel approach to differential cost analysis that, given a program revision, attempts to statically bound the difference in resource usage, or cost, between the two program versions. Differential cost analysis is particularly interesting because of the many compelling applications for it, such as detecting resource-use regressions at code-review time or proving the absence of certain side-channel vulnerabilities. One prior approach to differential cost analysis is to apply relational reasoning that conceptually constructs a product program on which one can over-approximate the difference in costs between the two program versions. However, a significant challenge in any relational approach is effectively aligning the program versions to get precise results. In this paper, our key insight is that we can avoid the need for and the limitations of program alignment if, instead, we bound the difference of two cost-bound summaries rather than directly bounding the concrete cost difference. In particular, our method computes a threshold value for the maximal difference in cost between two program versions simultaneously using two kinds of cost-bound summaries---a potential function that evaluates to an upper bound for the cost incurred in the first program and an anti-potential function that evaluates to a lower bound for the cost incurred in the second. Our method has a number of desirable properties: it can be fully automated, it allows optimizing the threshold value on relative cost, it is suitable for programs that are not syntactically similar, and it supports non-determinism. We have evaluated an implementation of our approach on a number of program pairs collected from the literature, and we find that our method computes tight threshold values on relative cost in most examples.","lang":"eng"}],"external_id":{"arxiv":["2204.00870"],"isi":["000850435600030"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"quality_controlled":"1","isi":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"conference":{"start_date":"2022-06-13","location":"San Diego, CA, United States","end_date":"2022-06-17","name":"PLDI: Programming Language Design and Implementation"},"doi":"10.1145/3519939.3523435","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"isbn":["9781450392655"]},"year":"2022","acknowledgement":"We thank Shaun Willows, Thomas Lugnet, and the Living Room Application Vending team for suggesting threshold\r\nbounds as a developer-friendly way to interact with a differential cost analyzer, and we thank Jim Christy, Daniel\r\nSchoepe, and the Prime Video Automated Reasoning team for their support and helpful suggestions throughout the\r\nproject. We also thank Michael Emmi for feedback on an earlier version of this paper. And finally, we thank the anonymous reviewers for their useful feedback and Aws Albarghouthi for shepherding the final version of the paper. Ðorđe Žikelić was also partially supported by ERC CoG 863818 (FoRM-SMArt).","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","author":[{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"},{"full_name":"Chang, Bor-Yuh Evan","last_name":"Chang","first_name":"Bor-Yuh Evan"},{"last_name":"Bolignano","first_name":"Pauline","full_name":"Bolignano, Pauline"},{"full_name":"Raimondi, Franco","last_name":"Raimondi","first_name":"Franco"}],"date_created":"2022-06-21T09:26:15Z","date_updated":"2023-08-03T07:22:33Z","file_date_updated":"2022-06-27T07:38:21Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"},{"article_number":"034321","ec_funded":1,"department":[{"_id":"KrCh"}],"publisher":"American Physical Society","publication_status":"published","year":"2022","acknowledgement":"K.C. acknowledges support from ERC Start Grant No. (279307: Graph Games), ERC Consolidator Grant No. (863818: ForM-SMart), and Austrian Science Fund (FWF)\r\nGrants No. P23499-N23 and No. S11407-N23 (RiSE). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385.","volume":106,"date_updated":"2023-08-04T09:50:44Z","date_created":"2023-01-16T09:57:57Z","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]},"month":"09","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-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"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000870243100001"],"arxiv":["2210.02394"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.02394"}],"language":[{"iso":"eng"}],"doi":"10.1103/physreve.106.034321","type":"journal_article","issue":"3","abstract":[{"text":"Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local minima cannot be escaped by mild perturbations of the network. Motivated by these anomalies, we introduce best-edge dynamics (BED), a new plausible stochastic process. We prove that BED always reaches balance and that it does so fast in various interesting settings.","lang":"eng"}],"intvolume":" 106","status":"public","title":"Social balance on networks: Local minima and best-edge dynamics","_id":"12257","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"29","article_type":"original","citation":{"ista":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. 2022. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 106(3), 034321.","ieee":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.","apa":"Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.106.034321","ama":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 2022;106(3). doi:10.1103/physreve.106.034321","chicago":"Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” Physical Review E. American Physical Society, 2022. https://doi.org/10.1103/physreve.106.034321.","mla":"Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” Physical Review E, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:10.1103/physreve.106.034321.","short":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical Review E 106 (2022)."},"publication":"Physical Review E","date_published":"2022-09-29T00:00:00Z"},{"title":"Direct reciprocity between individuals that use different strategy spaces","ddc":["000","570"],"status":"public","intvolume":" 18","_id":"12280","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"file_id":"12460","relation":"main_file","success":1,"checksum":"31b6b311b6731f1658277a9dfff6632c","date_updated":"2023-01-30T11:28:13Z","date_created":"2023-01-30T11:28:13Z","access_level":"open_access","file_name":"2022_PlosCompBio_Schmid.pdf","creator":"dernst","content_type":"application/pdf","file_size":3143222}],"type":"journal_article","abstract":[{"text":"In repeated interactions, players can use strategies that respond to the outcome of previous rounds. Much of the existing literature on direct reciprocity assumes that all competing individuals use the same strategy space. Here, we study both learning and evolutionary dynamics of players that differ in the strategy space they explore. We focus on the infinitely repeated donation game and compare three natural strategy spaces: memory-1 strategies, which consider the last moves of both players, reactive strategies, which respond to the last move of the co-player, and unconditional strategies. These three strategy spaces differ in the memory capacity that is needed. We compute the long term average payoff that is achieved in a pairwise learning process. We find that smaller strategy spaces can dominate larger ones. For weak selection, unconditional players dominate both reactive and memory-1 players. For intermediate selection, reactive players dominate memory-1 players. Only for strong selection and low cost-to-benefit ratio, memory-1 players dominate the others. We observe that the supergame between strategy spaces can be a social dilemma: maximum payoff is achieved if both players explore a larger strategy space, but smaller strategy spaces dominate.","lang":"eng"}],"issue":"6","article_type":"original","publication":"PLOS Computational Biology","citation":{"ama":"Schmid L, Hilbe C, Chatterjee K, Nowak M. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 2022;18(6). doi:10.1371/journal.pcbi.1010149","ieee":"L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” PLOS Computational Biology, vol. 18, no. 6. Public Library of Science, 2022.","apa":"Schmid, L., Hilbe, C., Chatterjee, K., & Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1010149","ista":"Schmid L, Hilbe C, Chatterjee K, Nowak M. 2022. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 18(6), e1010149.","short":"L. Schmid, C. Hilbe, K. Chatterjee, M. Nowak, PLOS Computational Biology 18 (2022).","mla":"Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” PLOS Computational Biology, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:10.1371/journal.pcbi.1010149.","chicago":"Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” PLOS Computational Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pcbi.1010149."},"date_published":"2022-06-14T00:00:00Z","keyword":["Computational Theory and Mathematics","Cellular and Molecular Neuroscience","Genetics","Molecular Biology","Ecology","Modeling and Simulation","Ecology","Evolution","Behavior and Systematics"],"scopus_import":"1","day":"14","has_accepted_license":"1","article_processing_charge":"No","publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"KrCh"}],"year":"2022","acknowledgement":"This work was supported by the European Research Council (https://erc.europa.eu/)\r\nCoG 863818 (ForM-SMArt) (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","pmid":1,"date_created":"2023-01-16T10:02:51Z","date_updated":"2023-08-04T10:27:08Z","volume":18,"author":[{"full_name":"Schmid, Laura","first_name":"Laura","last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329"},{"last_name":"Hilbe","first_name":"Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"article_number":"e1010149","file_date_updated":"2023-01-30T11:28:13Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000843626800031"],"pmid":["35700167"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1010149","month":"06","publication_identifier":{"eissn":["1553-7358"]}},{"month":"02","publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"oa":1,"external_id":{"isi":["000731918100001"],"arxiv":["1904.13360"]},"main_file_link":[{"url":"https://arxiv.org/abs/1904.13360","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1287/moor.2020.1116","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Institute for Operations Research and the Management Sciences","acknowledgement":"Partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT through grant C15E03.\r\n","year":"2022","date_created":"2021-04-08T09:33:31Z","date_updated":"2023-09-05T13:16:11Z","volume":47,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Raimundo J","last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J"},{"first_name":"Bruno","last_name":"Ziliotto","full_name":"Ziliotto, Bruno"}],"keyword":["Management Science and Operations Research","General Mathematics","Computer Science Applications"],"scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","page":"100-119","publication":"Mathematics of Operations Research","citation":{"apa":"Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116","ieee":"K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.","ista":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.","ama":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119. doi:10.1287/moor.2020.1116","chicago":"Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.","short":"K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.","mla":"Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116."},"date_published":"2022-02-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite memory. This implies notably that approximating the long-run value is recursively enumerable, as well as a weak continuity property of the value with respect to the transition function. ","lang":"eng"}],"issue":"1","status":"public","title":"Finite-memory strategies in POMDPs with long-run average objectives","intvolume":" 47","_id":"9311","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint"},{"acknowledgement":"We thank Pranav Ashok and Maximilian Weininger for their contributions to spiritual predecessors of PET as well as motivating the initial development of this tool.","year":"2022","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"volume":13505,"date_updated":"2023-09-05T15:11:51Z","date_created":"2023-01-12T12:11:07Z","quality_controlled":"1","doi":"10.1007/978-3-031-19992-9_20","conference":{"location":"Virtual","start_date":"2022-10-25","end_date":"2022-10-28","name":"ATVA: Automated Technology for Verification and Analysis"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783031199929"],"isbn":["9783031199912"],"eissn":["1611-3349"]},"month":"10","_id":"12170","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 13505","title":"PET – A partial exploration tool for probabilistic verification","status":"public","oa_version":"None","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We present PET, a specialized and highly optimized framework for partial exploration on probabilistic systems. Over the last decade, several significant advances in the analysis of Markov decision processes employed partial exploration. In a nutshell, this idea allows to focus computation on specific parts of the system, guided by heuristics, while maintaining correctness. In particular, only relevant parts of the system are constructed on demand, which in turn potentially allows to omit constructing large parts of the system. Depending on the model, this leads to dramatic speed-ups, in extreme cases even up to an arbitrary factor. PET unifies several previous implementations and provides a flexible framework to easily implement partial exploration for many further problems. Our experimental evaluation shows significant improvements compared to the previous implementations while vastly reducing the overhead required to add support for additional properties."}],"citation":{"chicago":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:320–26. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19992-9_20.","mla":"Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.” 20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20.","short":"T. Meggendorfer, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 320–326.","ista":"Meggendorfer T. 2022. PET – A partial exploration tool for probabilistic verification. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 320–326.","ieee":"T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.","apa":"Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_20","ama":"Meggendorfer T. PET – A partial exploration tool for probabilistic verification. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:320-326. doi:10.1007/978-3-031-19992-9_20"},"publication":"20th International Symposium on Automated Technology for Verification and Analysis","page":"320-326","date_published":"2022-10-21T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"21"},{"abstract":[{"lang":"eng","text":"Fixed-horizon planning considers a weighted graph and asks to construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping-time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary as the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping-time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time."}],"type":"journal_article","oa_version":"Preprint","_id":"11402","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Graph planning with expected finite horizon","status":"public","intvolume":" 129","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2022-11-01T00:00:00Z","publication":"Journal of Computer and System Sciences","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences. Elsevier, 2022. https://doi.org/10.1016/j.jcss.2022.04.003.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences, vol. 129, Elsevier, 2022, pp. 1–21, doi:10.1016/j.jcss.2022.04.003.","short":"K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21.","ista":"Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.","apa":"Chatterjee, K., & Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2022.04.003","ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 2022;129:1-21. doi:10.1016/j.jcss.2022.04.003"},"article_type":"original","page":"1-21","ec_funded":1,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"id":"7402","status":"public","relation":"earlier_version"}]},"date_updated":"2023-09-07T14:48:11Z","date_created":"2022-05-22T22:01:40Z","volume":129,"acknowledgement":"This work was partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407 and by the grant ERC CoG 863818 (ForM-SMArt).","year":"2022","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Elsevier","month":"11","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"doi":"10.1016/j.jcss.2022.04.003","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1802.03642"}],"oa":1,"external_id":{"arxiv":["1802.03642"],"isi":["000805002800001"]},"isi":1,"quality_controlled":"1","project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-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"}]},{"intvolume":" 243","status":"public","title":"Anytime guarantees for reachability in uncountable Markov decision processes","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12775","file":[{"file_name":"2022_LIPIcS_Grover.pdf","access_level":"open_access","content_type":"application/pdf","file_size":960036,"creator":"dernst","relation":"main_file","file_id":"14372","date_updated":"2023-09-26T10:43:15Z","date_created":"2023-09-26T10:43:15Z","checksum":"e282e43d3ae0ba6e067b72f4583e13c0","success":1}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a sequence of approximations converging to the true value in the limit, our aim is to obtain an algorithm with guarantees on the precision of the approximation.\r\nAs this problem is undecidable in general, assumptions on the MDP are necessary. Our main contribution is to identify sufficient assumptions that are as weak as possible, thus approaching the \"boundary\" of which systems can be correctly and reliably analyzed. To this end, we also argue why each of our assumptions is necessary for algorithms based on processing finitely many observations.\r\nWe present two solution variants. The first one provides converging lower bounds under weaker assumptions than typical ones from previous works concerned with guarantees. The second one then utilizes stronger assumptions to additionally provide converging upper bounds. Altogether, we obtain an anytime algorithm, i.e. yielding a sequence of approximants with known and iteratively improving precision, converging to the true value in the limit. Besides, due to the generality of our assumptions, our algorithms are very general templates, readily allowing for various heuristics from literature in contrast to, e.g., a specific discretization algorithm. Our theoretical contribution thus paves the way for future practical improvements without sacrificing correctness guarantees."}],"citation":{"apa":"Grover, K., Kretinsky, J., Meggendorfer, T., & Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11","ieee":"K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.","ista":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. 2022. Anytime guarantees for reachability in uncountable Markov decision processes. 33rd International Conference on Concurrency Theory . CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 11.","ama":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: 33rd International Conference on Concurrency Theory . Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.CONCUR.2022.11","chicago":"Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” In 33rd International Conference on Concurrency Theory , Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11.","short":"K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” 33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11."},"publication":"33rd International Conference on Concurrency Theory ","date_published":"2022-09-15T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"15","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2022","acknowledgement":"Kush Grover: The author has been supported by the DFG research training group GRK\r\n2428 ConVeY.\r\nMaximilian Weininger: The author has been partially supported by DFG projects 383882557\r\nStatistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic\r\nVerification (GOPro)","volume":243,"date_updated":"2023-09-26T10:43:30Z","date_created":"2023-03-28T08:09:32Z","author":[{"first_name":"Kush","last_name":"Grover","full_name":"Grover, Kush"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky"},{"full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165"},{"last_name":"Weininger","first_name":"Maimilian","full_name":"Weininger, Maimilian"}],"article_number":"11","file_date_updated":"2023-09-26T10:43:15Z","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2008.04824"]},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2022.11","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2022-09-13","location":"Warsaw, Poland","end_date":"2022-09-16"},"publication_identifier":{"issn":["1868-8969"]},"month":"09"},{"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000870304500004"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-13185-1_4","conference":{"name":"CAV: Computer Aided Verification","start_date":"2022-08-07","location":"Haifa, Israel","end_date":"2022-08-10"},"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031131844"],"issn":["0302-9743"]},"month":"08","department":[{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055, the HKUST Startup Grant R9272 and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2022","volume":13371,"date_created":"2022-08-28T22:02:02Z","date_updated":"2023-11-30T10:55:37Z","related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"file_date_updated":"2022-08-29T09:17:01Z","page":"55-78","citation":{"ista":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete certificates for auantitative termination analysis of probabilistic programs. Proceedings of the 34th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.","ieee":"K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.","apa":"Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4","ama":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete certificates for auantitative termination analysis of probabilistic programs. In: Proceedings of the 34th International Conference on Computer Aided Verification. Vol 13371. Springer; 2022:55-78. doi:10.1007/978-3-031-13185-1_4","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022. https://doi.org/10.1007/978-3-031-13185-1_4.","mla":"Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.","short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings of the 34th International Conference on Computer Aided Verification, Springer, 2022, pp. 55–78."},"publication":"Proceedings of the 34th International Conference on Computer Aided Verification","date_published":"2022-08-07T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","day":"07","intvolume":" 13371","title":"Sound and complete certificates for auantitative termination analysis of probabilistic programs","ddc":["000"],"status":"public","_id":"12000","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"file_size":505094,"content_type":"application/pdf","creator":"alisjak","file_name":"2022_LNCS_Chatterjee.pdf","access_level":"open_access","date_updated":"2022-08-29T09:17:01Z","date_created":"2022-08-29T09:17:01Z","checksum":"24e0f810ec52735a90ade95198bc641d","success":1,"relation":"main_file","file_id":"12003"}],"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold p∈[0,1], we aim for certificates proving that the program terminates with probability at least 1−p. The basic idea of our approach is to find a terminating stochastic invariant, i.e. a subset SI of program states such that (i) the probability of the program ever leaving SI is no more than p, and (ii) almost-surely, the program either leaves SI or terminates.\r\n\r\nWhile stochastic invariants are already well-known, we provide the first proof that the idea above is not only sound, but also complete for quantitative termination analysis. We then introduce a novel sound and complete characterization of stochastic invariants that enables template-based approaches for easy synthesis of quantitative termination certificates, especially in affine or polynomial forms. Finally, by combining this idea with the existing martingale-based methods that are relatively complete for qualitative termination analysis, we obtain the first automated, sound, and relatively complete algorithm for quantitative termination analysis. Notably, our completeness guarantees for quantitative termination analysis are as strong as the best-known methods for the qualitative variant.\r\n\r\nOur prototype implementation demonstrates the effectiveness of our approach on various probabilistic programs. We also demonstrate that our algorithm certifies lower bounds on termination probability for probabilistic programs that are beyond the reach of previous methods.","lang":"eng"}]},{"ec_funded":1,"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2022","publication_status":"published","publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"}]},"date_created":"2023-02-05T17:29:50Z","date_updated":"2023-11-30T10:55:37Z","volume":36,"month":"06","publication_identifier":{"issn":["2159-5399"],"isbn":["9781577358350"],"eissn":["2374-3468"]},"main_file_link":[{"url":"https://arxiv.org/abs/2112.09495","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2112.09495"]},"quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"doi":"10.1609/aaai.v36i7.20695","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. \r\n In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present a method for learning neural network RSMs. \r\n We prove that our approach guarantees a.s. asymptotic stability of the system and\r\n provides the first method to obtain bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n Finally, we validate our approach experimentally on a set of nonlinear stochastic reinforcement learning environments with neural network policies."}],"issue":"7","_id":"12511","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Stability verification in stochastic control systems via neural network supermartingales","intvolume":" 36","oa_version":"Preprint","scopus_import":"1","keyword":["General Medicine"],"day":"28","article_processing_charge":"No","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","citation":{"ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(7):7326-7336. doi:10.1609/aaai.v36i7.20695","apa":"Lechner, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i7.20695","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i7.20695."},"article_type":"original","page":"7326-7336","date_published":"2022-06-28T00:00:00Z"},{"ec_funded":1,"abstract":[{"text":"In this work, we address the problem of learning provably stable neural\r\nnetwork policies for stochastic control systems. While recent work has\r\ndemonstrated the feasibility of certifying given policies using martingale\r\ntheory, the problem of how to learn such policies is little explored. Here, we\r\nstudy the effectiveness of jointly learning a policy together with a martingale\r\ncertificate that proves its stability using a single learning algorithm. We\r\nobserve that the joint optimization problem becomes easily stuck in local\r\nminima when starting from a randomly initialized policy. Our results suggest\r\nthat some form of pre-training of the policy is required for the joint\r\noptimization to repair and verify the policy successfully.","lang":"eng"}],"type":"preprint","oa_version":"Preprint","date_updated":"2023-11-30T10:55:37Z","date_created":"2023-11-24T13:22:30Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"}]},"author":[{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","publication_status":"submitted","title":"Learning stabilizing policies in stochastic control systems","_id":"14601","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2022","article_processing_charge":"No","month":"05","day":"24","language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2205.11991","date_published":"2022-05-24T00:00:00Z","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"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"}],"oa":1,"external_id":{"arxiv":["2205.11991"]},"citation":{"chicago":"Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.11991.","mla":"Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, doi:10.48550/arXiv.2205.11991.","short":"D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).","ista":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 10.48550/arXiv.2205.11991.","ieee":"D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .","apa":"Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991","ama":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv. doi:10.48550/arXiv.2205.11991"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2205.11991"}],"publication":"arXiv"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"submitted","title":"Learning control policies for stochastic systems with reach-avoid guarantees","status":"public","year":"2022","_id":"14600","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Preprint","date_created":"2023-11-24T13:10:09Z","date_updated":"2024-01-22T14:08:29Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"},{"id":"14830","relation":"later_version","status":"public"}]},"author":[{"last_name":"Zikelic","first_name":"Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"type":"preprint","license":"https://creativecommons.org/licenses/by-sa/4.0/","ec_funded":1,"abstract":[{"lang":"eng","text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold $p\\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on $3$ stochastic non-linear reinforcement learning tasks."}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"oa":1,"tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"external_id":{"arxiv":["2210.05308"]},"citation":{"short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, doi:10.48550/ARXIV.2210.05308.","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. doi:10.48550/ARXIV.2210.05308","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” arXiv. .","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. https://doi.org/10.48550/ARXIV.2210.05308","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 10.48550/ARXIV.2210.05308."},"main_file_link":[{"url":"https://arxiv.org/abs/2210.05308","open_access":"1"}],"publication":"arXiv","language":[{"iso":"eng"}],"doi":"10.48550/ARXIV.2210.05308","date_published":"2022-11-29T00:00:00Z","article_processing_charge":"No","day":"29","month":"11"},{"citation":{"short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.","chicago":"Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.” In 32nd International Conference on Concurrency Theory, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18.","ama":"Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18","apa":"Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18","ieee":"I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.","ista":"Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18."},"publication":"32nd International Conference on Concurrency Theory","date_published":"2021-08-13T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"13","intvolume":" 203","status":"public","ddc":["000"],"title":"Decomposing permutation automata","_id":"10052","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"10064","date_created":"2021-10-01T11:10:53Z","date_updated":"2021-10-01T11:10:53Z","checksum":"4722c81be82265cf45e78adf9db91250","success":1,"file_name":"2021_CONCUR_Jecker.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1003552,"creator":"cchlebak"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet."}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2107.04683"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2021.18","conference":{"start_date":"2021-08-23","location":"Paris, France","end_date":"2021-08-27","name":"CONCUR: Conference on Concurrency Theory"},"publication_identifier":{"isbn":["978-3-9597-7203-7"],"issn":["1868-8969"]},"month":"08","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","publication_status":"published","acknowledgement":"Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411. Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project FE 560/9-1.\r\n","year":"2021","volume":203,"date_created":"2021-09-27T14:33:14Z","date_updated":"2022-05-13T08:12:52Z","author":[{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker"},{"last_name":"Mazzocchi","first_name":"Nicolas","full_name":"Mazzocchi, Nicolas"},{"first_name":"Petra","last_name":"Wolf","full_name":"Wolf, Petra"}],"article_number":"18","ec_funded":1,"file_date_updated":"2021-10-01T11:10:53Z"},{"publication":"48th International Colloquium on Automata, Languages, and Programming","citation":{"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.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” 48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.","ama":"Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124","apa":"Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124","ieee":"K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.","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."},"date_published":"2021-07-02T00:00:00Z","scopus_import":"1","day":"02","article_processing_charge":"No","has_accepted_license":"1","status":"public","title":"Faster algorithms for bounded liveness in graphs and game graphs","ddc":["000"],"intvolume":" 198","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"10054","file":[{"file_id":"10062","relation":"main_file","success":1,"checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","date_created":"2021-10-01T08:49:26Z","date_updated":"2021-10-01T08:49:26Z","access_level":"open_access","file_name":"2021_LIPIcs_Chatterjee.pdf","creator":"cchlebak","content_type":"application/pdf","file_size":854576}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a \"good\" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives."}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Glasgow, Scotland","start_date":"2021-07-12","end_date":"2021-07-16"},"doi":"10.4230/LIPIcs.ICALP.2021.124","month":"07","publication_identifier":{"isbn":["978-3-95977-195-5"],"issn":["1868-8969"]},"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","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.","date_created":"2021-09-27T14:33:15Z","date_updated":"2022-08-12T10:55:02Z","volume":198,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Kale","first_name":"Sagar Sudhir","full_name":"Kale, Sagar Sudhir"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"article_number":"124","file_date_updated":"2021-10-01T08:49:26Z","ec_funded":1},{"intvolume":" 202","ddc":["000"],"title":"A bit of nondeterminism makes pushdown automata expressive and succinct","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10075","file":[{"creator":"cchlebak","content_type":"application/pdf","file_size":825567,"access_level":"open_access","file_name":"2021_LIPIcs_Guha.pdf","success":1,"checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","date_updated":"2021-10-06T12:44:05Z","date_created":"2021-10-06T12:44:05Z","file_id":"10097","relation":"main_file"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","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."}],"citation":{"chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In 46th International Symposium on Mathematical Foundations of Computer Science, Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.MFCS.2021.53.","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.","mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.","apa":"Guha, S., Jecker, I. R., Lehtinen, K., & Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.53","ieee":"S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.","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.","ama":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53"},"publication":"46th International Symposium on Mathematical Foundations of Computer Science","date_published":"2021-08-18T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"18","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","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.","year":"2021","volume":202,"date_created":"2021-10-03T22:01:23Z","date_updated":"2022-05-13T08:21:56Z","author":[{"last_name":"Guha","first_name":"Shibashis","full_name":"Guha, Shibashis"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R"},{"full_name":"Lehtinen, Karoliina","first_name":"Karoliina","last_name":"Lehtinen"},{"full_name":"Zimmermann, Martin","last_name":"Zimmermann","first_name":"Martin"}],"article_number":"53","ec_funded":1,"file_date_updated":"2021-10-06T12:44:05Z","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","external_id":{"arxiv":["2105.02611"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2021.53","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2021-08-27","location":"Tallinn, Estonia","start_date":"2021-08-23"},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7201-3"]},"month":"08"},{"author":[{"full_name":"Arrighi, Emmanuel","first_name":"Emmanuel","last_name":"Arrighi"},{"first_name":"Henning","last_name":"Fernau","full_name":"Fernau, Henning"},{"last_name":"Hoffmann","first_name":"Stefan","full_name":"Hoffmann, Stefan"},{"last_name":"Holzer","first_name":"Markus","full_name":"Holzer, Markus"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R","full_name":"Jecker, Ismael R"},{"full_name":"De Oliveira Oliveira, Mateus","last_name":"De Oliveira Oliveira","first_name":"Mateus"},{"last_name":"Wolf","first_name":"Petra","full_name":"Wolf, Petra"}],"date_updated":"2022-01-17T10:56:19Z","date_created":"2022-01-16T23:01:29Z","volume":213,"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","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","file_date_updated":"2022-01-17T10:49:03Z","ec_funded":1,"article_number":"34","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15","location":"Virtual","end_date":"2021-12-17"},"doi":"10.4230/LIPIcs.FSTTCS.2021.34","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2110.01279"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"month":"11","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"file":[{"relation":"main_file","file_id":"10634","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","success":1,"date_created":"2022-01-17T10:49:03Z","date_updated":"2022-01-17T10:49:03Z","access_level":"open_access","file_name":"2021_LIPIcs_Arrighi.pdf","file_size":844224,"content_type":"application/pdf","creator":"cchlebak"}],"oa_version":"Published Version","_id":"10630","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"On the complexity of intersection non-emptiness for star-free language classes","ddc":["000"],"status":"public","intvolume":" 213","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."}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2021-11-29T00:00:00Z","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","citation":{"chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34.","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.","apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., & Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34","ieee":"E. Arrighi et al., “On the complexity of intersection non-emptiness for star-free language classes,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.","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.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34"},"day":"29","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.FSTTCS.2021.42","conference":{"end_date":"2021-12-17","location":"Virtual","start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"month":"11","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2021","volume":213,"date_created":"2022-01-16T23:01:28Z","date_updated":"2022-01-17T10:39:40Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"}],"article_number":"42","file_date_updated":"2022-01-17T10:36:08Z","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.","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.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42","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.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42"},"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","date_published":"2021-11-29T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"29","intvolume":" 213","status":"public","ddc":["000"],"title":"Quantitative verification on product graphs of small treewidth","_id":"10629","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_created":"2022-01-17T10:36:08Z","date_updated":"2022-01-17T10:36:08Z","checksum":"71141acdeffa9056f24d6dbef952d254","success":1,"relation":"main_file","file_id":"10633","content_type":"application/pdf","file_size":891566,"creator":"cchlebak","file_name":"2021_LIPIcs_Chatterjee.pdf","access_level":"open_access"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"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^{-λ}).","lang":"eng"}]},{"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"external_id":{"arxiv":["2005.06636"]},"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611976465.38","conference":{"location":"Virtual","start_date":"2021-01-10","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms"},"publication_identifier":{"isbn":["978-1-61197-646-5"]},"month":"01","publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}],"publication_status":"published","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.","year":"2021","date_updated":"2022-01-27T12:58:43Z","date_created":"2022-01-27T12:11:23Z","author":[{"full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy"},{"first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"ec_funded":1,"page":"617-636","citation":{"mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.","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.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976465.38.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38","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.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38"},"publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","date_published":"2021-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","title":"Infinite-duration all-pay bidding games","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10694","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}]},{"ec_funded":1,"date_updated":"2022-08-05T09:05:06Z","date_created":"2022-03-13T23:01:47Z","author":[{"full_name":"Tomášek, Petr","last_name":"Tomášek","first_name":"Petr"},{"full_name":"Horák, Karel","first_name":"Karel","last_name":"Horák"},{"first_name":"Aditya","last_name":"Aradhye","full_name":"Aradhye, Aditya"},{"full_name":"Bošanský, Branislav","last_name":"Bošanský","first_name":"Branislav"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"}],"publisher":"International Joint Conferences on Artificial Intelligence","department":[{"_id":"KrCh"}],"publication_status":"published","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. ","publication_identifier":{"issn":["1045-0823"],"isbn":["9780999241196"]},"month":"09","language":[{"iso":"eng"}],"doi":"10.24963/ijcai.2021/575","conference":{"start_date":"2021-08-19","location":"Virtual, Online","end_date":"2021-08-27","name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization"},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"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"}],"type":"conference","oa_version":"Published Version","status":"public","title":"Solving partially observable stochastic shortest-path games","_id":"10847","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2021-09-01T00:00:00Z","page":"4182-4189","citation":{"chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/575.","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.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/575","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.","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.","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: 30th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:10.24963/ijcai.2021/575"},"publication":"30th International Joint Conference on Artificial Intelligence"},{"publication_identifier":{"eissn":["16113349"],"isbn":["9783030682101"],"issn":["03029743"]},"month":"02","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"quality_controlled":"1","external_id":{"arxiv":["2101.03928"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.03928"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-68211-8_18","conference":{"end_date":"2021-03-02","location":"Yangon, Myanmar","start_date":"2021-02-28","name":"WALCOM: Algorithms and Computation"},"ec_funded":1,"publisher":"Springer Nature","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","year":"2021","volume":12635,"date_created":"2021-03-28T22:01:41Z","date_updated":"2023-02-21T16:33:44Z","related_material":{"record":[{"id":"11938","status":"public","relation":"later_version"}]},"author":[{"first_name":"Oswin","last_name":"Aichholzer","full_name":"Aichholzer, Oswin"},{"full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara","first_name":"Alan M","orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Masárová, Zuzana","first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322"},{"last_name":"Parada","first_name":"Irene","full_name":"Parada, Irene"},{"last_name":"Perz","first_name":"Daniel","full_name":"Perz, Daniel"},{"first_name":"Alexander","last_name":"Pilz","full_name":"Pilz, Alexander"},{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"last_name":"Vogtenhuber","first_name":"Birgit","full_name":"Vogtenhuber, Birgit"}],"scopus_import":"1","article_processing_charge":"No","day":"16","page":"221-233","citation":{"ieee":"O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: 15th International Conference on Algorithms and Computation. Vol 12635. Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” In 15th International Conference on Algorithms and Computation, 12635:221–33. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-68211-8_18.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18."},"publication":"15th International Conference on Algorithms and Computation","date_published":"2021-02-16T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":" matching is compatible to two or more labeled point sets of size n with labels {1,…,n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled convex sets of n points there exists a compatible matching with ⌊2n−−√⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ) . As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(logn) copies of any set of n points are necessary and sufficient for the existence of a labeling such that any compatible matching consists only of a single edge."}],"intvolume":" 12635","title":"On compatible matchings","status":"public","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9296","oa_version":"Preprint"},{"abstract":[{"lang":"eng","text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore."}],"type":"book_chapter","author":[{"full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","first_name":"Laura"},{"full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian"}],"date_created":"2021-05-19T12:25:42Z","date_updated":"2023-02-23T13:57:04Z","volume":29,"oa_version":"Published Version","_id":"9403","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2021","status":"public","title":"The evolution of strategic ignorance in strategic interaction","intvolume":" 29","publisher":"MIT Press","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"editor":[{"full_name":"Hertwig, Ralph","last_name":"Hertwig","first_name":"Ralph"},{"full_name":"Engel, Christoph","last_name":"Engel","first_name":"Christoph"}],"day":"01","month":"03","article_processing_charge":"No","publication_identifier":{"isbn":["978-0-262-04559-9"]},"series_title":"Strüngmann Forum Reports","date_published":"2021-03-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Deliberate Ignorance: Choosing Not To Know","main_file_link":[{"open_access":"1","url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf"}],"citation":{"ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. Deliberate Ignorance: Choosing Not To Know. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.","apa":"Schmid, L., & Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig & C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.","short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021."},"oa":1,"quality_controlled":"1","page":"139-152"},{"citation":{"ama":"Bansal S, Chatterjee K, Vardi MY. On satisficing in quantitative games. In: 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12651. Springer Nature; 2021:20-37. doi:10.1007/978-3-030-72016-2","apa":"Bansal, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. https://doi.org/10.1007/978-3-030-72016-2","ieee":"S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.","ista":"Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.","short":"S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.","mla":"Bansal, Suguman, et al. “On Satisficing in Quantitative Games.” 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2.","chicago":"Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.” In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-72016-2."},"publication":"27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","page":"20-37","date_published":"2021-03-21T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"21","_id":"12767","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12651","status":"public","ddc":["000"],"title":"On satisficing in quantitative games","oa_version":"Published Version","file":[{"date_updated":"2023-03-28T11:00:33Z","date_created":"2023-03-28T11:00:33Z","success":1,"checksum":"b020b78b23587ce7610b1aafb4e63438","file_id":"12777","relation":"main_file","creator":"dernst","file_size":747418,"content_type":"application/pdf","file_name":"2021_LNCS_Bansal.pdf","access_level":"open_access"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound.\r\nThis work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2101.02594"]},"oa":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"quality_controlled":"1","doi":"10.1007/978-3-030-72016-2","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2021-03-27","location":"Luxembourg City, Luxembourg","end_date":"2021-04-01"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030720155"]},"month":"03","acknowledgement":"We thank anonymous reviewers for valuable inputs. This work is supported in part by NSF grant 2030859 to the CRA for the CIFellows Project, NSF grants IIS-1527668, CCF-1704883, IIS-1830549, the ERC CoG 863818 (ForM-SMArt), and an award from the Maryland Procurement Office.","year":"2021","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"first_name":"Suguman","last_name":"Bansal","full_name":"Bansal, Suguman"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vardi, Moshe Y.","first_name":"Moshe Y.","last_name":"Vardi"}],"volume":12651,"date_created":"2023-03-26T22:01:09Z","date_updated":"2023-03-28T11:03:11Z","ec_funded":1,"file_date_updated":"2023-03-28T11:00:33Z"},{"day":"01","article_processing_charge":"No","has_accepted_license":"1","date_published":"2021-12-01T00:00:00Z","publication":"35th Conference on Neural Information Processing Systems","citation":{"short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: 35th Conference on Neural Information Processing Systems. ; 2021. doi:10.48550/arXiv.2111.03165","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual. https://doi.org/10.48550/arXiv.2111.03165","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.","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, ."},"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."}],"type":"conference","alternative_title":[" Advances in Neural Information Processing Systems"],"oa_version":"Published Version","file":[{"file_name":"infinite_time_horizon_safety_o.pdf","access_level":"open_access","content_type":"application/pdf","file_size":452492,"creator":"mlechner","relation":"main_file","file_id":"10682","date_created":"2022-01-26T07:39:59Z","date_updated":"2022-01-26T07:39:59Z","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","success":1}],"_id":"10667","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"Infinite time horizon safety of Bayesian neural networks","status":"public","month":"12","conference":{"end_date":"2021-12-10","start_date":"2021-12-06","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems"},"doi":"10.48550/arXiv.2111.03165","language":[{"iso":"eng"}],"external_id":{"arxiv":["2111.03165"]},"tmp":{"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","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"quality_controlled":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"file_date_updated":"2022-01-26T07:39:59Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias"},{"full_name":"Žikelić, Ðorđe","first_name":"Ðorđe","last_name":"Žikelić"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"date_created":"2022-01-25T15:45:58Z","date_updated":"2023-06-23T07:01:11Z","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 the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}]},{"month":"01","publication_identifier":{"issn":["0166218X"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000596823800035"]},"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"doi":"10.1016/j.dam.2020.10.022","language":[{"iso":"eng"}],"file_date_updated":"2021-02-04T11:28:42Z","acknowledgement":"We are grateful to Matthias Függer and Thomas Nowak for having raised our interest in the problem studied in this paper.\r\nThis work has been supported the Austrian Science Fund (FWF) projects S11405, S11407 (RiSE), and P28182 (ADynNet).","year":"2021","publication_status":"published","publisher":"Elsevier","department":[{"_id":"KrCh"}],"author":[{"first_name":"Martin","last_name":"Zeiner","full_name":"Zeiner, Martin"},{"full_name":"Schmid, Ulrich","last_name":"Schmid","first_name":"Ulrich"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"date_updated":"2023-08-04T11:12:41Z","date_created":"2020-11-22T23:01:26Z","volume":289,"scopus_import":"1","day":"31","article_processing_charge":"No","has_accepted_license":"1","publication":"Discrete Applied Mathematics","citation":{"ama":"Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 2021;289(1):392-415. doi:10.1016/j.dam.2020.10.022","ista":"Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 289(1), 392–415.","apa":"Zeiner, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2020.10.022","ieee":"M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.","mla":"Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.","short":"M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.","chicago":"Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.dam.2020.10.022."},"article_type":"original","page":"392-415","date_published":"2021-01-31T00:00:00Z","type":"journal_article","abstract":[{"text":"We study optimal election sequences for repeatedly selecting a (very) small group of leaders among a set of participants (players) with publicly known unique ids. In every time slot, every player has to select exactly one player that it considers to be the current leader, oblivious to the selection of the other players, but with the overarching goal of maximizing a given parameterized global (“social”) payoff function in the limit. We consider a quite generic model, where the local payoff achieved by a given player depends, weighted by some arbitrary but fixed real parameter, on the number of different leaders chosen in a round, the number of players that choose the given player as the leader, and whether the chosen leader has changed w.r.t. the previous round or not. The social payoff can be the maximum, average or minimum local payoff of the players. Possible applications include quite diverse examples such as rotating coordinator-based distributed algorithms and long-haul formation flying of social birds. Depending on the weights and the particular social payoff, optimal sequences can be very different, from simple round-robin where all players chose the same leader alternatingly every time slot to very exotic patterns, where a small group of leaders (at most 2) is elected in every time slot. Moreover, we study the question if and when a single player would not benefit w.r.t. its local payoff when deviating from the given optimal sequence, i.e., when our optimal sequences are Nash equilibria in the restricted strategy space of oblivious strategies. As this is the case for many parameterizations of our model, our results reveal that no punishment is needed to make it rational for the players to optimize the social payoff.","lang":"eng"}],"issue":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8793","status":"public","ddc":["510"],"title":"Optimal strategies for selecting coordinators","intvolume":" 289","file":[{"success":1,"checksum":"f1039ff5a2d6ca116720efdb84ee9d5e","date_created":"2021-02-04T11:28:42Z","date_updated":"2021-02-04T11:28:42Z","file_id":"9089","relation":"main_file","creator":"dernst","file_size":652739,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_DiscreteApplMath_Zeiner.pdf"}],"oa_version":"Published Version"},{"type":"journal_article","abstract":[{"text":"A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium.","lang":"eng"}],"issue":"4","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9381","ddc":["000"],"title":"Mistakes can stabilise the dynamics of rock-paper-scissors games","status":"public","intvolume":" 17","file":[{"date_created":"2021-05-11T13:50:06Z","date_updated":"2021-05-11T13:50:06Z","success":1,"checksum":"a94ebe0c4116f5047eaa6029e54d2dac","file_id":"9385","relation":"main_file","creator":"kschuh","file_size":1323820,"content_type":"application/pdf","file_name":"2021_pcbi_Kleshnina.pdf","access_level":"open_access"}],"oa_version":"Published Version","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"PLoS Computational Biology","citation":{"ista":"Kleshnina M, Streipert SS, Filar JA, Chatterjee K. 2021. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 17(4), e1008523.","apa":"Kleshnina, M., Streipert, S. S., Filar, J. A., & Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008523","ieee":"M. Kleshnina, S. S. Streipert, J. A. Filar, and K. Chatterjee, “Mistakes can stabilise the dynamics of rock-paper-scissors games,” PLoS Computational Biology, vol. 17, no. 4. Public Library of Science, 2021.","ama":"Kleshnina M, Streipert SS, Filar JA, Chatterjee K. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 2021;17(4). doi:10.1371/journal.pcbi.1008523","chicago":"Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology. Public Library of Science, 2021. https://doi.org/10.1371/journal.pcbi.1008523.","mla":"Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008523.","short":"M. Kleshnina, S.S. Streipert, J.A. Filar, K. Chatterjee, PLoS Computational Biology 17 (2021)."},"article_type":"original","date_published":"2021-04-01T00:00:00Z","article_number":"e1008523","file_date_updated":"2021-05-11T13:50:06Z","ec_funded":1,"acknowledgement":"Authors would like to thank Christian Hilbe and Martin Nowak for their inspiring and very helpful feedback on the manuscript.","year":"2021","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","author":[{"full_name":"Kleshnina, Maria","first_name":"Maria","last_name":"Kleshnina","id":"4E21749C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sabrina S.","last_name":"Streipert","full_name":"Streipert, Sabrina S."},{"first_name":"Jerzy A.","last_name":"Filar","full_name":"Filar, Jerzy A."},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"}],"date_updated":"2023-08-08T13:31:08Z","date_created":"2021-05-09T22:01:38Z","volume":17,"month":"04","publication_identifier":{"eissn":["15537358"],"issn":["1553734X"]},"external_id":{"isi":["000639711200001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"doi":"10.1371/journal.pcbi.1008523","language":[{"iso":"eng"}]},{"type":"journal_article","abstract":[{"text":"Selection and random drift determine the probability that novel mutations fixate in a population. Population structure is known to affect the dynamics of the evolutionary process. Amplifiers of selection are population structures that increase the fixation probability of beneficial mutants compared to well-mixed populations. Over the past 15 years, extensive research has produced remarkable structures called strong amplifiers which guarantee that every beneficial mutation fixates with high probability. But strong amplification has come at the cost of considerably delaying the fixation event, which can slow down the overall rate of evolution. However, the precise relationship between fixation probability and time has remained elusive. Here we characterize the slowdown effect of strong amplification. First, we prove that all strong amplifiers must delay the fixation event at least to some extent. Second, we construct strong amplifiers that delay the fixation event only marginally as compared to the well-mixed populations. Our results thus establish a tight relationship between fixation probability and time: Strong amplification always comes at a cost of a slowdown, but more than a marginal slowdown is not needed.","lang":"eng"}],"issue":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9640","status":"public","ddc":["510"],"title":"Fast and strong amplifiers of natural selection","intvolume":" 12","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2021_NatCoom_Tkadlec.pdf","creator":"cziletti","content_type":"application/pdf","file_size":628992,"file_id":"9692","relation":"main_file","success":1,"checksum":"5767418926a7f7fb76151de29473dae0","date_created":"2021-07-19T13:02:20Z","date_updated":"2021-07-19T13:02:20Z"}],"scopus_import":"1","day":"29","has_accepted_license":"1","article_processing_charge":"No","publication":"Nature Communications","citation":{"ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers of natural selection. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-24271-w","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009.","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-24271-w","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.","mla":"Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-24271-w."},"article_type":"original","date_published":"2021-06-29T00:00:00Z","article_number":"4009","file_date_updated":"2021-07-19T13:02:20Z","ec_funded":1,"acknowledgement":"K.C. acknowledges support from ERC Start grant no. (279307: Graph Games), ERC Consolidator grant no. (863818: ForM-SMart), Austrian Science Fund (FWF) grant no. P23499-N23 and S11407-N23 (RiSE). M.A.N. acknowledges support from Office of Naval Research grant N00014-16-1-2914 and from the John Templeton Foundation.","year":"2021","pmid":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"author":[{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Nowak, Martin A.","last_name":"Nowak","first_name":"Martin A."}],"date_created":"2021-07-11T22:01:15Z","date_updated":"2023-08-10T14:05:09Z","volume":12,"month":"06","publication_identifier":{"eissn":["20411723"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["34188036"],"isi":["000671752100003"]},"isi":1,"quality_controlled":"1","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"doi":"10.1038/s41467-021-24271-w","language":[{"iso":"eng"}]},{"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2011.14617","open_access":"1"}],"external_id":{"arxiv":["2011.14617"],"isi":["000723661700076"]},"quality_controlled":"1","isi":1,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"PLDI: Programming Language Design and Implementation","end_date":"2021-06-26","start_date":"2021-06-20","location":"Online"},"doi":"10.1145/3453483.3454102","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"isbn":["9781450383912"]},"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).","year":"2021","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","author":[{"last_name":"Wang","first_name":"Jinyi","full_name":"Wang, Jinyi"},{"last_name":"Sun","first_name":"Yican","full_name":"Sun, Yican"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"}],"date_updated":"2023-08-10T14:14:08Z","date_created":"2021-07-11T22:01:18Z","ec_funded":1,"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","citation":{"ama":"Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. Quantitative analysis of assertion violations in probabilistic programs. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1171-1186. doi:10.1145/3453483.3454102","ieee":"J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.","apa":"Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454102","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.","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.","mla":"Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.","chicago":"Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454102."},"page":"1171-1186","date_published":"2021-06-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","_id":"9646","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"Quantitative analysis of assertion violations in probabilistic programs","oa_version":"Preprint","type":"conference","abstract":[{"text":"We consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on the assertion violation probability. The main novelty of our approach is that we prove new and dedicated fixed-point theorems which serve as the theoretical basis of our algorithms and enable us to reason about assertion violation bounds in terms of pre and post fixed-point functions. To synthesize such fixed-points, we devise algorithms that utilize a wide range of mathematical tools, including repulsing ranking supermartingales, Hoeffding's lemma, Minkowski decompositions, Jensen's inequality, and convex optimization. On the theoretical side, we provide (i) the first automated algorithm for lower-bounds on assertion violation probabilities, (ii) the first complete algorithm for upper-bounds of exponential form in affine programs, and (iii) provably and significantly tighter upper-bounds than the previous approaches. On the practical side, we show our algorithms can handle a wide variety of programs from the literature and synthesize bounds that are remarkably tighter than previous results, in some cases by thousands of orders of magnitude.","lang":"eng"}]},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9645","title":"Polynomial reachability witnesses via Stellensätze","status":"public","oa_version":"Submitted Version","type":"conference","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."}],"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","citation":{"ama":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. Polynomial reachability witnesses via Stellensätze. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:772-787. doi:10.1145/3453483.3454076","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.","apa":"Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076","ieee":"A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.","mla":"Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–87, doi:10.1145/3453483.3454076.","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.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454076."},"page":"772-787","date_published":"2021-06-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","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","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"author":[{"full_name":"Asadi, Ali","first_name":"Ali","last_name":"Asadi"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","first_name":"Hongfei"},{"full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"last_name":"Mahdavi","first_name":"Mohammad","full_name":"Mahdavi, Mohammad"}],"date_updated":"2023-08-10T14:13:39Z","date_created":"2021-07-11T22:01:17Z","ec_funded":1,"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-03183862/","open_access":"1"}],"oa":1,"external_id":{"isi":["000723661700050"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2021-06-20","location":"Online","end_date":"2021-06-26","name":" PLDI: Programming Language Design and Implementation"},"doi":"10.1145/3453483.3454076","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"isbn":["9781450383912"]}},{"language":[{"iso":"eng"}],"conference":{"start_date":"2021-06-29","location":"Rome, Italy","end_date":"2021-07-02","name":"LICS: Symposium on Logic in Computer Science"},"doi":"10.1109/LICS52264.2021.9470739","quality_controlled":"1","isi":1,"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"external_id":{"isi":["000947350400089"],"arxiv":["2104.07466"]},"main_file_link":[{"url":"https://arxiv.org/abs/2104.07466","open_access":"1"}],"oa":1,"month":"07","publication_identifier":{"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"]},"date_updated":"2023-08-14T06:51:33Z","date_created":"2021-09-12T22:01:24Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Dvorak, Wolfgang","last_name":"Dvorak","first_name":"Wolfgang"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"KrCh"}],"year":"2021","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","ec_funded":1,"date_published":"2021-07-07T00:00:00Z","page":"1-13","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.","short":"K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ista":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","ieee":"K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","apa":"Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739","ama":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739"},"day":"07","article_processing_charge":"No","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"scopus_import":"1","oa_version":"Preprint","status":"public","title":"Symbolic time and space tradeoffs for probabilistic verification","_id":"10002","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .","lang":"eng"}],"type":"conference"},{"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Institute of Electrical and Electronics Engineers","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","year":"2021","date_updated":"2023-08-14T06:52:07Z","date_created":"2021-09-12T22:01:25Z","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"main_file_link":[{"url":"https://arxiv.org/abs/2104.07278","open_access":"1"}],"oa":1,"external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"language":[{"iso":"eng"}],"conference":{"name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","location":"Rome, Italy","end_date":"2021-07-02"},"doi":"10.1109/LICS52264.2021.9470595","month":"07","publication_identifier":{"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"]},"status":"public","title":"Stochastic processes with expected stopping time","_id":"10004","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"conference","abstract":[{"text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.","lang":"eng"}],"page":"1-13","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","citation":{"ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595","apa":"Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595."},"date_published":"2021-07-07T00:00:00Z","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"scopus_import":"1","day":"07","article_processing_charge":"No"},{"doi":"10.4230/LIPIcs.STACS.2021.44","conference":{"start_date":"2021-03-16","location":"Saarbrücken, Germany","end_date":"2021-03-19","name":"STACS: Symposium on Theoretical Aspects of Computer Science"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000635691700044"]},"oa":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"publication_identifier":{"isbn":["978-3-9597-7180-1"],"issn":["1868-8969"]},"month":"03","author":[{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker","full_name":"Jecker, Ismael R"}],"volume":187,"date_updated":"2023-08-14T07:03:23Z","date_created":"2021-09-27T14:33:15Z","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.","year":"2021","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","publication_status":"published","ec_funded":1,"file_date_updated":"2021-10-01T09:55:00Z","article_number":"44","date_published":"2021-03-10T00:00:00Z","citation":{"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.","ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44","ama":"Jecker IR. A Ramsey theorem for finite monoids. In: 38th International Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44","chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In 38th International Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.44.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021."},"publication":"38th International Symposium on Theoretical Aspects of Computer Science","has_accepted_license":"1","article_processing_charge":"No","day":"10","scopus_import":"1","file":[{"file_id":"10063","relation":"main_file","success":1,"checksum":"17432a05733f408de300e17e390a90e4","date_created":"2021-10-01T09:55:00Z","date_updated":"2021-10-01T09:55:00Z","access_level":"open_access","file_name":"2021_LIPIcs_Jecker.pdf","creator":"cchlebak","content_type":"application/pdf","file_size":720250}],"oa_version":"Published Version","_id":"10055","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 187","status":"public","ddc":["000"],"title":"A Ramsey theorem for finite monoids","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"}],"type":"conference","alternative_title":["LIPIcs"]},{"type":"conference","alternative_title":["LNCS"],"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."}],"_id":"9987","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["000"],"title":"Stateless model checking under a reads-value-from equivalence","status":"public","file":[{"access_level":"open_access","file_name":"2021_LNCS_Agarwal.pdf","creator":"dernst","file_size":1516756,"content_type":"application/pdf","file_id":"11368","relation":"main_file","success":1,"checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","date_created":"2022-05-13T07:00:20Z","date_updated":"2022-05-13T07:00:20Z"}],"oa_version":"Published Version","scopus_import":"1","day":"15","article_processing_charge":"Yes","has_accepted_license":"1","publication":"33rd International Conference on Computer-Aided Verification ","citation":{"chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.","mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.","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.","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.","ieee":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.","apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16","ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16"},"page":"341-366","date_published":"2021-07-15T00:00:00Z","file_date_updated":"2022-05-13T07:00:20Z","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.","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","author":[{"last_name":"Agarwal","first_name":"Pratyush","full_name":"Agarwal, Pratyush"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Pathak, Shreya","first_name":"Shreya","last_name":"Pathak"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"},{"full_name":"Toman, Viktor","first_name":"Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"date_updated":"2023-09-07T13:30:27Z","date_created":"2021-09-05T22:01:24Z","volume":"12759 ","month":"07","publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-030-81684-1"],"issn":["0302-9743"],"eisbn":["978-3-030-81685-8"]},"external_id":{"arxiv":["2105.06424"],"isi":["000698732400016"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"conference":{"end_date":"2021-07-23","start_date":"2021-07-20","location":"Virtual","name":"CAV: Computer Aided Verification "},"doi":"10.1007/978-3-030-81685-8_16","language":[{"iso":"eng"}]},{"date_published":"2021-10-15T00:00:00Z","publication":"Proceedings of the ACM on Programming Languages","citation":{"apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","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.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541."},"article_type":"original","day":"15","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","keyword":["safety","risk","reliability and quality","software"],"file":[{"relation":"main_file","file_id":"10215","checksum":"9d6dce7b611853c529bb7b1915ac579e","success":1,"date_updated":"2021-11-04T07:24:48Z","date_created":"2021-11-04T07:24:48Z","access_level":"open_access","file_name":"2021_ProcACMPL_Bui.pdf","file_size":2903485,"content_type":"application/pdf","creator":"cchlebak"}],"oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10191","title":"The reads-from equivalence for the TSO and PSO memory models","status":"public","ddc":["000"],"intvolume":" 5","abstract":[{"lang":"eng","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"}],"issue":"OOPSLA","type":"journal_article","doi":"10.1145/3485541","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2011.11763"]},"quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"month":"10","publication_identifier":{"eissn":["2475-1421"]},"author":[{"first_name":"Truc Lam","last_name":"Bui","full_name":"Bui, Truc Lam"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Gautam, Tushar","first_name":"Tushar","last_name":"Gautam"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"},{"full_name":"Toman, Viktor","first_name":"Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X"}],"related_material":{"record":[{"id":"10199","relation":"dissertation_contains","status":"public"}]},"date_created":"2021-10-27T15:05:34Z","date_updated":"2023-09-07T13:30:27Z","volume":5,"year":"2021","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.","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"file_date_updated":"2021-11-04T07:24:48Z","ec_funded":1,"article_number":"164"},{"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."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","file":[{"access_level":"open_access","file_name":"toman_th_final.pdf","creator":"vtoman","file_size":2915234,"content_type":"application/pdf","file_id":"10225","relation":"main_file","checksum":"4f412a1ee60952221b499a4b1268df35","date_created":"2021-11-08T14:12:22Z","date_updated":"2021-11-08T14:12:22Z"},{"creator":"vtoman","content_type":"application/zip","file_size":8616056,"access_level":"closed","file_name":"toman_thesis.zip","checksum":"9584943f99127be2dd2963f6784c37d4","date_updated":"2021-11-09T09:00:50Z","date_created":"2021-11-08T14:12:46Z","file_id":"10226","relation":"source_file"}],"oa_version":"Published Version","ddc":["000"],"status":"public","title":"Improved verification techniques for concurrent systems","_id":"10199","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"31","has_accepted_license":"1","article_processing_charge":"No","keyword":["concurrency","verification","model checking"],"date_published":"2021-10-31T00:00:00Z","page":"166","citation":{"short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","mla":"Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","apa":"Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria."},"file_date_updated":"2021-11-09T09:00:50Z","ec_funded":1,"date_updated":"2023-09-19T09:59:54Z","date_created":"2021-10-29T20:09:01Z","author":[{"full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","first_name":"Viktor"}],"related_material":{"record":[{"id":"10190","status":"public","relation":"part_of_dissertation"},{"id":"10191","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9987"},{"status":"public","relation":"part_of_dissertation","id":"141"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"year":"2021","month":"10","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"acknowledged_ssus":[{"_id":"SSU"}],"language":[{"iso":"eng"}],"doi":"10.15479/at:ista:10199","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"oa":1},{"abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"issue":"8","type":"journal_article","oa_version":"Preprint","title":"Algorithms and conditional lower bounds for planning problems","status":"public","intvolume":" 297","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9293","day":"16","article_processing_charge":"No","scopus_import":"1","date_published":"2021-03-16T00:00:00Z","article_type":"original","publication":"Artificial Intelligence","citation":{"apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2021.103499","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 2021;297(8). doi:10.1016/j.artint.2021.103499","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499."},"article_number":"103499","date_created":"2021-03-28T22:01:40Z","date_updated":"2023-09-26T10:41:42Z","volume":297,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"related_material":{"record":[{"id":"35","status":"public","relation":"earlier_version"}]},"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Elsevier","year":"2021","month":"03","publication_identifier":{"issn":["0004-3702"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.artint.2021.103499","quality_controlled":"1","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.07031","open_access":"1"}],"oa":1,"external_id":{"isi":["000657537500003"],"arxiv":["1804.07031"]}},{"doi":"10.1007/s10703-021-00373-5","language":[{"iso":"eng"}],"external_id":{"isi":["000645490300001"],"arxiv":["1504.07384"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.07384","open_access":"1"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["0925-9856"],"eissn":["1572-8102"]},"month":"09","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"volume":57,"date_created":"2021-05-16T22:01:47Z","date_updated":"2023-10-10T11:13:20Z","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.","year":"2021","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","ec_funded":1,"date_published":"2021-09-01T00:00:00Z","citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5."},"publication":"Formal Methods in System Design","page":"401-428","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","_id":"9393","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 57","title":"Faster algorithms for quantitative verification in bounded treewidth graphs","status":"public","abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.","lang":"eng"}],"type":"journal_article"},{"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"},"doi":"10.1145/3453483.3454093","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2104.01189","open_access":"1"}],"external_id":{"arxiv":["2104.01189"],"isi":["000723661700067"]},"oa":1,"isi":1,"quality_controlled":"1","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,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Ehsan Kafshdar","last_name":"Goharshady","first_name":"Ehsan Kafshdar"},{"first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"}]},"date_created":"2021-07-11T22:01:17Z","date_updated":"2023-11-30T10:55:37Z","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.","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2021-06-01T00:00:00Z","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","citation":{"ama":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1033-1048. doi:10.1145/3453483.3454093","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454093","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.","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.","mla":"Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093."},"page":"1033-1048","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."}],"type":"conference","oa_version":"Preprint","_id":"9644","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Proving non-termination by program reversal","status":"public"},{"article_processing_charge":"No","day":"10","scopus_import":"1","date_published":"2021-11-10T00:00:00Z","page":"619-639","citation":{"ama":"Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33","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.","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” 24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.","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.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33."},"publication":"24th International Symposium on Formal Methods","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"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","intvolume":" 13047","status":"public","title":"On lexicographic proof rules for probabilistic termination","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10414","publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-0309-0869-0"],"eisbn":["978-3-030-90870-6"],"issn":["0302-9743"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-90870-6_33","conference":{"name":"FM: Formal Methods","end_date":"2021-11-26","start_date":"2021-11-20","location":"Virtual"},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.02188"}],"oa":1,"external_id":{"isi":["000758218600033"],"arxiv":["2108.02188"]},"ec_funded":1,"volume":13047,"date_created":"2021-12-05T23:01:45Z","date_updated":"2024-01-17T08:19:41Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"},{"id":"14778","relation":"later_version","status":"public"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","first_name":"Ehsan Kafshdar","full_name":"Goharshady, Ehsan Kafshdar"},{"full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zárevúcky","first_name":"Jiří","full_name":"Zárevúcky, Jiří"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","last_name":"Zikelic"}],"department":[{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","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."},{"file_date_updated":"2021-12-23T23:30:04Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","related_material":{"record":[{"id":"1386","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1437"},{"status":"public","relation":"part_of_dissertation","id":"311"},{"status":"public","relation":"part_of_dissertation","id":"6056"},{"status":"public","relation":"part_of_dissertation","id":"6380"},{"id":"639","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"66"},{"id":"6780","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"6918"},{"id":"7810","status":"public","relation":"part_of_dissertation"},{"id":"6175","relation":"part_of_dissertation","status":"public"},{"id":"6378","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"6490"},{"id":"7014","status":"public","relation":"part_of_dissertation"},{"id":"8089","relation":"part_of_dissertation","status":"public"},{"id":"8728","relation":"part_of_dissertation","status":"public"},{"id":"7158","relation":"part_of_dissertation","status":"public"},{"id":"5977","status":"public","relation":"part_of_dissertation"},{"id":"6009","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"6340"},{"id":"949","relation":"part_of_dissertation","status":"public"}]},"author":[{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"}],"date_updated":"2023-09-22T10:03:21Z","date_created":"2020-12-10T12:17:07Z","year":"2021","acknowledgement":"The research was partially supported by an IBM PhD fellowship, a Facebook PhD fellowship, and DOC fellowship #24956 of the Austrian Academy of Sciences (OeAW).","publisher":"Institute of Science and Technology Austria","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"month":"01","doi":"10.15479/AT:ISTA:8934","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"degree_awarded":"PhD","oa":1,"tmp":{"short":"CC0 (1.0)","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)"},"project":[{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.\r\nWe use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","file":[{"file_size":5251507,"content_type":"application/pdf","creator":"akafshda","access_level":"open_access","file_name":"Thesis-pdfa.pdf","checksum":"d1b9db3725aed34dadd81274aeb9426c","date_created":"2020-12-22T20:08:44Z","date_updated":"2021-12-23T23:30:04Z","relation":"main_file","embargo":"2021-12-22","file_id":"8969"},{"checksum":"1661df7b393e6866d2460eba3c905130","date_created":"2020-12-22T20:08:50Z","date_updated":"2021-03-04T23:30:04Z","file_id":"8970","relation":"source_file","creator":"akafshda","file_size":10636756,"content_type":"application/zip","access_level":"closed","file_name":"source.zip","embargo_to":"open_access"}],"_id":"8934","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["005"],"status":"public","title":"Parameterized and algebro-geometric advances in static program analysis","has_accepted_license":"1","article_processing_charge":"No","day":"01","date_published":"2021-01-01T00:00:00Z","citation":{"ista":"Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria.","apa":"Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934","ieee":"A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.","ama":"Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:10.15479/AT:ISTA:8934","chicago":"Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:8934.","mla":"Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934.","short":"A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021."},"page":"278"},{"date_updated":"2023-11-07T08:28:29Z","date_created":"2021-11-15T17:12:57Z","related_material":{"record":[{"id":"9997","relation":"part_of_dissertation","status":"public"},{"id":"2","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9402"}]},"author":[{"orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","first_name":"Laura","full_name":"Schmid, Laura"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","year":"2021","ec_funded":1,"file_date_updated":"2022-12-20T23:30:08Z","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","doi":"10.15479/at:ista:10293","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"oa":1,"publication_identifier":{"issn":["2663-337X"]},"month":"11","file":[{"file_id":"10305","relation":"source_file","checksum":"86a05b430756ca12ae8107b6e6f3c1e5","date_created":"2021-11-18T12:41:46Z","date_updated":"2022-12-20T23:30:08Z","access_level":"closed","file_name":"submission_new.zip","embargo_to":"open_access","creator":"lschmid","content_type":"application/zip","file_size":29703124},{"access_level":"open_access","file_name":"thesis_new_upload.pdf","creator":"lschmid","content_type":"application/pdf","file_size":8320985,"file_id":"10306","embargo":"2022-10-18","relation":"main_file","checksum":"d940af042e94660c6b6a7b4f0b184d47","date_created":"2021-11-18T12:59:15Z","date_updated":"2022-12-20T23:30:08Z"}],"oa_version":"Published Version","title":"Evolution of cooperation via (in)direct reciprocity under imperfect information","status":"public","ddc":["519","576"],"_id":"10293","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more\r\nthan their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations\r\nare more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2021-11-17T00:00:00Z","page":"171","citation":{"ama":"Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:10.15479/at:ista:10293","ista":"Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.","ieee":"L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021.","apa":"Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293","mla":"Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293.","short":"L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021.","chicago":"Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10293."},"has_accepted_license":"1","article_processing_charge":"No","day":"17"},{"type":"journal_article","issue":"1","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."}],"intvolume":" 11","status":"public","title":"The evolution of indirect reciprocity under action and assessment generosity","ddc":["003"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9997","oa_version":"Published Version","file":[{"file_id":"10006","relation":"main_file","success":1,"checksum":"19df8816cf958b272b85841565c73182","date_created":"2021-09-13T10:31:21Z","date_updated":"2021-09-13T10:31:21Z","access_level":"open_access","file_name":"2021_ScientificReports_Schmid.pdf","creator":"cchlebak","file_size":2424943,"content_type":"application/pdf"}],"keyword":["Multidisciplinary"],"has_accepted_license":"1","article_processing_charge":"Yes","day":"31","article_type":"original","citation":{"ama":"Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 2021;11(1). doi:10.1038/s41598-021-96932-1","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.","apa":"Schmid, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-96932-1","ieee":"L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021.","mla":"Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.","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.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-96932-1."},"publication":"Scientific Reports","date_published":"2021-08-31T00:00:00Z","article_number":"17443","ec_funded":1,"file_date_updated":"2021-09-13T10:31:21Z","publisher":"Springer Nature","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","pmid":1,"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).","volume":11,"date_created":"2021-09-11T16:22:02Z","date_updated":"2024-03-28T23:30:45Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10293"}]},"author":[{"full_name":"Schmid, Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","first_name":"Laura","last_name":"Schmid"},{"last_name":"Shati","first_name":"Pouya","full_name":"Shati, Pouya"},{"last_name":"Hilbe","first_name":"Christian","full_name":"Hilbe, Christian"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"publication_identifier":{"eissn":["2045-2322"]},"month":"08","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["34465830"],"isi":["000692406400018"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41598-021-96932-1"},{"date_published":"2021-05-13T00:00:00Z","citation":{"apa":"Schmid, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature. https://doi.org/10.1038/s41562-021-01114-8","ieee":"L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021.","ista":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.","ama":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 2021;5(10):1292–1302. doi:10.1038/s41562-021-01114-8","chicago":"Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour. Springer Nature, 2021. https://doi.org/10.1038/s41562-021-01114-8.","short":"L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302.","mla":"Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:10.1038/s41562-021-01114-8."},"publication":"Nature Human Behaviour","page":"1292–1302","article_type":"original","article_processing_charge":"No","has_accepted_license":"1","day":"13","scopus_import":"1","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"2021_NatureHumanBehaviour_Schmid_accepted.pdf","creator":"dernst","content_type":"application/pdf","file_size":5232761,"file_id":"14496","relation":"main_file","success":1,"checksum":"34f55e173f90dc1dab731063458ac780","date_created":"2023-11-07T08:27:23Z","date_updated":"2023-11-07T08:27:23Z"}],"_id":"9402","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 5","ddc":["000"],"title":"A unified framework of direct and indirect reciprocity","status":"public","issue":"10","abstract":[{"lang":"eng","text":"Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability."}],"type":"journal_article","doi":"10.1038/s41562-021-01114-8","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["33986519"],"isi":["000650304000002"]},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","publication_identifier":{"eissn":["2397-3374"]},"month":"05","related_material":{"record":[{"id":"10293","relation":"dissertation_contains","status":"public"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/the-emergence-of-cooperation/"}]},"author":[{"orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","first_name":"Laura","full_name":"Schmid, Laura"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X"},{"first_name":"Martin A.","last_name":"Nowak","full_name":"Nowak, Martin A."}],"volume":5,"date_updated":"2024-03-28T23:30:45Z","date_created":"2021-05-18T16:56:57Z","pmid":1,"year":"2021","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Start Grant 279307: Graph Games (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2023-11-07T08:27:23Z"},{"month":"02","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1906.00110"]},"oa":1,"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"conference":{"name":"OPODIS: International Conference on Principles of Distributed Systems","end_date":"2019-12-19","start_date":"2019-12-17","location":"Neuchâtel, Switzerland"},"doi":"10.4230/LIPIcs.OPODIS.2019.21","language":[{"iso":"eng"}],"article_number":"21","file_date_updated":"2020-07-14T12:47:56Z","year":"2020","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"first_name":"Laura","last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","full_name":"Schmid, Laura"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_updated":"2023-02-23T13:05:49Z","date_created":"2020-01-21T16:00:26Z","volume":153,"scopus_import":"1","day":"10","article_processing_charge":"No","has_accepted_license":"1","publication":"Proceedings of the 23rd International Conference on Principles of Distributed Systems","citation":{"ama":"Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21","ieee":"L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd International Conference on Principles of Distributed Systems, Neuchâtel, Switzerland, 2020, vol. 153.","apa":"Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21","ista":"Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.","short":"L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.","chicago":"Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21."},"date_published":"2020-02-10T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to \"one-shot games\"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7346","ddc":["000"],"title":"The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game","status":"public","intvolume":" 153","file":[{"date_updated":"2020-07-14T12:47:56Z","date_created":"2020-03-23T09:14:06Z","checksum":"9a91916ac2c21ab42458fcda39ef0b8d","relation":"main_file","file_id":"7608","content_type":"application/pdf","file_size":630752,"creator":"dernst","file_name":"2019_LIPIcS_Schmid.pdf","access_level":"open_access"}],"oa_version":"Preprint"},{"month":"08","publication_identifier":{"isbn":["9783959771603"],"issn":["18688969"]},"conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Virtual","start_date":"2020-09-01","end_date":"2020-09-04"},"doi":"10.4230/LIPIcs.CONCUR.2020.23","language":[{"iso":"eng"}],"external_id":{"arxiv":["2007.08917"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"file_date_updated":"2020-10-05T14:04:25Z","license":"https://creativecommons.org/licenses/by/3.0/","article_number":"23","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"date_created":"2020-10-04T22:01:36Z","date_updated":"2021-01-12T08:20:15Z","volume":171,"year":"2020","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"06","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-08-06T00:00:00Z","publication":"31st International Conference on Concurrency Theory","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.23","ista":"Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23."},"abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"file_id":"8610","relation":"main_file","date_created":"2020-10-05T14:04:25Z","date_updated":"2020-10-05T14:04:25Z","success":1,"checksum":"5039752f644c4b72b9361d21a5e31baf","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":601231}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8600","ddc":["000"],"status":"public","title":"Multi-dimensional long-run average problems for vector addition systems with states","intvolume":" 171"},{"publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2020.22","conference":{"location":"Prague, Czech Republic","start_date":"2020-08-24","end_date":"2020-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"quality_controlled":"1","external_id":{"arxiv":["2007.02894"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"ec_funded":1,"file_date_updated":"2020-09-21T13:57:34Z","article_number":"22:1-22:13","volume":170,"date_created":"2020-09-20T22:01:36Z","date_updated":"2021-01-12T08:19:55Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","year":"2020","has_accepted_license":"1","article_processing_charge":"No","day":"18","scopus_import":"1","date_published":"2020-08-18T00:00:00Z","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.","ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13."},"publication":"45th International Symposium on Mathematical Foundations of Computer Science","abstract":[{"lang":"eng","text":"Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete."}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"content_type":"application/pdf","file_size":491374,"creator":"dernst","file_name":"2020_LIPIcs_Chatterjee.pdf","access_level":"open_access","date_updated":"2020-09-21T13:57:34Z","date_created":"2020-09-21T13:57:34Z","checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","success":1,"relation":"main_file","file_id":"8550"}],"oa_version":"Published Version","intvolume":" 170","status":"public","ddc":["000"],"title":"Simplified game of life: Algorithms and complexity","_id":"8533","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_created":"2020-09-20T22:01:36Z","date_updated":"2021-01-12T08:19:56Z","volume":170,"author":[{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"last_name":"Mazzocchi","first_name":"Nicolas","full_name":"Mazzocchi, Nicolas"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"year":"2020","acknowledgement":"Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS.","file_date_updated":"2020-09-21T14:17:08Z","ec_funded":1,"article_number":"51:1-51:12","language":[{"iso":"eng"}],"conference":{"name":"MFCS: Symposium on Mathematical Foundations of Computer Science","end_date":"2020-08-28","location":"Prague, Czech Republic","start_date":"2020-08-24"},"doi":"10.4230/LIPIcs.MFCS.2020.51","quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"month":"08","publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"oa_version":"Published Version","file":[{"file_id":"8552","relation":"main_file","date_created":"2020-09-21T14:17:08Z","date_updated":"2020-09-21T14:17:08Z","success":1,"checksum":"2dc9e2fad6becd4563aef3e27a473f70","file_name":"2020_LIPIcsMFCS_Jecker.pdf","access_level":"open_access","creator":"dernst","file_size":597977,"content_type":"application/pdf"}],"status":"public","title":"Unary prime languages","ddc":["000"],"intvolume":" 170","_id":"8534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2020-08-18T00:00:00Z","publication":"45th International Symposium on Mathematical Foundations of Computer Science","citation":{"chicago":"Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51.","mla":"Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.","short":"I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.","ieee":"I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.","apa":"Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51","ama":"Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51"},"day":"18","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"08","page":"102-115","citation":{"chicago":"Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic Games.” In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , 102–15. Association for Computing Machinery, 2020. https://doi.org/10.1145/3373718.3394761.","short":"P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, T. Winkler, in:, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association for Computing Machinery, 2020, pp. 102–115.","mla":"Ashok, Pranav, et al. “Approximating Values of Generalized-Reachability Stochastic Games.” Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association for Computing Machinery, 2020, pp. 102–15, doi:10.1145/3373718.3394761.","apa":"Ashok, P., Chatterjee, K., Kretinsky, J., Weininger, M., & Winkler, T. (2020). Approximating values of generalized-reachability stochastic games. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery. https://doi.org/10.1145/3373718.3394761","ieee":"P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, and T. Winkler, “Approximating values of generalized-reachability stochastic games,” in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Saarbrücken, Germany, 2020, pp. 102–115.","ista":"Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. 2020. Approximating values of generalized-reachability stochastic games. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in Computer Science, 102–115.","ama":"Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. Approximating values of generalized-reachability stochastic games. In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . Association for Computing Machinery; 2020:102-115. doi:10.1145/3373718.3394761"},"publication":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science ","date_published":"2020-07-08T00:00:00Z","type":"conference","abstract":[{"text":"Simple stochastic games are turn-based 2½-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a conjunction of such conditions as objective. Despite a plethora of recent results on the analysis of systems with multiple objectives, the decidability of this basic problem remains open. In this paper, we present an algorithm approximating the Pareto frontier of the achievable values to a given precision. Moreover, it is an anytime algorithm, meaning it can be stopped at any time returning the current approximation and its error bound.","lang":"eng"}],"title":"Approximating values of generalized-reachability stochastic games","status":"public","ddc":["000"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7955","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"8804","date_created":"2020-11-25T09:38:14Z","date_updated":"2020-11-25T09:38:14Z","checksum":"d0d0288fe991dd16cf5f02598b794240","success":1,"file_name":"2020_LICS_Ashok.pdf","access_level":"open_access","file_size":1001395,"content_type":"application/pdf","creator":"dernst"}],"publication_identifier":{"isbn":["9781450371049"]},"month":"07","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"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000665014900010"],"arxiv":["1908.05106"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3373718.3394761","conference":{"name":"LICS: Symposium on Logic in Computer Science","end_date":"2020-07-11","location":"Saarbrücken, Germany","start_date":"2020-07-08"},"ec_funded":1,"file_date_updated":"2020-11-25T09:38:14Z","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"Pranav Ashok, Jan Křetínský and Maximilian Weininger were funded in part by TUM IGSSE Grant 10.06 (PARSEC) and the German Research Foundation (DFG) project KR 4890/2-1\r\n“Statistical Unbounded Verification”. Krishnendu Chatterjee was supported by the ERC CoG 863818 (ForM-SMArt) and Vienna Science and Technology Fund (WWTF) Project ICT15-\r\n003. Tobias Winkler was supported by the RTG 2236 UnRAVe.","year":"2020","date_created":"2020-06-14T22:00:48Z","date_updated":"2023-08-21T08:24:36Z","author":[{"first_name":"Pranav","last_name":"Ashok","full_name":"Ashok, Pranav"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kretinsky, Jan","first_name":"Jan","last_name":"Kretinsky"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"},{"first_name":"Tobias","last_name":"Winkler","full_name":"Winkler, Tobias"}]},{"article_number":"e1008402","file_date_updated":"2020-11-18T07:26:10Z","publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"KrCh"}],"acknowledgement":"We thank Igor Erovenko for many helpful comments on an earlier version of this paper. : Army Research Laboratory (grant W911NF-18-2-0265) (M.A.N.); the Bill & Melinda Gates Foundation (grant OPP1148627) (M.A.N.); the NVIDIA Corporation (A.M.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","year":"2020","date_updated":"2023-08-22T12:49:18Z","date_created":"2020-11-18T07:20:23Z","volume":16,"author":[{"first_name":"Kamran","last_name":"Kaveh","full_name":"Kaveh, Kamran"},{"full_name":"McAvoy, Alex","last_name":"McAvoy","first_name":"Alex"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}],"month":"11","publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]},"quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000591317200004"]},"language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1008402","type":"journal_article","abstract":[{"lang":"eng","text":"Resources are rarely distributed uniformly within a population. Heterogeneity in the concentration of a drug, the quality of breeding sites, or wealth can all affect evolutionary dynamics. In this study, we represent a collection of properties affecting the fitness at a given location using a color. A green node is rich in resources while a red node is poorer. More colors can represent a broader spectrum of resource qualities. For a population evolving according to the birth-death Moran model, the first question we address is which structures, identified by graph connectivity and graph coloring, are evolutionarily equivalent. We prove that all properly two-colored, undirected, regular graphs are evolutionarily equivalent (where “properly colored” means that no two neighbors have the same color). We then compare the effects of background heterogeneity on properly two-colored graphs to those with alternative schemes in which the colors are permuted. Finally, we discuss dynamic coloring as a model for spatiotemporal resource fluctuations, and we illustrate that random dynamic colorings often diminish the effects of background heterogeneity relative to a proper two-coloring."}],"issue":"11","ddc":["000"],"status":"public","title":"The Moran process on 2-chromatic graphs","intvolume":" 16","_id":"8767","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"8768","date_updated":"2020-11-18T07:26:10Z","date_created":"2020-11-18T07:26:10Z","checksum":"555456dd0e47bcf9e0994bcb95577e88","success":1,"file_name":"2020_PlosCompBio_Kaveh.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2498594,"creator":"dernst"}],"keyword":["Ecology","Modelling and Simulation","Computational Theory and Mathematics","Genetics","Ecology","Evolution","Behavior and Systematics","Molecular Biology","Cellular and Molecular Neuroscience"],"scopus_import":"1","day":"05","has_accepted_license":"1","article_processing_charge":"No","article_type":"original","publication":"PLOS Computational Biology","citation":{"ieee":"K. Kaveh, A. McAvoy, K. Chatterjee, and M. A. Nowak, “The Moran process on 2-chromatic graphs,” PLOS Computational Biology, vol. 16, no. 11. Public Library of Science, 2020.","apa":"Kaveh, K., McAvoy, A., Chatterjee, K., & Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008402","ista":"Kaveh K, McAvoy A, Chatterjee K, Nowak MA. 2020. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 16(11), e1008402.","ama":"Kaveh K, McAvoy A, Chatterjee K, Nowak MA. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 2020;16(11). doi:10.1371/journal.pcbi.1008402","chicago":"Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1008402.","short":"K. Kaveh, A. McAvoy, K. Chatterjee, M.A. Nowak, PLOS Computational Biology 16 (2020).","mla":"Kaveh, Kamran, et al. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology, vol. 16, no. 11, e1008402, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1008402."},"date_published":"2020-11-05T00:00:00Z"},{"month":"11","publication_identifier":{"eissn":["22277390"]},"language":[{"iso":"eng"}],"doi":"10.3390/math8111945","isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"external_id":{"isi":["000593962100001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-11-23T13:06:30Z","ec_funded":1,"article_number":"1945","date_updated":"2023-08-22T13:25:45Z","date_created":"2020-11-22T23:01:24Z","volume":8,"author":[{"first_name":"Maria","last_name":"Kleshnina","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","full_name":"Kleshnina, Maria"},{"last_name":"Streipert","first_name":"Sabrina","full_name":"Streipert, Sabrina"},{"full_name":"Filar, Jerzy","last_name":"Filar","first_name":"Jerzy"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"MDPI","year":"2020","acknowledgement":"This work was supported by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411, the Australian Research Council Discovery Grants DP160101236 and DP150100618, and the European Research Council Consolidator Grant 863818 (FoRM-SMArt).\r\nAuthors would like to thank Patrick McKinlay for his work on the preliminary results for this paper.","day":"04","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-11-04T00:00:00Z","article_type":"original","publication":"Mathematics","citation":{"chicago":"Kleshnina, Maria, Sabrina Streipert, Jerzy Filar, and Krishnendu Chatterjee. “Prioritised Learning in Snowdrift-Type Games.” Mathematics. MDPI, 2020. https://doi.org/10.3390/math8111945.","short":"M. Kleshnina, S. Streipert, J. Filar, K. Chatterjee, Mathematics 8 (2020).","mla":"Kleshnina, Maria, et al. “Prioritised Learning in Snowdrift-Type Games.” Mathematics, vol. 8, no. 11, 1945, MDPI, 2020, doi:10.3390/math8111945.","apa":"Kleshnina, M., Streipert, S., Filar, J., & Chatterjee, K. (2020). Prioritised learning in snowdrift-type games. Mathematics. MDPI. https://doi.org/10.3390/math8111945","ieee":"M. Kleshnina, S. Streipert, J. Filar, and K. Chatterjee, “Prioritised learning in snowdrift-type games,” Mathematics, vol. 8, no. 11. MDPI, 2020.","ista":"Kleshnina M, Streipert S, Filar J, Chatterjee K. 2020. Prioritised learning in snowdrift-type games. Mathematics. 8(11), 1945.","ama":"Kleshnina M, Streipert S, Filar J, Chatterjee K. Prioritised learning in snowdrift-type games. Mathematics. 2020;8(11). doi:10.3390/math8111945"},"abstract":[{"lang":"eng","text":"Cooperation is a ubiquitous and beneficial behavioural trait despite being prone to exploitation by free-riders. Hence, cooperative populations are prone to invasions by selfish individuals. However, a population consisting of only free-riders typically does not survive. Thus, cooperators and free-riders often coexist in some proportion. An evolutionary version of a Snowdrift Game proved its efficiency in analysing this phenomenon. However, what if the system has already reached its stable state but was perturbed due to a change in environmental conditions? Then, individuals may have to re-learn their effective strategies. To address this, we consider behavioural mistakes in strategic choice execution, which we refer to as incompetence. Parametrising the propensity to make such mistakes allows for a mathematical description of learning. We compare strategies based on their relative strategic advantage relying on both fitness and learning factors. When strategies are learned at distinct rates, allowing learning according to a prescribed order is optimal. Interestingly, the strategy with the lowest strategic advantage should be learnt first if we are to optimise fitness over the learning path. Then, the differences between strategies are balanced out in order to minimise the effect of behavioural uncertainty."}],"issue":"11","type":"journal_article","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_Mathematics_Kleshnina.pdf","creator":"dernst","content_type":"application/pdf","file_size":565191,"file_id":"8797","relation":"main_file","success":1,"checksum":"61cfcc3b35760656ce7a9385a4ace5d2","date_created":"2020-11-23T13:06:30Z","date_updated":"2020-11-23T13:06:30Z"}],"ddc":["000"],"title":"Prioritised learning in snowdrift-type games","status":"public","intvolume":" 8","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8789"},{"publication_identifier":{"issn":["02780070"],"eissn":["19374151"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1109/TCAD.2020.3012803","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000587712700069"]},"volume":39,"date_created":"2020-11-22T23:01:24Z","date_updated":"2023-08-22T13:27:05Z","author":[{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"first_name":"Nico","last_name":"Schaumberger","full_name":"Schaumberger, Nico"},{"last_name":"Schmid","first_name":"Ulrich","full_name":"Schmid, Ulrich"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"}],"department":[{"_id":"KrCh"}],"publisher":"IEEE","publication_status":"published","year":"2020","acknowledgement":"This work was supported by the Austrian Science Foundation (FWF) under the NFN RiSE/SHiNE under Grant S11405 and Grant S11407. This article was presented in the International Conference on Embedded Software 2020 and appears as part of the ESWEEK-TCAD special issue. ","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2020-11-01T00:00:00Z","page":"3981-3992","article_type":"original","citation":{"ista":"Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. 2020. Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 3981–3992.","ieee":"A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware automated competitive analysis of real-time scheduling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 3981–3992, 2020.","apa":"Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020). Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012803","ama":"Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2020;39(11):3981-3992. doi:10.1109/TCAD.2020.3012803","chicago":"Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012803.","mla":"Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:10.1109/TCAD.2020.3012803.","short":"A. Pavlogiannis, N. Schaumberger, U. Schmid, K. Chatterjee, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 3981–3992."},"publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issue":"11","abstract":[{"text":"We consider a real-time setting where an environment releases sequences of firm-deadline tasks, and an online scheduler chooses on-the-fly the ones to execute on a single processor so as to maximize cumulated utility. The competitive ratio is a well-known performance measure for the scheduler: it gives the worst-case ratio, among all possible choices for the environment, of the cumulated utility of the online scheduler versus an offline scheduler that knows these choices in advance. Traditionally, competitive analysis is performed by hand, while automated techniques are rare and only handle static environments with independent tasks. We present a quantitative-verification framework for precedence-aware competitive analysis, where task releases may depend on preceding scheduling choices, i.e., the environment can respond to scheduling decisions dynamically . We consider two general classes of precedences: 1) follower precedences force the release of a dependent task upon the completion of a set of precursor tasks, while and 2) pairing precedences modify the characteristics of a dependent task provided the completion of a set of precursor tasks. Precedences make competitive analysis challenging, as the online and offline schedulers operate on diverging sequences. We make a formal presentation of our framework, and use a GPU-based implementation to analyze ten well-known schedulers on precedence-based application examples taken from the existing literature: 1) a handshake protocol (HP); 2) network packet-switching; 3) query scheduling (QS); and 4) a sporadic-interrupt setting. Our experimental results show that precedences and task parameters can vary drastically the best scheduler. Our framework thus supports application designers in choosing the best scheduler among a given set automatically.","lang":"eng"}],"type":"journal_article","oa_version":"None","intvolume":" 39","title":"Precedence-aware automated competitive analysis of real-time scheduling","status":"public","_id":"8788","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"issue":"02","abstract":[{"lang":"eng","text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 34","status":"public","title":"All-pay bidding games on graphs","_id":"9197","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"03","scopus_import":"1","date_published":"2020-04-03T00:00:00Z","page":"1798-1805","article_type":"original","citation":{"short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805."},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":34,"date_updated":"2023-09-05T12:40:00Z","date_created":"2021-02-25T09:05:18Z","author":[{"full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","first_name":"Josef"}],"publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","year":"2020","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"],"issn":["2159-5399"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1609/aaai.v34i02.5546","conference":{"end_date":"2020-02-12","start_date":"2020-02-07","location":"New York, NY, United States","name":"AAAI: Conference on Artificial Intelligence"},"project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"}],"quality_controlled":"1","external_id":{"arxiv":["1911.08360"]}},{"file_date_updated":"2020-11-19T11:27:10Z","ec_funded":1,"publication_status":"published","publisher":"Wiley","department":[{"_id":"SyCr"},{"_id":"KrCh"}],"year":"2020","acknowledgement":"We thank Bernhardt Steinwender and Jorgen Eilenberg for the fungal strains, Xavier Espadaler, Mireia Diaz, Christiane Wanke, Lumi Viljakainen and the Social Immunity Team at IST Austria, for help with ant collection, and Wanda Gorecka and Gertraud Stift of the IST Austria Life Science Facility for technical support. We are thankful to Dieter Ebert for input at all stages of the project, Roger Mundry for statistical advice, Hinrich Schulenburg, Paul Schmid-Hempel, Yuko\r\nUlrich and Joachim Kurtz for project discussion, Bor Kavcic for advice on growth curves, Marcus Roper for advice on modelling work and comments on the manuscript, as well as Marjon de Vos, Weini Huang and the Social Immunity Team for comments on the manuscript.\r\nThis study was funded by the German Research Foundation (DFG) within the Priority Programme 1399 Host-parasite Coevolution (CR 118/3 to S.C.) and the People Programme\r\n(Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no 291734 (ISTFELLOW to B.M.). ","date_updated":"2023-09-05T16:04:49Z","date_created":"2020-01-20T13:32:12Z","volume":23,"author":[{"full_name":"Milutinovic, Barbara","first_name":"Barbara","last_name":"Milutinovic","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8214-4758"},{"full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","last_name":"Stock"},{"first_name":"Anna V","last_name":"Grasse","id":"406F989C-F248-11E8-B48F-1D18A9856A87","full_name":"Grasse, Anna V"},{"full_name":"Naderlinger, Elisabeth","id":"31757262-F248-11E8-B48F-1D18A9856A87","last_name":"Naderlinger","first_name":"Elisabeth"},{"full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","first_name":"Christian","last_name":"Hilbe"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"13060"}],"link":[{"url":"https://ist.ac.at/en/news/social-ants-shapes-disease-outcome/","description":"News on IST Homepage","relation":"press_release"}]},"month":"03","publication_identifier":{"issn":["1461-023X"],"eissn":["1461-0248"]},"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"isi":["000507515900001"]},"acknowledged_ssus":[{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"doi":"10.1111/ele.13458","type":"journal_article","abstract":[{"text":"Coinfections with multiple pathogens can result in complex within‐host dynamics affecting virulence and transmission. While 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 defences 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 while increasing co‐sporulation on individual cadavers and maintaining a higher pathogen diversity at the community level. Mathematical modelling 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 level and population level.","lang":"eng"}],"issue":"3","status":"public","ddc":["570"],"title":"Social immunity modulates competition between coinfecting pathogens","intvolume":" 23","_id":"7343","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"checksum":"0cd8be386fa219db02845b7c3991ce04","success":1,"date_updated":"2020-11-19T11:27:10Z","date_created":"2020-11-19T11:27:10Z","relation":"main_file","file_id":"8776","content_type":"application/pdf","file_size":561749,"creator":"dernst","access_level":"open_access","file_name":"2020_EcologyLetters_Milutinovic.pdf"}],"scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","article_type":"letter_note","page":"565-574","publication":"Ecology Letters","citation":{"apa":"Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., & Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Ecology Letters. Wiley. https://doi.org/10.1111/ele.13458","ieee":"B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 565–574, 2020.","ista":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens. Ecology Letters. 23(3), 565–574.","ama":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social immunity modulates competition between coinfecting pathogens. Ecology Letters. 2020;23(3):565-574. doi:10.1111/ele.13458","chicago":"Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Ecology Letters. Wiley, 2020. https://doi.org/10.1111/ele.13458.","short":"B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer, Ecology Letters 23 (2020) 565–574.","mla":"Milutinovic, Barbara, et al. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 565–74, doi:10.1111/ele.13458."},"date_published":"2020-03-01T00:00:00Z"},{"month":"12","day":"19","article_processing_charge":"No","date_published":"2020-12-19T00:00:00Z","doi":"10.5061/DRYAD.CRJDFN318","tmp":{"short":"CC0 (1.0)","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)"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.crjdfn318"}],"oa":1,"citation":{"ista":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens, Dryad, 10.5061/DRYAD.CRJDFN318.","ieee":"B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens.” Dryad, 2020.","apa":"Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., & Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Dryad. https://doi.org/10.5061/DRYAD.CRJDFN318","ama":"Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social immunity modulates competition between coinfecting pathogens. 2020. doi:10.5061/DRYAD.CRJDFN318","chicago":"Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Dryad, 2020. https://doi.org/10.5061/DRYAD.CRJDFN318.","mla":"Milutinovic, Barbara, et al. Social Immunity Modulates Competition between Coinfecting Pathogens. Dryad, 2020, doi:10.5061/DRYAD.CRJDFN318.","short":"B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer, (2020)."},"abstract":[{"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.","lang":"eng"}],"type":"research_data_reference","author":[{"last_name":"Milutinovic","first_name":"Barbara","orcid":"0000-0002-8214-4758","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","full_name":"Milutinovic, Barbara"},{"full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","last_name":"Stock"},{"full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse"},{"full_name":"Naderlinger, Elisabeth","first_name":"Elisabeth","last_name":"Naderlinger","id":"31757262-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe","first_name":"Christian","full_name":"Hilbe, Christian"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"}],"related_material":{"record":[{"id":"7343","status":"public","relation":"used_in_publication"}]},"date_updated":"2023-09-05T16:04:48Z","date_created":"2023-05-23T16:11:22Z","oa_version":"Published Version","year":"2020","_id":"13060","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"title":"Social immunity modulates competition between coinfecting pathogens","status":"public","department":[{"_id":"SyCr"},{"_id":"KrCh"}],"publisher":"Dryad"},{"date_created":"2020-08-02T22:00:58Z","date_updated":"2023-09-07T13:16:18Z","volume":30,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"full_name":"Karkhanis, Deep","first_name":"Deep","last_name":"Karkhanis"},{"full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","first_name":"Petr"},{"full_name":"Royer, Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8407-0705","first_name":"Amélie","last_name":"Royer"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8390"}]},"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Association for the Advancement of Artificial Intelligence","year":"2020","acknowledgement":"Krishnendu Chatterjee is supported by the Austrian ScienceFund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE),and COST Action GAMENET. Petr Novotn ́y is supported bythe Czech Science Foundation grant No. GJ19-15134Y.","language":[{"iso":"eng"}],"conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","end_date":"2020-10-30","location":"Nancy, France","start_date":"2020-10-26"},"quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"month":"06","publication_identifier":{"eissn":["23340843"],"issn":["23340835"]},"oa_version":"None","status":"public","title":"Multiple-environment Markov decision processes: Efficient analysis and applications","intvolume":" 30","_id":"8193","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Multiple-environment Markov decision processes (MEMDPs) are MDPs equipped with not one, but multiple probabilistic transition functions, which represent the various possible unknown environments. While the previous research on MEMDPs focused on theoretical properties for long-run average payoff, we study them with discounted-sum payoff and focus on their practical advantages and applications. MEMDPs can be viewed as a special case of Partially observable and Mixed observability MDPs: the state of the system is perfectly observable, but not the environment. We show that the specific structure of MEMDPs allows for more efficient algorithmic analysis, in particular for faster belief updates. We demonstrate the applicability of MEMDPs in several domains. In particular, we formalize the sequential decision-making approach to contextual recommendation systems as MEMDPs and substantially improve over the previous MDP approach.","lang":"eng"}],"type":"conference","date_published":"2020-06-01T00:00:00Z","page":"48-56","publication":"Proceedings of the 30th International Conference on Automated Planning and Scheduling","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.","short":"K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, A. Royer, in:, Proceedings of the 30th International Conference on Automated Planning and Scheduling, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.","mla":"Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” Proceedings of the 30th International Conference on Automated Planning and Scheduling, vol. 30, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.","ieee":"K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, and A. Royer, “Multiple-environment Markov decision processes: Efficient analysis and applications,” in Proceedings of the 30th International Conference on Automated Planning and Scheduling, Nancy, France, 2020, vol. 30, pp. 48–56.","apa":"Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.","ista":"Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.","ama":"Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. Multiple-environment Markov decision processes: Efficient analysis and applications. In: Proceedings of the 30th International Conference on Automated Planning and Scheduling. Vol 30. Association for the Advancement of Artificial Intelligence; 2020:48-56."},"day":"01","article_processing_charge":"No","scopus_import":"1"},{"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"year":"2020","date_updated":"2023-10-03T11:36:13Z","date_created":"2020-08-16T22:00:58Z","volume":12225,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87","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"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"12738"}]},"file_date_updated":"2020-08-17T11:32:44Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"external_id":{"arxiv":["2005.04018"],"isi":["000695272500021"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-030-53291-8_21","month":"07","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030532901"]},"status":"public","title":"Stochastic games with lexicographic reachability-safety objectives","ddc":["000"],"intvolume":" 12225","_id":"8272","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"access_level":"open_access","file_name":"2020_LNCS_CAV_Chatterjee.pdf","content_type":"application/pdf","file_size":625056,"creator":"dernst","relation":"main_file","file_id":"8276","checksum":"093d4788d7d5b2ce0ffe64fbe7820043","success":1,"date_created":"2020-08-17T11:32:44Z","date_updated":"2020-08-17T11:32:44Z"}],"oa_version":"Published Version","alternative_title":["LNCS"],"type":"conference","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"}],"page":"398-420","publication":"International Conference on Computer Aided Verification","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.","apa":"Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. https://doi.org/10.1007/978-3-030-53291-8_21","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in International Conference on Computer Aided Verification, 2020, vol. 12225, pp. 398–420.","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: International Conference on Computer Aided Verification. Vol 12225. Springer Nature; 2020:398-420. doi:10.1007/978-3-030-53291-8_21","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53291-8_21.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” International Conference on Computer Aided Verification, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420."},"date_published":"2020-07-14T00:00:00Z","scopus_import":"1","day":"14","has_accepted_license":"1","article_processing_charge":"No"},{"day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-10-01T00:00:00Z","publication":"Iranian Journal of Mathematical Sciences and Informatics","citation":{"chicago":"Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar Meybodi. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research, 2020. https://doi.org/10.29252/ijmsi.15.2.117.","short":"A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian Journal of Mathematical Sciences and Informatics 15 (2020) 117–128.","mla":"Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:10.29252/ijmsi.15.2.117.","apa":"Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., & Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research. https://doi.org/10.29252/ijmsi.15.2.117","ieee":"A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020.","ista":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 15(2), 117–128.","ama":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 2020;15(2):117-128. doi:10.29252/ijmsi.15.2.117"},"article_type":"original","page":"117-128","abstract":[{"text":"We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory. We also demonstrate that one can induce a natural belief structure on one set, given a belief structure on another set, if the two sets are related by a partial monotone S-approximation space. ","lang":"eng"}],"issue":"2","type":"journal_article","file":[{"file_id":"8676","relation":"main_file","success":1,"checksum":"f299661a6d51cda6d255a76be696f48d","date_created":"2020-10-19T11:14:20Z","date_updated":"2020-10-19T11:14:20Z","access_level":"open_access","file_name":"2020_ijmsi_Shakiba_accepted.pdf","creator":"dernst","file_size":261688,"content_type":"application/pdf"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8671","ddc":["000"],"title":"A note on belief structures and s-approximation spaces","status":"public","intvolume":" 15","month":"10","publication_identifier":{"issn":["1735-4463"],"eissn":["2008-9473"]},"doi":"10.29252/ijmsi.15.2.117","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1805.10672"]},"quality_controlled":"1","project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"file_date_updated":"2020-10-19T11:14:20Z","author":[{"last_name":"Shakiba","first_name":"A.","full_name":"Shakiba, A."},{"full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"first_name":"M.R.","last_name":"Hooshmandasl","full_name":"Hooshmandasl, M.R."},{"full_name":"Alambardar Meybodi, M.","first_name":"M.","last_name":"Alambardar Meybodi"}],"date_updated":"2023-10-16T09:25:00Z","date_created":"2020-10-18T22:01:36Z","volume":15,"year":"2020","acknowledgement":"We are very grateful to the anonymous reviewer for detailed comments and suggestions that significantly improved the presentation of this paper. The research was partially supported by a DOC fellowship of the Austrian Academy of Sciences.","publication_status":"published","publisher":"Iranian Academic Center for Education, Culture and Research","department":[{"_id":"KrCh"}]},{"citation":{"short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational Biology 16 (2020).","mla":"Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology, vol. 16, e1007494, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007494.","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 2020;16. doi:10.1371/journal.pcbi.1007494","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. Public Library of Science, 2020.","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007494","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494."},"publication":"PLoS computational biology","article_type":"original","date_published":"2020-01-17T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"17","_id":"7212","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 16","status":"public","title":"Limits on amplifiers of natural selection under death-Birth updating","ddc":["000"],"file":[{"date_created":"2020-02-03T07:32:42Z","date_updated":"2020-07-14T12:47:53Z","checksum":"ce32ee2d2f53aed832f78bbd47e882df","file_id":"7441","relation":"main_file","creator":"dernst","file_size":1817531,"content_type":"application/pdf","file_name":"2020_PlosCompBio_Tkadlec.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation probability of advantageous mutants, compared to well-mixed populations. Extensive studies have shown that many amplifiers exist for the Birth-death Moran process, some of them substantially increasing the fixation probability or even guaranteeing fixation in the limit of large population size. On the other hand, no amplifiers are known for the death-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplification. In this work we resolve this disparity, by showing that any amplification under death-Birth updating is necessarily bounded and transient. Our boundedness result states that even if a population structure does amplify selection, the resulting fixation probability is close to that of the well-mixed population. Our transience result states that for any population structure there exists a threshold r⋆ such that the population structure ceases to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally, we also extend the above results to δ-death-Birth updating, which is a combination of Birth-death and death-Birth updating. On the positive side, we identify population structures that maintain amplification for a wide range of values r and δ. These results demonstrate that amplification of natural selection depends on the specific mechanisms of the evolutionary process."}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1906.02785"],"isi":["000510916500025"]},"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"isi":1,"quality_controlled":"1","doi":"10.1371/journal.pcbi.1007494","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["15537358"]},"month":"01","year":"2020","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","publication_status":"published","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"7196"}]},"author":[{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}],"volume":16,"date_created":"2019-12-23T13:45:11Z","date_updated":"2023-10-17T12:29:47Z","article_number":"e1007494","ec_funded":1,"file_date_updated":"2020-07-14T12:47:53Z"},{"publisher":"Institute of Science and Technology Austria","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publication_status":"published","year":"2020","date_created":"2019-12-20T12:26:36Z","date_updated":"2023-10-17T12:29:46Z","related_material":{"record":[{"id":"7210","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"5751"},{"id":"7212","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"}],"file_date_updated":"2020-07-14T12:47:52Z","oa":1,"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:7196","publication_identifier":{"eissn":["2663-337X"]},"month":"01","status":"public","title":"A role of graphs in evolutionary processes","ddc":["519"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7196","file":[{"file_name":"thesis.zip","access_level":"closed","content_type":"application/zip","file_size":21100497,"creator":"jtkadlec","relation":"source_file","file_id":"7255","date_updated":"2020-07-14T12:47:52Z","date_created":"2020-01-12T11:49:49Z","checksum":"451f8e64b0eb26bf297644ac72bfcbe9"},{"checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985","date_updated":"2020-07-14T12:47:52Z","date_created":"2020-01-28T07:32:42Z","file_id":"7367","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":11670983,"access_level":"open_access","file_name":"2020_Tkadlec_Thesis.pdf"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time."}],"page":"144","citation":{"ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196","ista":"Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.","apa":"Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","mla":"Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.","short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020.","chicago":"Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196."},"date_published":"2020-01-12T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"12"},{"abstract":[{"text":"Data and mathematica notebooks for plotting figures from Language learning with communication between learners","lang":"eng"}],"type":"research_data_reference","oa_version":"Published Version","date_created":"2021-08-06T13:09:57Z","date_updated":"2023-10-18T06:36:00Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"198"}]},"author":[{"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":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"department":[{"_id":"KrCh"}],"publisher":"Royal Society","title":"Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners","status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9814","year":"2020","article_processing_charge":"No","day":"15","month":"10","doi":"10.6084/m9.figshare.5973013.v1","date_published":"2020-10-15T00:00:00Z","oa":1,"citation":{"ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:10.6084/m9.figshare.5973013.v1","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. https://doi.org/10.6084/m9.figshare.5973013.v1","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, 10.6084/m9.figshare.5973013.v1.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","mla":"Ibsen-Jensen, Rasmus, et al. Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners. Royal Society, 2020, doi:10.6084/m9.figshare.5973013.v1.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. https://doi.org/10.6084/m9.figshare.5973013.v1."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.5973013.v1"}]},{"file":[{"file_name":"2019_ACM_POPL_Wang.pdf","access_level":"open_access","creator":"cziletti","file_size":564151,"content_type":"application/pdf","file_id":"8328","relation":"main_file","date_created":"2020-09-01T11:12:58Z","date_updated":"2020-09-01T11:12:58Z","success":1,"checksum":"c6193d109ff4ecb17e7a6513d8eb34c0"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"8324","intvolume":" 4","ddc":["004"],"status":"public","title":"Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time","issue":"POPL","abstract":[{"lang":"eng","text":"The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous approach develops a relational program logic framework for proving expected sensitivity of probabilistic while loops, where the number of iterations is fixed and bounded. In this work, we consider probabilistic while loops where the number of iterations is not fixed, but randomized and depends on the initial input values. We present a sound approach for proving expected sensitivity of such programs. Our sound approach is martingale-based and can be automated through existing martingale-synthesis algorithms. Furthermore, our approach is compositional for sequential composition of while loops under a mild side condition. We demonstrate the effectiveness of our approach on several classical examples from Gambler's Ruin, stochastic hybrid systems and stochastic gradient descent. We also present experimental results showing that our automated approach can handle various probabilistic programs in the literature."}],"type":"conference","date_published":"2020-01-01T00:00:00Z","citation":{"ama":"Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In: Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093","ista":"Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25.","apa":"Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093","ieee":"P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time,” in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL.","mla":"Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.","short":"P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.","chicago":"Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093."},"publication":"Proceedings of the ACM on Programming Languages","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.3533633"}]},"author":[{"full_name":"Wang, Peixin","last_name":"Wang","first_name":"Peixin"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Deng, Yuxin","first_name":"Yuxin","last_name":"Deng"},{"full_name":"Xu, Ming","first_name":"Ming","last_name":"Xu"}],"volume":4,"date_updated":"2024-02-22T15:16:45Z","date_created":"2020-08-30T22:01:12Z","acknowledgement":"We thank anonymous reviewers for helpful comments, especially for pointing to us a scenario of piecewise-linear approximation (Remark5). The research was partially supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu, director of the BASICS Lab at Shanghai Jiao Tong University, for his support.","year":"2020","publisher":"ACM","department":[{"_id":"KrCh"}],"publication_status":"published","file_date_updated":"2020-09-01T11:12:58Z","article_number":"25","doi":"10.1145/3371093","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1902.04744"]},"project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"eissn":["2475-1421"]},"month":"01"},{"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15055","title":"Reinforcement learning of risk-constrained policies in Markov decision processes","status":"public","intvolume":" 34","abstract":[{"text":"Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states.","lang":"eng"}],"issue":"06","type":"journal_article","date_published":"2020-04-03T00:00:00Z","publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","citation":{"ama":"Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 2020;34(06):9794-9801. doi:10.1609/aaai.v34i06.6531","ista":"Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.","ieee":"T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning of risk-constrained policies in Markov decision processes,” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06. Association for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.","apa":"Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i06.6531","mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.","short":"T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531."},"article_type":"original","page":"9794-9801","day":"03","article_processing_charge":"No","keyword":["General Medicine"],"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Novotný","first_name":"Petr","full_name":"Novotný, Petr"},{"full_name":"Vahala, Jiří","first_name":"Jiří","last_name":"Vahala"}],"date_updated":"2024-03-04T08:30:16Z","date_created":"2024-03-04T08:07:22Z","volume":34,"acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala are supported by the Czech Science Foundation grant No. GJ19-15134Y.","year":"2020","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Association for the Advancement of Artificial Intelligence","conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"New York, NY, United States","start_date":"2020-02-07","end_date":"2020-02-12"},"doi":"10.1609/aaai.v34i06.6531","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2002.12086"}],"oa":1,"external_id":{"arxiv":["2002.12086"]},"quality_controlled":"1","project":[{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"month":"04","publication_identifier":{"issn":["2374-3468"]}},{"_id":"15082","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. 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 734922.","title":"Disjoint tree-compatible plane perfect matchings","status":"public","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"author":[{"first_name":"Oswin","last_name":"Aichholzer","full_name":"Aichholzer, Oswin"},{"last_name":"Obmann","first_name":"Julia","full_name":"Obmann, Julia"},{"last_name":"Patak","first_name":"Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83","full_name":"Patak, Pavel"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"}],"date_updated":"2024-03-05T09:00:07Z","date_created":"2024-03-05T08:57:17Z","oa_version":"Published Version","article_number":"56","type":"conference","abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"publication":"36th European Workshop on Computational Geometry","main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"oa":1,"citation":{"ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020.","ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020."},"quality_controlled":"1","conference":{"name":"EuroCG: European Workshop on Computational Geometry","end_date":"2020-03-18","start_date":"2020-03-16","location":"Würzburg, Germany, Virtual"},"date_published":"2020-04-01T00:00:00Z","language":[{"iso":"eng"}],"month":"04","day":"01","article_processing_charge":"No"},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries.\r\nIn this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques."}],"intvolume":" 12075","title":"Optimal and perfectly parallel algorithms for on-demand data-flow analysis","ddc":["000"],"status":"public","_id":"7810","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"access_level":"open_access","file_name":"2020_LNCS_Chatterjee.pdf","creator":"dernst","file_size":651250,"content_type":"application/pdf","file_id":"7895","relation":"main_file","checksum":"8618b80f4cf7b39a60e61a6445ad9807","date_created":"2020-05-26T13:34:48Z","date_updated":"2020-07-14T12:48:03Z"}],"oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"18","page":"112-140","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.","mla":"Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-44914-8_5","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In: European Symposium on Programming. Vol 12075. Springer Nature; 2020:112-140. doi:10.1007/978-3-030-44914-8_5"},"publication":"European Symposium on Programming","date_published":"2020-04-18T00:00:00Z","file_date_updated":"2020-07-14T12:48:03Z","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2020","volume":12075,"date_created":"2020-05-10T22:00:50Z","date_updated":"2024-03-28T23:30:34Z","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"}],"publication_identifier":{"eissn":["16113349"],"isbn":["9783030449131"],"issn":["03029743"]},"month":"04","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000681656800005"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-44914-8_5","conference":{"name":"ESOP: Programming Languages and Systems","start_date":"2020-04-25","location":"Dublin, Ireland","end_date":"2020-04-30"}},{"oa_version":"Submitted Version","file":[{"file_id":"8729","relation":"main_file","date_created":"2020-11-06T07:41:03Z","date_updated":"2020-11-06T07:41:03Z","success":1,"checksum":"ae83f27e5b189d5abc2e7514f1b7e1b5","file_name":"2020_LNCS_ATVA_Asadi_accepted.pdf","access_level":"open_access","creator":"dernst","file_size":726648,"content_type":"application/pdf"}],"_id":"8728","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 12302","ddc":["000"],"status":"public","title":"Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth","abstract":[{"text":"Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many techniques for computing these objectives in general MCs/MDPs, they have not been thoroughly studied in terms of parameterized algorithms, particularly when treewidth is used as the parameter. This is in sharp contrast to qualitative objectives for MCs, MDPs and graph games, for which treewidth-based algorithms yield significant complexity improvements. In this work, we show that treewidth can also be used to obtain faster algorithms for the quantitative problems. For an MC with n states and m transitions, we show that each of the classical quantitative objectives can be computed in O((n+m)⋅t2) time, given a tree decomposition of the MC with width t. Our results also imply a bound of O(κ⋅(n+m)⋅t2) for each objective on MDPs, where κ is the number of strategy-iteration refinements required for the given input and objective. Finally, we make an experimental evaluation of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms outperform existing well-established methods by one or more orders of magnitude.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"date_published":"2020-10-12T00:00:00Z","citation":{"chicago":"Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14.","mla":"Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.","short":"A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis, in:, Automated Technology for Verification and Analysis, Springer Nature, 2020, pp. 253–270.","ista":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.","ieee":"A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.","apa":"Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14","ama":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: Automated Technology for Verification and Analysis. Vol 12302. Springer Nature; 2020:253-270. doi:10.1007/978-3-030-59152-6_14"},"publication":"Automated Technology for Verification and Analysis","page":"253-270","has_accepted_license":"1","article_processing_charge":"No","day":"12","scopus_import":"1","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"author":[{"last_name":"Asadi","first_name":"Ali","full_name":"Asadi, Ali"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Mohammadi","first_name":"Kiarash","full_name":"Mohammadi, Kiarash"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"volume":12302,"date_updated":"2024-03-28T23:30:34Z","date_created":"2020-11-06T07:30:05Z","year":"2020","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","file_date_updated":"2020-11-06T07:41:03Z","doi":"10.1007/978-3-030-59152-6_14","conference":{"end_date":"2020-10-23","start_date":"2020-10-19","location":"Hanoi, Vietnam","name":"ATVA: Automated Technology for Verification and Analysis"},"language":[{"iso":"eng"}],"external_id":{"isi":["000723555700014"]},"oa":1,"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"publication_identifier":{"isbn":["9783030591519"],"eissn":["1611-3349"],"eisbn":["9783030591526"],"issn":["0302-9743"]},"month":"10"},{"publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2020","date_updated":"2024-03-28T23:30:34Z","date_created":"2020-07-05T22:00:45Z","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar"},{"last_name":"Goharshady","first_name":"Ehsan Kafshdar","full_name":"Goharshady, Ehsan Kafshdar"}],"publication_identifier":{"isbn":["9781450376136"]},"month":"06","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000614622300045"],"arxiv":["1902.04373"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.04373"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3385412.3385969","conference":{"end_date":"2020-06-20","start_date":"2020-06-15","location":"London, United Kingdom","name":"PLDI: Programming Language Design and Implementation"},"type":"conference","abstract":[{"lang":"eng","text":"We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize positive polynomials over a semi-algebraic set.\r\n\r\nOn the theoretical side, the worst-case complexity of our approach is subexponential, whereas the worst-case complexity of the previous complete method (Kapur, ACA 2004) is doubly-exponential. Even when restricted to linear invariants, the best previous complexity for complete invariant generation is exponential (Colon et al, CAV 2003). On the practical side, we reduce the invariant generation problem to quadratic programming (QCLP), which is a classical optimization problem with many industrial solvers. We demonstrate the applicability of our approach by providing experimental results on several academic benchmarks. To the best of our knowledge, the only previous invariant generation method that provides completeness guarantees for invariants consisting of polynomial inequalities is (Kapur, ACA 2004), which relies on quantifier elimination and cannot even handle toy programs such as our running example."}],"title":"Polynomial invariant generation for non-deterministic recursive programs","status":"public","_id":"8089","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"11","page":"672-687","citation":{"ama":"Chatterjee K, Fu H, Goharshady AK, Goharshady EK. Polynomial invariant generation for non-deterministic recursive programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:672-687. doi:10.1145/3385412.3385969","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial invariant generation for non-deterministic recursive programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 672–687.","ista":"Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–687.","mla":"Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–87, doi:10.1145/3385412.3385969.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385969."},"publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","date_published":"2020-06-11T00:00:00Z"},{"intvolume":" 193","status":"public","title":"An efficient algorithm for computing network reliability in small treewidth","_id":"6918","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem."}],"article_type":"original","citation":{"ama":"Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2020;193. doi:10.1016/j.ress.2019.106665","ista":"Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.","apa":"Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665","ieee":"A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020.","mla":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.","short":"A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020).","chicago":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665."},"publication":"Reliability Engineering and System Safety","date_published":"2020-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","department":[{"_id":"KrCh"}],"publisher":"Elsevier","publication_status":"published","year":"2020","acknowledgement":"We are grateful to the anonymous reviewers for their comments, which significantly improved the present work. The research was partially supported by the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian Academy of Sciences (ÖAW).","volume":193,"date_updated":"2024-03-28T23:30:34Z","date_created":"2019-09-29T22:00:44Z","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"author":[{"first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Mohammadi","first_name":"Fatemeh","full_name":"Mohammadi, Fatemeh"}],"article_number":"106665","project":[{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.09692"}],"oa":1,"external_id":{"isi":["000501641400050"],"arxiv":["1712.09692"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.ress.2019.106665","publication_identifier":{"issn":["09518320"]},"month":"01"},{"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dvorák, Wolfgang","last_name":"Dvorák","first_name":"Wolfgang"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"date_created":"2019-09-18T08:07:58Z","date_updated":"2022-08-12T10:54:34Z","volume":140,"article_number":"7","file_date_updated":"2020-07-14T12:47:43Z","ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30"},"doi":"10.4230/LIPICS.CONCUR.2019.7","language":[{"iso":"eng"}],"month":"08","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"6887","status":"public","title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","ddc":["000"],"intvolume":" 140","file":[{"date_updated":"2020-07-14T12:47:43Z","date_created":"2019-10-01T08:20:30Z","checksum":"e1f0e4061212454574f34a1368d018ec","relation":"main_file","file_id":"6922","file_size":730112,"content_type":"application/pdf","creator":"kschuh","file_name":"2019_LIPIcs_Chatterjee.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ","lang":"eng"}],"publication":"Leibniz International Proceedings in Informatics","citation":{"apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7."},"date_published":"2019-08-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No"},{"file_date_updated":"2020-07-14T12:47:43Z","article_number":"27","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"}],"date_created":"2019-09-18T08:06:14Z","date_updated":"2021-01-12T08:09:27Z","volume":140,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"month":"08","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"doi":"10.4230/LIPICS.CONCUR.2019.27","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"abstract":[{"lang":"eng","text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. "}],"type":"conference","alternative_title":["LIPIcs"],"file":[{"checksum":"4985e26e1572d1575d64d38acabd71d6","date_created":"2019-09-27T12:09:35Z","date_updated":"2020-07-14T12:47:43Z","relation":"main_file","file_id":"6914","file_size":538120,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"oa_version":"Published Version","_id":"6885","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"Long-run average behavior of vector addition systems with states","status":"public","intvolume":" 140","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2019-08-01T00:00:00Z","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27."}},{"date_updated":"2021-01-12T08:09:28Z","date_created":"2019-09-18T08:11:43Z","volume":140,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"year":"2019","file_date_updated":"2020-07-14T12:47:43Z","article_number":"6","language":[{"iso":"eng"}],"conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","start_date":"2019-08-27","location":"Amsterdam, Netherlands"},"doi":"10.4230/LIPICS.CONCUR.2019.6","quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"08","file":[{"relation":"main_file","file_id":"6923","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","date_updated":"2020-07-14T12:47:43Z","date_created":"2019-10-01T08:49:45Z","access_level":"open_access","file_name":"2019_LIPIcs_Chatterjee.pdf","file_size":509163,"content_type":"application/pdf","creator":"kschuh"}],"oa_version":"Published Version","ddc":["000"],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","status":"public","intvolume":" 140","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6889","abstract":[{"text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2019-08-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6"},"day":"01","has_accepted_license":"1","scopus_import":1},{"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":554457,"creator":"kschuh","access_level":"open_access","file_name":"2019_LIPIcs_Avni.pdf","checksum":"6346e116a4f4ed1414174d96d2c4fbd7","date_updated":"2020-07-14T12:47:42Z","date_created":"2019-09-27T11:45:15Z","relation":"main_file","file_id":"6913"}],"_id":"6884","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Bidding mechanisms in graph games","ddc":["004"],"intvolume":" 138","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. ","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2019-08-01T00:00:00Z","citation":{"apa":"Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11","ieee":"G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.","ista":"Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.","ama":"Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11","chicago":"Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.11.","short":"G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11."},"day":"01","has_accepted_license":"1","scopus_import":1,"author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"9239"}]},"date_created":"2019-09-18T08:04:26Z","date_updated":"2023-08-07T14:08:34Z","volume":138,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:42Z","ec_funded":1,"article_number":"11","conference":{"name":"MFCS: nternational Symposium on Mathematical Foundations of Computer Science","start_date":"2019-08-26","location":"Aachen, Germany","end_date":"2019-08-30"},"doi":"10.4230/LIPICS.MFCS.2019.11","language":[{"iso":"eng"}],"external_id":{"arxiv":["1905.03835"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"month":"08"},{"author":[{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-08-24T14:42:22Z","date_created":"2019-02-10T22:59:17Z","volume":11388,"year":"2019","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"conference":{"end_date":"2019-01-15","start_date":"2019-01-13","location":"Cascais, Portugal","name":"VMCAI: Verification, Model Checking, and Abstract Interpretation"},"doi":"10.1007/978-3-030-11245-5_22","language":[{"iso":"eng"}],"external_id":{"arxiv":["1701.02944"],"isi":["000931943000022"]},"main_file_link":[{"url":"https://arxiv.org/abs/1701.02944"}],"quality_controlled":"1","isi":1,"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"month":"01","oa_version":"Preprint","_id":"5948","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"Termination of nondeterministic probabilistic programs","intvolume":" 11388","abstract":[{"lang":"eng","text":"We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs. For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination, whereas our result corrects the previous flaw and establishes completeness with a rigorous proof. Second, we present the first sound approach to establish lower bounds on expected termination time through RSMs."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2019-01-11T00:00:00Z","publication":"International Conference on Verification, Model Checking, and Abstract Interpretation","citation":{"short":"H. Fu, K. Chatterjee, in:, International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.","mla":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” International Conference on Verification, Model Checking, and Abstract Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.","chicago":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-11245-5_22.","ama":"Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. In: International Conference on Verification, Model Checking, and Abstract Interpretation. Vol 11388. Springer Nature; 2019:468-490. doi:10.1007/978-3-030-11245-5_22","ieee":"H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” in International Conference on Verification, Model Checking, and Abstract Interpretation, Cascais, Portugal, 2019, vol. 11388, pp. 468–490.","apa":"Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-11245-5_22","ista":"Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490."},"page":"468-490","day":"11","article_processing_charge":"No","scopus_import":"1"}]