[{"quality_controlled":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"     10982","external_id":{"isi":["000491469700013"]},"publist_id":"7782","abstract":[{"lang":"eng","text":"Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples."}],"date_updated":"2026-04-08T07:00:31Z","month":"07","project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"file":[{"file_name":"2018_LNCS_Chatterjee.pdf","file_id":"5737","checksum":"1a6ffa4febe8bb8ac28be3adb3eafebc","content_type":"application/pdf","creator":"dernst","date_created":"2018-12-18T08:52:38Z","access_level":"open_access","file_size":675606,"relation":"main_file","date_updated":"2020-07-14T12:44:53Z"}],"article_processing_charge":"No","doi":"10.1007/978-3-319-96142-2_13","date_published":"2018-07-18T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"acknowledgement":"Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.","ddc":["000"],"has_accepted_license":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"},{"first_name":"Simin","last_name":"Oraee","full_name":"Oraee, Simin"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","first_name":"Viktor","last_name":"Toman"}],"_id":"141","alternative_title":["LNCS"],"isi":1,"type":"conference","file_date_updated":"2020-07-14T12:44:53Z","title":"Symbolic algorithms for graphs and Markov decision processes with fairness objectives","page":"178-197","year":"2018","publication_status":"published","publisher":"Springer","conference":{"name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom","start_date":"2018-07-14","end_date":"2018-07-17"},"day":"18","scopus_import":"1","ec_funded":1,"date_created":"2018-12-11T11:44:51Z","volume":10982,"citation":{"ieee":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.","mla":"Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives</i>. Vol. 10982, Springer, 2018, pp. 178–97, doi:<a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">10.1007/978-3-319-96142-2_13</a>.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">https://doi.org/10.1007/978-3-319-96142-2_13</a>.","ista":"Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.","apa":"Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., &#38; Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">https://doi.org/10.1007/978-3-319-96142-2_13</a>","ama":"Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:<a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">10.1007/978-3-319-96142-2_13</a>","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197."}},{"title":"Efficient algorithms for asymptotic bounds on termination time in VASS","type":"conference","publisher":"IEEE","publication_status":"published","page":"185 - 194","year":"2018","scopus_import":"1","ec_funded":1,"day":"09","conference":{"end_date":"2018-07-12","location":"Oxford, United Kingdom","start_date":"2018-07-09","name":"LICS: Logic in Computer Science"},"citation":{"apa":"Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., &#38; Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. <a href=\"https://doi.org/10.1145/3209108.3209191\">https://doi.org/10.1145/3209108.3209191</a>","ista":"Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.","short":"T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194.","ama":"Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033. IEEE; 2018:185-194. doi:<a href=\"https://doi.org/10.1145/3209108.3209191\">10.1145/3209108.3209191</a>","mla":"Brázdil, Tomáš, et al. <i>Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS</i>. Vol. F138033, IEEE, 2018, pp. 185–94, doi:<a href=\"https://doi.org/10.1145/3209108.3209191\">10.1145/3209108.3209191</a>.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. <a href=\"https://doi.org/10.1145/3209108.3209191\">https://doi.org/10.1145/3209108.3209191</a>.","ieee":"T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194."},"volume":"F138033","date_created":"2018-12-11T11:44:51Z","main_file_link":[{"url":"https://arxiv.org/abs/1804.10985","open_access":"1"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","arxiv":1,"oa_version":"Preprint","quality_controlled":"1","month":"07","date_updated":"2025-06-04T08:04:55Z","abstract":[{"lang":"eng","text":"Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. We also show that if the complexity of a VASS is not linear, it is at least quadratic. Second, we classify VASS according to quantitative properties of their cycles. We show that certain singularities in these properties are the key reason for non-polynomial asymptotic complexity of VASS. In absence of singularities, we show that the asymptotic complexity is always polynomial and of the form Θ(nk), for some integer k d, where d is the dimension of the VASS. We present a polynomial-time algorithm computing the optimal k. For general VASS, the same algorithm, which is based on a complete technique for the construction of ranking functions in VASS, produces a valid lower bound, i.e., a k such that the termination complexity is (nk). Our results are based on new insights into the geometry of VASS dynamics, which hold the potential for further applicability to VASS analysis."}],"publist_id":"7780","external_id":{"isi":["000545262800020"],"arxiv":["1804.10985"]},"language":[{"iso":"eng"}],"date_published":"2018-07-09T00:00:00Z","department":[{"_id":"KrCh"}],"doi":"10.1145/3209108.3209191","article_processing_charge":"No","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"}],"isi":1,"alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"_id":"143","author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Kučera, Antonín","first_name":"Antonín","last_name":"Kučera"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"},{"last_name":"Velan","first_name":"Dominik","full_name":"Velan, Dominik"},{"last_name":"Zuleger","first_name":"Florian","full_name":"Zuleger, Florian"}],"publication_identifier":{"isbn":["978-1-4503-5583-4"]}},{"quality_controlled":"1","oa_version":"Submitted Version","status":"public","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/engineering-cooperation/"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"intvolume":"       559","publist_id":"7764","external_id":{"isi":["000438240900054"]},"date_updated":"2025-04-15T06:30:08Z","abstract":[{"lang":"eng","text":"Social dilemmas occur when incentives for individuals are misaligned with group interests 1-7 . According to the 'tragedy of the commons', these misalignments can lead to overexploitation and collapse of public resources. The resulting behaviours can be analysed with the tools of game theory 8 . The theory of direct reciprocity 9-15 suggests that repeated interactions can alleviate such dilemmas, but previous work has assumed that the public resource remains constant over time. Here we introduce the idea that the public resource is instead changeable and depends on the strategic choices of individuals. An intuitive scenario is that cooperation increases the public resource, whereas defection decreases it. Thus, cooperation allows the possibility of playing a more valuable game with higher payoffs, whereas defection leads to a less valuable game. We analyse this idea using the theory of stochastic games 16-19 and evolutionary game theory. We find that the dependence of the public resource on previous interactions can greatly enhance the propensity for cooperation. For these results, the interaction between reciprocity and payoff feedback is crucial: neither repeated interactions in a constant environment nor single interactions in a changing environment yield similar cooperation rates. Our framework shows which feedbacks between exploitation and environment - either naturally occurring or designed - help to overcome social dilemmas."}],"month":"07","file":[{"creator":"dernst","date_created":"2019-11-19T08:09:57Z","access_level":"open_access","checksum":"011ab905cf9a410bc2b96f15174d654d","file_id":"7049","content_type":"application/pdf","file_size":2834442,"relation":"main_file","date_updated":"2020-07-14T12:45:02Z","file_name":"2018_Nature_Hilbe.pdf"}],"project":[{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"article_processing_charge":"No","doi":"10.1038/s41586-018-0277-x","department":[{"_id":"KrCh"}],"date_published":"2018-07-04T00:00:00Z","acknowledgement":"European Research Council Start Grant 279307, Austrian Science Fund (FWF) grant P23499-N23, \r\nC.H. acknowledges support from the ISTFELLOW programme.","language":[{"iso":"eng"}],"publication":"Nature","ddc":["000"],"has_accepted_license":"1","author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe"},{"first_name":"Štepán","last_name":"Šimsa","full_name":"Šimsa, Štepán"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"_id":"157","isi":1,"issue":"7713","type":"journal_article","title":"Evolution of cooperation in stochastic games","file_date_updated":"2020-07-14T12:45:02Z","year":"2018","page":"246 - 249","publication_status":"published","publisher":"Nature Publishing Group","day":"04","ec_funded":1,"scopus_import":"1","date_created":"2018-12-11T11:44:56Z","volume":559,"citation":{"ieee":"C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” <i>Nature</i>, vol. 559, no. 7713. Nature Publishing Group, pp. 246–249, 2018.","chicago":"Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” <i>Nature</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41586-018-0277-x\">https://doi.org/10.1038/s41586-018-0277-x</a>.","mla":"Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.” <i>Nature</i>, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:<a href=\"https://doi.org/10.1038/s41586-018-0277-x\">10.1038/s41586-018-0277-x</a>.","ama":"Hilbe C, Šimsa Š, Chatterjee K, Nowak M. Evolution of cooperation in stochastic games. <i>Nature</i>. 2018;559(7713):246-249. doi:<a href=\"https://doi.org/10.1038/s41586-018-0277-x\">10.1038/s41586-018-0277-x</a>","short":"C. Hilbe, Š. Šimsa, K. Chatterjee, M. Nowak, Nature 559 (2018) 246–249.","ista":"Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.","apa":"Hilbe, C., Šimsa, Š., Chatterjee, K., &#38; Nowak, M. (2018). Evolution of cooperation in stochastic games. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41586-018-0277-x\">https://doi.org/10.1038/s41586-018-0277-x</a>"}},{"scopus_import":"1","ec_funded":1,"pubrep_id":"964","day":"07","citation":{"mla":"Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” <i>Nature Communications</i>, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-017-02721-8\">10.1038/s41467-017-02721-8</a>.","chicago":"Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” <i>Nature Communications</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41467-017-02721-8\">https://doi.org/10.1038/s41467-017-02721-8</a>.","apa":"Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., &#38; Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-017-02721-8\">https://doi.org/10.1038/s41467-017-02721-8</a>","ista":"Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.","short":"J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications 9 (2018).","ama":"Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-017-02721-8\">10.1038/s41467-017-02721-8</a>","ieee":"J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” <i>Nature Communications</i>, vol. 9, no. 1. Nature Publishing Group, 2018."},"article_number":"555","date_created":"2018-12-11T11:46:34Z","volume":9,"type":"journal_article","file_date_updated":"2020-07-14T12:46:31Z","title":"Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness","issue":"1","publisher":"Nature Publishing Group","publication_status":"published","year":"2018","acknowledgement":"This work was supported by the European Research Council (ERC) start grant 279307: Graph Games (C.K.), Austrian Science Fund (FWF) grant no P23499-N23 (C.K.), FWF\r\nNFN grant no S11407-N23 RiSE/SHiNE (C.K.), Office of Naval Research grant N00014-16-1-2914 (M.A.N.), National Cancer Institute grant CA179991 (M.A.N.) and by the John Templeton Foundation. J.G.R. is supported by an Erwin Schrödinger fellowship\r\n(Austrian Science Fund FWF J-3996). C.H. acknowledges generous support from the\r\nISTFELLOW program. The Program for Evolutionary Dynamics is supported in part by\r\na gift from B Wu and Eric Larson.","language":[{"iso":"eng"}],"doi":"10.1038/s41467-017-02721-8","date_published":"2018-02-07T00:00:00Z","department":[{"_id":"KrCh"}],"file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:31Z","file_size":843646,"checksum":"b6b90367545b4c615891c960ab0567f1","file_id":"4741","content_type":"application/pdf","date_created":"2018-12-12T10:09:18Z","creator":"system","access_level":"open_access","file_name":"IST-2018-964-v1+1_2018_Hilbe_Crosstalk_in.pdf"}],"project":[{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","_id":"454","isi":1,"has_accepted_license":"1","author":[{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","first_name":"Johannes","last_name":"Reiter"},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian"},{"full_name":"Rand, David","last_name":"Rand","first_name":"David"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"publication":"Nature Communications","ddc":["004"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"intvolume":"         9","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","quality_controlled":"1","oa_version":"Published Version","month":"02","abstract":[{"lang":"eng","text":"Direct reciprocity is a mechanism for cooperation among humans. Many of our daily interactions are repeated. We interact repeatedly with our family, friends, colleagues, members of the local and even global community. In the theory of repeated games, it is a tacit assumption that the various games that a person plays simultaneously have no effect on each other. Here we introduce a general framework that allows us to analyze “crosstalk” between a player’s concurrent games. In the presence of crosstalk, the action a person experiences in one game can alter the person’s decision in another. We find that crosstalk impedes the maintenance of cooperation and requires stronger levels of forgiveness. The magnitude of the effect depends on the population structure. In more densely connected social groups, crosstalk has a stronger effect. A harsh retaliator, such as Tit-for-Tat, is unable to counteract crosstalk. The crosstalk framework provides a unified interpretation of direct and upstream reciprocity in the context of repeated games."}],"date_updated":"2025-04-15T06:30:05Z","publist_id":"7368","external_id":{"isi":["000424318200001"]}},{"isi":1,"alternative_title":["LNCS"],"_id":"5679","author":[{"full_name":"Huang, Mingzhang","last_name":"Huang","first_name":"Mingzhang"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"isbn":["9783030027674"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"date_published":"2018-12-01T00:00:00Z","doi":"10.1007/978-3-030-02768-1_11","article_processing_charge":"No","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"month":"12","date_updated":"2026-04-16T09:54:21Z","abstract":[{"text":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can handle. Finally, we discuss algorithmic approaches for the two above methods that lead to automated analysis techniques for almost-sure termination of probabilistic programs.","lang":"eng"}],"external_id":{"arxiv":["1806.06683"],"isi":["000916310900011"]},"intvolume":"     11275","oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","arxiv":1,"oa_version":"Preprint","quality_controlled":"1","editor":[{"last_name":"Ryu","first_name":"Sukyoung","full_name":"Ryu, Sukyoung"}],"citation":{"ista":"Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.","apa":"Huang, M., Fu, H., &#38; Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. <a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">https://doi.org/10.1007/978-3-030-02768-1_11</a>","ama":"Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:<a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">10.1007/978-3-030-02768-1_11</a>","short":"M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.","mla":"Huang, Mingzhang, et al. <i>New Approaches for Almost-Sure Termination of Probabilistic Programs</i>. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:<a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">10.1007/978-3-030-02768-1_11</a>.","chicago":"Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">https://doi.org/10.1007/978-3-030-02768-1_11</a>.","ieee":"M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201."},"volume":11275,"date_created":"2018-12-16T22:59:20Z","main_file_link":[{"url":"http://arxiv.org/abs/1806.06683","open_access":"1"}],"scopus_import":"1","day":"01","conference":{"start_date":"2018-12-02","name":"16th Asian Symposium on Programming Languages and Systems, APLAS","location":"Wellington, New Zealand","end_date":"2018-12-06"},"publisher":"Springer","page":"181-201","year":"2018","title":"New approaches for almost-sure termination of probabilistic programs","type":"conference"},{"year":"2018","publisher":"Springer Nature","publication_status":"published","issue":"1","file_date_updated":"2020-07-14T12:47:10Z","title":"Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory","type":"journal_article","volume":1,"date_created":"2018-12-18T13:22:58Z","citation":{"chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” <i>Communications Biology</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s42003-018-0078-7\">https://doi.org/10.1038/s42003-018-0078-7</a>.","mla":"Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” <i>Communications Biology</i>, vol. 1, no. 1, 71, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s42003-018-0078-7\">10.1038/s42003-018-0078-7</a>.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. <i>Communications Biology</i>. 2018;1(1). doi:<a href=\"https://doi.org/10.1038/s42003-018-0078-7\">10.1038/s42003-018-0078-7</a>","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-018-0078-7\">https://doi.org/10.1038/s42003-018-0078-7</a>","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” <i>Communications Biology</i>, vol. 1, no. 1. Springer Nature, 2018."},"article_number":"71","day":"14","ec_funded":1,"pubrep_id":"1045","scopus_import":"1","external_id":{"isi":["000461126500071"]},"month":"06","date_updated":"2026-04-08T07:24:11Z","abstract":[{"text":"Because of the intrinsic randomness of the evolutionary process, a mutant with a fitness advantage has some chance to be selected but no certainty. Any experiment that searches for advantageous mutants will lose many of them due to random drift. It is therefore of great interest to find population structures that improve the odds of advantageous mutants. Such structures are called amplifiers of natural selection: they increase the probability that advantageous mutants are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous mutants, even for very small fitness advantage. Despite intensive research over the past decade, arbitrarily strong amplifiers have remained rare. Here we show how to construct a large variety of them. Our amplifiers are so simple that they could be useful in biotechnology, when optimizing biological molecules, or as a diagnostic tool, when searching for faster dividing cells or viruses. They could also occur in natural population structures.","lang":"eng"}],"oa_version":"Published Version","quality_controlled":"1","intvolume":"         1","related_material":{"record":[{"relation":"popular_science","id":"5559","status":"public"},{"relation":"part_of_dissertation","id":"7196","status":"public"}]},"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","publication":"Communications Biology","publication_identifier":{"issn":["2399-3642"]},"ddc":["004","519","576"],"isi":1,"_id":"5751","author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"has_accepted_license":"1","article_processing_charge":"No","project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"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","call_identifier":"FWF"}],"file":[{"date_updated":"2020-07-14T12:47:10Z","relation":"main_file","file_size":1804194,"content_type":"application/pdf","checksum":"a9db825fa3b64a51ff3de035ec973b3e","file_id":"5752","access_level":"open_access","creator":"dernst","date_created":"2018-12-18T13:37:04Z","file_name":"2018_CommBiology_Pavlogiannis.pdf"}],"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"date_published":"2018-06-14T00:00:00Z","doi":"10.1038/s42003-018-0078-7"},{"edition":"1","quality_controlled":"1","editor":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Edmund M.","last_name":"Clarke","full_name":"Clarke, Edmund M."},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","title":"Graph games and reactive synthesis","status":"public","publist_id":"7995","page":"921 - 962","year":"2018","month":"05","publisher":"Springer","date_updated":"2021-01-12T08:05:10Z","abstract":[{"text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches.","lang":"eng"}],"publication_status":"published","day":"19","scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-10575-8_27","department":[{"_id":"KrCh"}],"date_published":"2018-05-19T00:00:00Z","date_created":"2018-12-11T11:44:24Z","publication_identifier":{"isbn":["978-3-319-10574-1"]},"publication":"Handbook of Model Checking","_id":"59","citation":{"ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. <i>Handbook of Model Checking</i>. 1st ed. Springer; 2018:921-962. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">10.1007/978-3-319-10575-8_27</a>","short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.","apa":"Bloem, R., Chatterjee, K., &#38; Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, &#38; R. Bloem (Eds.), <i>Handbook of Model Checking</i> (1st ed., pp. 921–962). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">https://doi.org/10.1007/978-3-319-10575-8_27</a>","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">https://doi.org/10.1007/978-3-319-10575-8_27</a>.","mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">10.1007/978-3-319-10575-8_27</a>.","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in <i>Handbook of Model Checking</i>, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962."},"author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}]},{"publication_status":"published","publisher":"ACM","year":"2018","page":"149-150","type":"conference","file_date_updated":"2020-07-14T12:47:14Z","title":"The Big Match with a clock and a bit of memory","citation":{"mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>, ACM, 2018, pp. 149–50, doi:<a href=\"https://doi.org/10.1145/3219166.3219198\">10.1145/3219166.3219198</a>.","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>, 149–50. ACM, 2018. <a href=\"https://doi.org/10.1145/3219166.3219198\">https://doi.org/10.1145/3219166.3219198</a>.","ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. EC: Conference on Economics and Computation, 149–150.","apa":"Hansen, K. A., Ibsen-Jensen, R., &#38; Neyman, A. (2018). The Big Match with a clock and a bit of memory. In <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i> (pp. 149–150). Ithaca, NY, United States: ACM. <a href=\"https://doi.org/10.1145/3219166.3219198\">https://doi.org/10.1145/3219166.3219198</a>","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM, 2018, pp. 149–150.","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>. ACM; 2018:149-150. doi:<a href=\"https://doi.org/10.1145/3219166.3219198\">10.1145/3219166.3219198</a>","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>, Ithaca, NY, United States, 2018, pp. 149–150."},"date_created":"2019-02-13T10:31:41Z","scopus_import":"1","conference":{"name":"EC: Conference on Economics and Computation","start_date":"2018-06-18","location":"Ithaca, NY, United States","end_date":"2018-06-22"},"day":"18","date_updated":"2025-05-14T11:24:35Z","abstract":[{"text":"The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n","lang":"eng"}],"month":"06","external_id":{"isi":["000492755100020"]},"status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","oa_version":"Submitted Version","has_accepted_license":"1","author":[{"full_name":"Hansen, Kristoffer Arnsfelt","last_name":"Hansen","first_name":"Kristoffer Arnsfelt"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Abraham","last_name":"Neyman","full_name":"Neyman, Abraham"}],"_id":"5967","isi":1,"publication":"Proceedings of the 2018 ACM Conference on Economics and Computation  - EC '18","ddc":["000"],"publication_identifier":{"isbn":["9781450358293"]},"doi":"10.1145/3219166.3219198","department":[{"_id":"KrCh"}],"date_published":"2018-06-18T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_name":"2018_EC18_Hansen.pdf","file_size":302539,"date_updated":"2020-07-14T12:47:14Z","relation":"main_file","file_id":"7054","checksum":"bb52683e349cfd864f4769a8f38f2798","content_type":"application/pdf","creator":"dernst","date_created":"2019-11-19T08:24:24Z","access_level":"open_access"}],"article_processing_charge":"No"},{"external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"date_updated":"2025-04-15T08:12:22Z","month":"06","quality_controlled":"1","oa_version":"Submitted Version","arxiv":1,"status":"public","related_material":{"record":[{"id":"1438","status":"public","relation":"earlier_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"        40","publication_identifier":{"issn":["0164-0925"]},"publication":"ACM Transactions on Programming Languages and Systems","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hasheminezhad, Rouzbeh","last_name":"Hasheminezhad","first_name":"Rouzbeh"}],"_id":"5993","isi":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"article_processing_charge":"No","doi":"10.1145/3174800","date_published":"2018-06-01T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"year":"2018","publication_status":"published","publisher":"Association for Computing Machinery","issue":"2","type":"journal_article","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08517"}],"date_created":"2019-02-14T12:29:10Z","volume":40,"article_number":"7","citation":{"ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3174800\">https://doi.org/10.1145/3174800</a>","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. <i>ACM Transactions on Programming Languages and Systems</i>. 2018;40(2). doi:<a href=\"https://doi.org/10.1145/3174800\">10.1145/3174800</a>","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 2, 7, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3174800\">10.1145/3174800</a>.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3174800\">https://doi.org/10.1145/3174800</a>.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 2. Association for Computing Machinery, 2018."},"day":"01","ec_funded":1,"scopus_import":"1"},{"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","language":[{"iso":"eng"}],"doi":"10.1145/3158119","department":[{"_id":"KrCh"}],"date_published":"2018-01-01T00:00:00Z","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"file":[{"checksum":"b27ab1745f6dba2387deb785798a657c","file_id":"19716","content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2025-05-20T09:44:47Z","date_updated":"2025-05-20T09:44:47Z","relation":"main_file","file_size":388891,"success":1,"file_name":"2018_ACM_Chalupa.pdf"}],"OA_place":"publisher","article_processing_charge":"No","_id":"10417","has_accepted_license":"1","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nishant","last_name":"Sinha","full_name":"Sinha, Nishant"},{"full_name":"Vaidya, Kapil","first_name":"Kapil","last_name":"Vaidya"}],"publication":"Proceedings of the ACM on Programming Languages","ddc":["000"],"publication_identifier":{"eissn":["2475-1421"]},"oa":1,"related_material":{"record":[{"status":"public","id":"5448","relation":"earlier_version"},{"status":"public","id":"5456","relation":"earlier_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         2","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","arxiv":1,"quality_controlled":"1","oa_version":"Published Version","month":"01","date_updated":"2025-05-20T09:45:10Z","abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.","lang":"eng"}],"external_id":{"arxiv":["1610.01188"]},"scopus_import":"1","ec_funded":1,"day":"01","conference":{"end_date":"2018-01-13","start_date":"2018-01-07","name":"POPL: Programming Languages","location":"Los Angeles, CA, United States"},"citation":{"chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>.","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 31, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2018).","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. 2018;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &#38; Vaidya, K. (2018). Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2018. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2018."},"OA_type":"hybrid","article_number":"31","date_created":"2021-12-05T23:01:49Z","volume":2,"type":"journal_article","file_date_updated":"2025-05-20T09:44:47Z","title":"Data-centric dynamic partial order reduction","issue":"POPL","publisher":"Association for Computing Machinery","publication_status":"published","year":"2018"},{"type":"conference","title":"Parameter-independent strategies for pMDPs via POMDPs","publisher":"Springer","publication_status":"published","page":"53-70","year":"2018","scopus_import":"1","day":"15","conference":{"end_date":"2018-09-07","start_date":"2018-09-04","location":"Beijing, China","name":"QEST: Quantitative Evaluation of Systems"},"citation":{"short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.","ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>","apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &#38; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>.","mla":"Arming, Sebastian, et al. <i>Parameter-Independent Strategies for PMDPs via POMDPs</i>. Vol. 11024, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>.","ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70."},"date_created":"2018-12-11T11:44:31Z","volume":11024,"main_file_link":[{"url":"https://arxiv.org/abs/1806.05126","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"intvolume":"     11024","status":"public","arxiv":1,"quality_controlled":"1","oa_version":"Preprint","month":"08","abstract":[{"lang":"eng","text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol."}],"date_updated":"2023-09-13T09:38:28Z","external_id":{"isi":["000548912200004"],"arxiv":["1806.05126"]},"publist_id":"7975","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-99154-2_4","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2018-08-15T00:00:00Z","article_processing_charge":"No","_id":"79","isi":1,"alternative_title":["LNCS"],"author":[{"full_name":"Arming, Sebastian","last_name":"Arming","first_name":"Sebastian"},{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P","last_name":"Katoen","first_name":"Joost P"},{"first_name":"Ana","last_name":"Sokolova","full_name":"Sokolova, Ana"}]},{"day":"20","scopus_import":1,"ec_funded":1,"volume":10760,"date_created":"2018-12-11T11:44:33Z","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in <i>Principles of Modeling</i>, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.","ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. <i>Principles of Modeling</i>. Vol 10760. Springer; 2018:143-161. doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &#38; M. Sirjani (Eds.), <i>Principles of Modeling</i> (Vol. 10760, pp. 143–161). Springer. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In <i>Principles of Modeling</i>, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>.","mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” <i>Principles of Modeling</i>, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>."},"file_date_updated":"2020-07-14T12:48:14Z","title":"Computing average response time","type":"book_chapter","year":"2018","page":"143 - 161","publication_status":"published","publisher":"Springer","file":[{"relation":"main_file","date_updated":"2020-07-14T12:48:14Z","file_size":516307,"checksum":"9995c6ce6957333baf616fc4f20be597","file_id":"7053","content_type":"application/pdf","date_created":"2019-11-19T08:22:18Z","access_level":"open_access","creator":"dernst","file_name":"2018_PrinciplesModeling_Chatterjee.pdf"}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"date_published":"2018-07-20T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"doi":"10.1007/978-3-319-95246-8_9","language":[{"iso":"eng"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","ddc":["000"],"publication":"Principles of Modeling","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","alternative_title":["LNCS"],"_id":"86","oa_version":"Submitted Version","editor":[{"first_name":"Marten","last_name":"Lohstroh","full_name":"Lohstroh, Marten"},{"full_name":"Derler, Patricia","last_name":"Derler","first_name":"Patricia"},{"full_name":"Sirjani, Marjan","last_name":"Sirjani","first_name":"Marjan"}],"quality_controlled":"1","status":"public","intvolume":"     10760","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publist_id":"7968","date_updated":"2025-04-15T06:26:15Z","abstract":[{"text":"Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.","lang":"eng"}],"month":"07"},{"citation":{"mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” <i>Real-Time Systems</i>, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:<a href=\"https://doi.org/10.1007/s11241-017-9293-4\">10.1007/s11241-017-9293-4</a>.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” <i>Real-Time Systems</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s11241-017-9293-4\">https://doi.org/10.1007/s11241-017-9293-4</a>.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., &#38; Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. <i>Real-Time Systems</i>. Springer. <a href=\"https://doi.org/10.1007/s11241-017-9293-4\">https://doi.org/10.1007/s11241-017-9293-4</a>","ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. <i>Real-Time Systems</i>. 2018;54(1):166-207. doi:<a href=\"https://doi.org/10.1007/s11241-017-9293-4\">10.1007/s11241-017-9293-4</a>","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” <i>Real-Time Systems</i>, vol. 54, no. 1. Springer, pp. 166–207, 2018."},"date_created":"2018-12-11T11:48:14Z","volume":54,"pubrep_id":"960","scopus_import":"1","ec_funded":1,"day":"01","publisher":"Springer","publication_status":"published","corr_author":"1","page":"166 - 207","year":"2018","type":"journal_article","title":"Automated competitive analysis of real time scheduling with graph games","file_date_updated":"2020-07-14T12:47:56Z","issue":"1","_id":"738","isi":1,"has_accepted_license":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kößler","first_name":"Alexander","full_name":"Kößler, Alexander"},{"full_name":"Schmid, Ulrich","first_name":"Ulrich","last_name":"Schmid"}],"publication":"Real-Time Systems","ddc":["000"],"language":[{"iso":"eng"}],"doi":"10.1007/s11241-017-9293-4","date_published":"2018-01-01T00:00:00Z","department":[{"_id":"KrCh"}],"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"file":[{"file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","file_size":1163507,"date_updated":"2020-07-14T12:47:56Z","relation":"main_file","content_type":"application/pdf","checksum":"c2590ef160709d8054cf29ee173f1454","file_id":"5267","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:17:14Z"}],"article_processing_charge":"No","month":"01","abstract":[{"text":"This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ","lang":"eng"}],"date_updated":"2025-04-15T08:12:27Z","publist_id":"6929","external_id":{"isi":["000419955500006"]},"related_material":{"record":[{"relation":"earlier_version","id":"2820","status":"public"}]},"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"        54","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","quality_controlled":"1","oa_version":"Published Version"},{"day":"01","conference":{"end_date":"2018-01-10","location":"New Orleans, Louisiana, United States","name":"SODA: Symposium on Discrete Algorithms","start_date":"2018-01-07"},"ec_funded":1,"scopus_import":"1","date_created":"2018-12-11T11:45:45Z","main_file_link":[{"url":"https://arxiv.org/abs/1711.09148","open_access":"1"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter</i>. ACM, 2018, pp. 2341–56, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.151\">10.1137/1.9781611975031.151</a>.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.151\">https://doi.org/10.1137/1.9781611975031.151</a>.","ista":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., &#38; Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. <a href=\"https://doi.org/10.1137/1.9781611975031.151\">https://doi.org/10.1137/1.9781611975031.151</a>","ama":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. In: ACM; 2018:2341-2356. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.151\">10.1137/1.9781611975031.151</a>","short":"K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356.","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356."},"type":"conference","title":"Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter","page":"2341 - 2356","year":"2018","publisher":"ACM","publication_status":"published","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1137/1.9781611975031.151","department":[{"_id":"KrCh"}],"date_published":"2018-01-01T00:00:00Z","_id":"310","isi":1,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"arxiv":1,"quality_controlled":"1","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"status":"public","publist_id":"7555","external_id":{"arxiv":["1711.09148"],"isi":["000483921200152"]},"month":"01","date_updated":"2025-04-14T13:51:04Z","abstract":[{"text":"A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and coliveness. Our lower bounds are linear in the number of vertices of the graph, even for constant-diameter graphs. For none of these problems lower bounds on the number of symbolic operations were known before. The lower bounds show an interesting separation of these problems from the reachability problem, which can be solved with O(D) symbolic operations, where D is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires Õ(n/D) symbolic steps to achieve a (1 +ϵ)-approximation for any constant &gt; 0. This compares to O(n/D) symbolic steps for the (naive) exact algorithm and O(D) symbolic steps for a 2-approximation. Finally we also give a refined analysis of the strongly connected components algorithms of [15], showing that it uses an optimal number of symbolic steps that is proportional to the sum of the diameters of the strongly connected components.","lang":"eng"}]},{"publist_id":"7540","external_id":{"arxiv":["1709.04037"]},"date_updated":"2024-10-21T06:02:40Z","abstract":[{"text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.","lang":"eng"}],"month":"01","quality_controlled":"1","oa_version":"Preprint","arxiv":1,"status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         2","author":[{"last_name":"Agrawal","first_name":"Sheshansh","full_name":"Agrawal, Sheshansh"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"}],"_id":"325","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/3158122","date_published":"2018-01-01T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"year":"2018","publication_status":"published","publisher":"ACM","issue":"POPL","type":"conference","title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","main_file_link":[{"url":"https://arxiv.org/abs/1709.04037","open_access":"1"}],"date_created":"2018-12-11T11:45:50Z","volume":2,"citation":{"ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.","apa":"Agrawal, S., Chatterjee, K., &#38; Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. <a href=\"https://doi.org/10.1145/3158122\">https://doi.org/10.1145/3158122</a>","short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3158122\">10.1145/3158122</a>","mla":"Agrawal, Sheshansh, et al. <i>Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs</i>. Vol. 2, no. POPL, 34, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3158122\">10.1145/3158122</a>.","chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. <a href=\"https://doi.org/10.1145/3158122\">https://doi.org/10.1145/3158122</a>.","ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL."},"article_number":"34","conference":{"end_date":"2018-01-13","name":"POPL: Principles of Programming Languages","location":"Los Angeles, CA, USA","start_date":"2018-01-07"},"day":"01","scopus_import":"1"},{"oa_version":"Submitted Version","quality_controlled":"1","status":"public","article_type":"review","intvolume":"         2","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"link":[{"url":"http://doi.org/10.1038/s41562-018-0342-3","relation":"erratum"}]},"external_id":{"isi":["000446612000016"]},"publist_id":"7404","date_updated":"2025-04-15T06:50:00Z","abstract":[{"lang":"eng","text":"Reciprocity is a major factor in human social life and accounts for a large part of cooperation in our communities. Direct reciprocity arises when repeated interactions occur between the same individuals. The framework of iterated games formalizes this phenomenon. Despite being introduced more than five decades ago, the concept keeps offering beautiful surprises. Recent theoretical research driven by new mathematical tools has proposed a remarkable dichotomy among the crucial strategies: successful individuals either act as partners or as rivals. Rivals strive for unilateral advantages by applying selfish or extortionate strategies. Partners aim to share the payoff for mutual cooperation, but are ready to fight back when being exploited. Which of these behaviours evolves depends on the environment. Whereas small population sizes and a limited number of rounds favour rivalry, partner strategies are selected when populations are large and relationships stable. Only partners allow for evolution of cooperation, while the rivals’ attempt to put themselves first leads to defection. Hilbe et al. synthesize recent theoretical work on zero-determinant and ‘rival’ versus ‘partner’ strategies in social dilemmas. They describe the environments under which these contrasting selfish or cooperative strategies emerge in evolution."}],"month":"03","article_processing_charge":"No","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"file":[{"file_name":"2018_NatureHumanBeh_Hilbe.pdf","content_type":"application/pdf","file_id":"7052","checksum":"571b8cc0ba14e8d5d8b18e439a9835eb","access_level":"open_access","creator":"dernst","date_created":"2019-11-19T08:19:51Z","file_size":598033,"relation":"main_file","date_updated":"2020-07-14T12:46:25Z"}],"date_published":"2018-03-19T00:00:00Z","department":[{"_id":"KrCh"}],"doi":"10.1038/s41562-018-0320-9","language":[{"iso":"eng"}],"publication":"Nature Human Behaviour","ddc":["000"],"author":[{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","first_name":"Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"has_accepted_license":"1","isi":1,"_id":"419","title":"Partners and rivals in direct reciprocity","file_date_updated":"2020-07-14T12:46:25Z","type":"journal_article","page":"469–477","year":"2018","corr_author":"1","publication_status":"published","publisher":"Nature Publishing Group","day":"19","scopus_import":"1","ec_funded":1,"volume":2,"date_created":"2018-12-11T11:46:22Z","citation":{"ista":"Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477.","apa":"Hilbe, C., Chatterjee, K., &#38; Nowak, M. (2018). Partners and rivals in direct reciprocity. <i>Nature Human Behaviour</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41562-018-0320-9\">https://doi.org/10.1038/s41562-018-0320-9</a>","short":"C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477.","ama":"Hilbe C, Chatterjee K, Nowak M. Partners and rivals in direct reciprocity. <i>Nature Human Behaviour</i>. 2018;2:469–477. doi:<a href=\"https://doi.org/10.1038/s41562-018-0320-9\">10.1038/s41562-018-0320-9</a>","mla":"Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.” <i>Nature Human Behaviour</i>, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:<a href=\"https://doi.org/10.1038/s41562-018-0320-9\">10.1038/s41562-018-0320-9</a>.","chicago":"Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” <i>Nature Human Behaviour</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41562-018-0320-9\">https://doi.org/10.1038/s41562-018-0320-9</a>.","ieee":"C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” <i>Nature Human Behaviour</i>, vol. 2. Nature Publishing Group, pp. 469–477, 2018."}},{"month":"06","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies."}],"date_updated":"2026-07-07T13:35:51Z","external_id":{"arxiv":["1710.00675"],"isi":["000492986200006"]},"publist_id":"8021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"      2018","status":"public","arxiv":1,"quality_controlled":"1","oa_version":"Preprint","_id":"34","isi":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chemlík","first_name":"Martin","full_name":"Chemlík, Martin"},{"first_name":"Ufuk","last_name":"Topcu","full_name":"Topcu, Ufuk"}],"publication":"28th International Conference on Automated Planning and Scheduling","language":[{"iso":"eng"}],"doi":"10.1609/icaps.v28i1.13875","date_published":"2018-06-01T00:00:00Z","department":[{"_id":"KrCh"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","publisher":"AAAI Press","publication_status":"published","year":"2018","page":"47 - 55","type":"conference","title":"Sensor synthesis for POMDPs with reachability objectives","citation":{"apa":"Chatterjee, K., Chemlík, M., &#38; Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives. In <i>28th International Conference on Automated Planning and Scheduling</i> (Vol. 2018, pp. 47–55). Delft, Netherlands: AAAI Press. <a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">https://doi.org/10.1609/icaps.v28i1.13875</a>","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2018, 47–55.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018, pp. 47–55.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: <i>28th International Conference on Automated Planning and Scheduling</i>. Vol 2018. AAAI Press; 2018:47-55. doi:<a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">10.1609/icaps.v28i1.13875</a>","mla":"Chatterjee, Krishnendu, et al. “Sensor Synthesis for POMDPs with Reachability Objectives.” <i>28th International Conference on Automated Planning and Scheduling</i>, vol. 2018, AAAI Press, 2018, pp. 47–55, doi:<a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">10.1609/icaps.v28i1.13875</a>.","chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives.” In <i>28th International Conference on Automated Planning and Scheduling</i>, 2018:47–55. AAAI Press, 2018. <a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">https://doi.org/10.1609/icaps.v28i1.13875</a>.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” in <i>28th International Conference on Automated Planning and Scheduling</i>, Delft, Netherlands, 2018, vol. 2018, pp. 47–55."},"date_created":"2018-12-11T11:44:16Z","volume":2018,"main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"das_tickbox":"1","scopus_import":"1","ec_funded":1,"day":"01","conference":{"end_date":"2018-06-29","name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2018-06-24","location":"Delft, Netherlands"}},{"das_tickbox":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"date_created":"2018-12-11T11:44:17Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>28th International Conference on Automated Planning and Scheduling</i>, AAAI Press, 2018.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In <i>28th International Conference on Automated Planning and Scheduling</i>. AAAI Press, 2018.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., &#38; Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In <i>28th International Conference on Automated Planning and Scheduling</i>. Delft, Netherlands: AAAI Press.","ista":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling.","ama":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. In: <i>28th International Conference on Automated Planning and Scheduling</i>. AAAI Press; 2018.","short":"K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018.","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in <i>28th International Conference on Automated Planning and Scheduling</i>, Delft, Netherlands, 2018."},"conference":{"start_date":"2018-06-24","name":"ICAPS: International Conference on Automated Planning and Scheduling","location":"Delft, Netherlands","end_date":"2018-06-29"},"day":"01","scopus_import":"1","ec_funded":1,"year":"2018","publication_status":"published","publisher":"AAAI Press","title":"Algorithms and conditional lower bounds for planning problems","type":"conference","publication":"28th International Conference on Automated Planning and Scheduling","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"isi":1,"_id":"35","article_processing_charge":"No","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"date_published":"2018-06-01T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publist_id":"8020","external_id":{"isi":["000492986200007"],"arxiv":["1804.07031"]},"date_updated":"2026-07-07T13:36:04Z","abstract":[{"text":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. 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 where there are k different target sets, and the problems are as follows: (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 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 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) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.","lang":"eng"}],"month":"06","oa_version":"Preprint","quality_controlled":"1","arxiv":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"related_material":{"record":[{"status":"public","id":"9293","relation":"later_version"}]}},{"month":"03","abstract":[{"text":"We consider a class of students learning a language from a teacher. The situation can be interpreted as a group of child learners receiving input from the linguistic environment. The teacher provides sample sentences. The students try to learn the grammar from the teacher. In addition to just listening to the teacher, the students can also communicate with each other. The students hold hypotheses about the grammar and change them if they receive counter evidence. The process stops when all students have converged to the correct grammar. We study how the time to convergence depends on the structure of the classroom by introducing and evaluating various complexity measures. We find that structured communication between students, although potentially introducing confusion, can greatly reduce some of the complexity measures. Our theory can also be interpreted as applying to the scientific process, where nature is the teacher and the scientists are the students.","lang":"eng"}],"date_updated":"2026-08-12T14:08:29Z","publist_id":"7715","external_id":{"pmid":["29593089"],"isi":["000428576200023"]},"intvolume":"        15","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971","relation":"supplementary_material"}],"record":[{"relation":"research_data","status":"public","id":"9814"}]},"oa":1,"status":"public","article_type":"original","oa_version":"Submitted Version","quality_controlled":"1","isi":1,"_id":"198","author":[{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"has_accepted_license":"1","publication_identifier":{"eissn":["1742-5662"]},"publication":"Journal of the Royal Society Interface","ddc":["000"],"language":[{"iso":"eng"}],"date_published":"2018-03-01T00:00:00Z","department":[{"_id":"KrCh"}],"doi":"10.1098/rsif.2018.0073","article_processing_charge":"No","file":[{"file_size":219837,"date_updated":"2020-07-14T12:45:22Z","relation":"main_file","file_id":"5955","checksum":"444e1a9d98eb0e780671be82b13025f3","content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_created":"2019-02-12T07:54:37Z","file_name":"2018_RS_IbsenJensen.pdf"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"publisher":"Royal Society","publication_status":"published","year":"2018","title":"Language acquisition with communication between learners","file_date_updated":"2020-07-14T12:45:22Z","type":"journal_article","issue":"140","article_number":"20180073","citation":{"ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” <i>Journal of the Royal Society Interface</i>, vol. 15, no. 140. Royal Society, 2018.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” <i>Journal of the Royal Society Interface</i>. Royal Society, 2018. <a href=\"https://doi.org/10.1098/rsif.2018.0073\">https://doi.org/10.1098/rsif.2018.0073</a>.","mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” <i>Journal of the Royal Society Interface</i>, vol. 15, no. 140, 20180073, Royal Society, 2018, doi:<a href=\"https://doi.org/10.1098/rsif.2018.0073\">10.1098/rsif.2018.0073</a>.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. <i>Journal of the Royal Society Interface</i>. 2018;15(140). doi:<a href=\"https://doi.org/10.1098/rsif.2018.0073\">10.1098/rsif.2018.0073</a>","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018). Language acquisition with communication between learners. <i>Journal of the Royal Society Interface</i>. Royal Society. <a href=\"https://doi.org/10.1098/rsif.2018.0073\">https://doi.org/10.1098/rsif.2018.0073</a>"},"volume":15,"date_created":"2018-12-11T11:45:09Z","scopus_import":"1","ec_funded":1,"day":"01"},{"page":"12241-12246","year":"2018","publication_status":"published","publisher":"National Academy of Sciences","issue":"48","title":"Indirect reciprocity with private, noisy, and incomplete information","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30429320"}],"volume":115,"date_created":"2018-12-11T11:44:05Z","citation":{"ieee":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” <i>PNAS</i>, vol. 115, no. 48. National Academy of Sciences, pp. 12241–12246, 2018.","chicago":"Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1810565115\">https://doi.org/10.1073/pnas.1810565115</a>.","mla":"Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” <i>PNAS</i>, vol. 115, no. 48, National Academy of Sciences, 2018, pp. 12241–46, doi:<a href=\"https://doi.org/10.1073/pnas.1810565115\">10.1073/pnas.1810565115</a>.","short":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018) 12241–12246.","ama":"Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. Indirect reciprocity with private, noisy, and incomplete information. <i>PNAS</i>. 2018;115(48):12241-12246. doi:<a href=\"https://doi.org/10.1073/pnas.1810565115\">10.1073/pnas.1810565115</a>","ista":"Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity with private, noisy, and incomplete information. PNAS. 115(48), 12241–12246.","apa":"Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1810565115\">https://doi.org/10.1073/pnas.1810565115</a>"},"day":"27","scopus_import":"1","ec_funded":1,"external_id":{"pmid":["30429320"],"isi":["000451351000063"]},"date_updated":"2026-08-29T22:30:49Z","abstract":[{"text":"Indirect reciprocity explores how humans act when their reputation is at stake, and which social norms they use to assess the actions of others. A crucial question in indirect reciprocity is which social norms can maintain stable cooperation in a society. Past research has highlighted eight such norms, called “leading-eight” strategies. This past research, however, is based on the assumption that all relevant information about other population members is publicly available and that everyone agrees on who is good or bad. Instead, here we explore the reputation dynamics when information is private and noisy. We show that under these conditions, most leading-eight strategies fail to evolve. Those leading-eight strategies that do evolve are unable to sustain full cooperation.Indirect reciprocity is a mechanism for cooperation based on shared moral systems and individual reputations. It assumes that members of a community routinely observe and assess each other and that they use this information to decide who is good or bad, and who deserves cooperation. When information is transmitted publicly, such that all community members agree on each other’s reputation, previous research has highlighted eight crucial moral systems. These “leading-eight” strategies can maintain cooperation and resist invasion by defectors. However, in real populations individuals often hold their own private views of others. Once two individuals disagree about their opinion of some third party, they may also see its subsequent actions in a different light. Their opinions may further diverge over time. Herein, we explore indirect reciprocity when information transmission is private and noisy. We find that in the presence of perception errors, most leading-eight strategies cease to be stable. Even if a leading-eight strategy evolves, cooperation rates may drop considerably when errors are common. Our research highlights the role of reliable information and synchronized reputations to maintain stable moral systems.","lang":"eng"}],"month":"11","oa_version":"Submitted Version","quality_controlled":"1","status":"public","intvolume":"       115","pmid":1,"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"link":[{"url":"https://ist.ac.at/en/news/no-cooperation-without-open-communication/","description":"News on IST Homepage","relation":"press_release"}],"record":[{"relation":"dissertation_contains","status":"public","id":"10293"}]},"publication":"PNAS","author":[{"orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","last_name":"Schmid","orcid":"0000-0002-6978-7329","full_name":"Schmid, Laura"},{"first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"isi":1,"_id":"2","article_processing_charge":"No","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"date_published":"2018-11-27T00:00:00Z","department":[{"_id":"KrCh"}],"doi":"10.1073/pnas.1810565115","language":[{"iso":"eng"}]}]