[{"file_date_updated":"2020-07-14T12:47:14Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-09-19T10:45:15Z","status":"public","type":"conference","conference":{"start_date":"2018-06-18","location":"Ithaca, NY, United States","end_date":"2018-06-22","name":"EC: Conference on Economics and Computation"},"_id":"5967","file":[{"file_size":302539,"date_updated":"2020-07-14T12:47:14Z","creator":"dernst","file_name":"2018_EC18_Hansen.pdf","date_created":"2019-11-19T08:24:24Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"7054","checksum":"bb52683e349cfd864f4769a8f38f2798"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450358293"]},"publication_status":"published","month":"06","scopus_import":"1","oa_version":"Submitted Version","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"}],"title":"The Big Match with a clock and a bit of memory","author":[{"full_name":"Hansen, Kristoffer Arnsfelt","last_name":"Hansen","first_name":"Kristoffer Arnsfelt"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Neyman","full_name":"Neyman, Abraham","first_name":"Abraham"}],"external_id":{"isi":["000492755100020"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.","apa":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198."},"doi":"10.1145/3219166.3219198","date_published":"2018-06-18T00:00:00Z","date_created":"2019-02-13T10:31:41Z","page":"149-150","day":"18","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","isi":1,"has_accepted_license":"1","year":"2018","quality_controlled":"1","publisher":"ACM Press","oa":1},{"intvolume":" 40","month":"06","main_file_link":[{"url":"https://arxiv.org/abs/1510.08517","open_access":"1"}],"scopus_import":"1","oa_version":"Submitted Version","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."}],"ec_funded":1,"related_material":{"record":[{"id":"1438","status":"public","relation":"earlier_version"}]},"volume":40,"issue":"2","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0164-0925"]},"status":"public","type":"journal_article","_id":"5993","department":[{"_id":"KrCh"}],"date_updated":"2023-09-19T14:38:42Z","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery (ACM)","date_created":"2019-02-14T12:29:10Z","doi":"10.1145/3174800","date_published":"2018-06-01T00:00:00Z","publication":"ACM Transactions on Programming Languages and Systems","day":"01","year":"2018","isi":1,"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"article_number":"7","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","external_id":{"isi":["000434634500003"],"arxiv":["1510.08517"]},"article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Fu, Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei"},{"first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr","last_name":"Novotný"},{"first_name":"Rouzbeh","last_name":"Hasheminezhad","full_name":"Hasheminezhad, Rouzbeh"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.","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. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800","apa":"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. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.","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."}},{"author":[{"last_name":"Horák","full_name":"Horák, Karel","first_name":"Karel"},{"last_name":"Bošanský","full_name":"Bošanský, Branislav","first_name":"Branislav"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"}],"publist_id":"8030","article_processing_charge":"No","external_id":{"isi":["000764175404127"]},"title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","citation":{"short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","apa":"Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.","ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"page":"4764 - 4770","doi":"10.24963/ijcai.2018/662","date_published":"2018-07-01T00:00:00Z","date_created":"2018-12-11T11:44:13Z","isi":1,"year":"2018","day":"01","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","quality_controlled":"1","publisher":"IJCAI","oa":1,"acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","department":[{"_id":"KrCh"}],"date_updated":"2023-09-19T14:44:59Z","type":"conference","conference":{"end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"status":"public","_id":"25","volume":"2018-July","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2018/662"}],"month":"07","abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples.","lang":"eng"}],"oa_version":"Published Version"},{"abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"month":"07","intvolume":" 2018","publication_status":"published","language":[{"iso":"eng"}],"volume":2018,"ec_funded":1,"_id":"24","type":"conference","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","location":"Stockholm, Sweden","end_date":"2018-07-19","start_date":"2018-07-13"},"status":"public","date_updated":"2023-09-19T14:45:48Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","quality_controlled":"1","publisher":"IJCAI","oa":1,"isi":1,"year":"2018","day":"01","page":"4692 - 4699","doi":"10.24963/ijcai.2018/652","date_published":"2018-07-01T00:00:00Z","date_created":"2018-12-11T11:44:13Z","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"8031","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Elgyütt","full_name":"Elgyütt, Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"last_name":"Novotny","full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Owen","full_name":"Rouillé, Owen","last_name":"Rouillé"}],"external_id":{"arxiv":["1804.10601"],"isi":["000764175404117"]},"article_processing_charge":"No","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives"},{"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.","apa":"Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55.","mla":"Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.","chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"8021","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Chemlík, Martin","last_name":"Chemlík","first_name":"Martin"},{"first_name":"Ufuk","full_name":"Topcu, Ufuk","last_name":"Topcu"}],"article_processing_charge":"No","external_id":{"arxiv":["1710.00675"],"isi":["000492986200006"]},"title":"Sensor synthesis for POMDPs with reachability objectives","publisher":"AAAI Press","quality_controlled":"1","oa":1,"isi":1,"year":"2018","day":"01","page":"47 - 55","date_published":"2018-06-01T00:00:00Z","date_created":"2018-12-11T11:44:16Z","_id":"34","type":"conference","conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2018-06-24","end_date":"2018-06-29","location":"Delft, Netherlands"},"status":"public","date_updated":"2023-09-19T14:44:14Z","department":[{"_id":"KrCh"}],"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."}],"oa_version":"Preprint","alternative_title":["ICAPS"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1710.00675"}],"month":"06","intvolume":" 2018","publication_status":"published","language":[{"iso":"eng"}],"volume":2018,"ec_funded":1},{"date_published":"2018-06-01T00:00:00Z","date_created":"2018-12-11T11:44:17Z","day":"01","publication":"28th International Conference on Automated Planning and Scheduling ","isi":1,"year":"2018","quality_controlled":"1","publisher":"AAAI Press","oa":1,"title":"Algorithms and conditional lower bounds for planning problems","publist_id":"8020","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"external_id":{"isi":["000492986200007"],"arxiv":["1804.07031"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.","ista":"Chatterjee K, Dvorák W, Henzinger MH, 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.","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018."},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"related_material":{"record":[{"relation":"later_version","id":"9293","status":"public"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"06","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.07031","open_access":"1"}],"oa_version":"None","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"}],"department":[{"_id":"KrCh"}],"date_updated":"2023-09-26T10:41:41Z","status":"public","type":"conference","conference":{"start_date":"2018-06-24","location":"Delft, Netherlands","end_date":"2018-06-29","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"_id":"35"},{"abstract":[{"lang":"eng","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. "}],"oa_version":"Published Version","scopus_import":"1","month":"01","intvolume":" 54","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"c2590ef160709d8054cf29ee173f1454","file_id":"5267","creator":"system","file_size":1163507,"date_updated":"2020-07-14T12:47:56Z","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","date_created":"2018-12-12T10:17:14Z"}],"language":[{"iso":"eng"}],"volume":54,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2820"}]},"issue":"1","ec_funded":1,"_id":"738","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"960","date_updated":"2023-09-27T12:52:38Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:56Z","publisher":"Springer","quality_controlled":"1","oa":1,"has_accepted_license":"1","isi":1,"year":"2018","day":"01","publication":"Real-Time Systems","page":"166 - 207","doi":"10.1007/s11241-017-9293-4","date_published":"2018-01-01T00:00:00Z","date_created":"2018-12-11T11:48:14Z","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"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,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4","mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.","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.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kößler","full_name":"Kößler, Alexander","first_name":"Alexander"},{"full_name":"Schmid, Ulrich","last_name":"Schmid","first_name":"Ulrich"}],"publist_id":"6929","article_processing_charge":"No","external_id":{"isi":["000419955500006"]},"title":"Automated competitive analysis of real time scheduling with graph games"},{"article_number":"20180073","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. Journal of the Royal Society Interface. 2018;15(140). doi:10.1098/rsif.2018.0073","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2018.0073","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073."},"title":"Language acquisition with communication between learners","article_processing_charge":"No","external_id":{"isi":["000428576200023"],"pmid":["29593089"]},"publist_id":"7715","author":[{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"oa":1,"quality_controlled":"1","publisher":"The Royal Society","publication":"Journal of the Royal Society Interface","day":"01","year":"2018","has_accepted_license":"1","isi":1,"date_created":"2018-12-11T11:45:09Z","date_published":"2018-03-01T00:00:00Z","doi":"10.1098/rsif.2018.0073","_id":"198","status":"public","article_type":"original","type":"journal_article","ddc":["000"],"date_updated":"2023-10-18T06:36:00Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:22Z","pmid":1,"oa_version":"Submitted Version","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"}],"intvolume":" 15","month":"03","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_id":"5955","checksum":"444e1a9d98eb0e780671be82b13025f3","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2018_RS_IbsenJensen.pdf","date_created":"2019-02-12T07:54:37Z","creator":"dernst","file_size":219837,"date_updated":"2020-07-14T12:45:22Z"}],"publication_status":"published","publication_identifier":{"eissn":["1742-5662"]},"ec_funded":1,"volume":15,"issue":"140","related_material":{"link":[{"url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971","relation":"supplementary_material"}],"record":[{"relation":"research_data","id":"9814","status":"public"}]}},{"day":"14","publication":"Communications Biology","has_accepted_license":"1","isi":1,"year":"2018","date_published":"2018-06-14T00:00:00Z","doi":"10.1038/s42003-018-0078-7","date_created":"2018-12-18T13:22:58Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 2018;1(1). doi:10.1038/s42003-018-0078-7","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-018-0078-7","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.","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."},"title":"Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory","author":[{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin A.","last_name":"Nowak","full_name":"Nowak, Martin A."}],"external_id":{"isi":["000461126500071"]},"article_processing_charge":"No","article_number":"71","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"file":[{"date_updated":"2020-07-14T12:47:10Z","file_size":1804194,"creator":"dernst","date_created":"2018-12-18T13:37:04Z","file_name":"2018_CommBiology_Pavlogiannis.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5752","checksum":"a9db825fa3b64a51ff3de035ec973b3e"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2399-3642"]},"publication_status":"published","volume":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7196"},{"status":"public","id":"5559","relation":"popular_science"}]},"issue":"1","ec_funded":1,"oa_version":"Published Version","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"}],"month":"06","intvolume":" 1","scopus_import":"1","ddc":["004","519","576"],"date_updated":"2024-02-21T13:48:42Z","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"KrCh"}],"_id":"5751","status":"public","pubrep_id":"1045","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"date_updated":"2024-03-27T23:30:33Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:34Z","_id":"66","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2018-09-04","end_date":"2018-09-07","location":"Beijing, China","name":"CONCUR: Conference on Concurrency Theory"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-3-95977-087-3"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5696","checksum":"68a055b1aaa241cc38375083cf832a7d","date_updated":"2020-07-14T12:47:34Z","file_size":1078309,"creator":"dernst","date_created":"2018-12-17T12:08:00Z","file_name":"2018_CONCUR_Chatterjee.pdf"}],"ec_funded":1,"volume":118,"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"abstract":[{"text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 118","month":"09","citation":{"ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1806.03108"]},"article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Goharshady","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"publist_id":"7988","title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies","article_number":"11","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"year":"2018","has_accepted_license":"1","day":"01","date_created":"2018-12-11T11:44:27Z","date_published":"2018-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2018.11","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","oa":1,"quality_controlled":"1","publisher":"Springer","year":"2018","has_accepted_license":"1","day":"01","page":"739 - 767","date_created":"2018-12-11T11:45:45Z","date_published":"2018-04-01T00:00:00Z","doi":"10.1007/978-3-319-89884-1_26","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"citation":{"ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","apa":"Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:10.1007/978-3-319-89884-1_26","mla":"Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts. Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26.","ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publist_id":"7554","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"title":"Quantitative analysis of smart contracts","abstract":[{"lang":"eng","text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 10801","month":"04","publication_status":"published","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5716","checksum":"9c8a8338c571903b599b6ca93abd2cce","creator":"dernst","file_size":1394993,"date_updated":"2020-07-14T12:46:00Z","file_name":"2018_ESOP_Chatterjee.pdf","date_created":"2018-12-17T15:45:49Z"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"volume":10801,"_id":"311","conference":{"start_date":"2018-04-16","end_date":"2018-04-19","location":"Thessaloniki, Greece","name":"ESOP: European Symposium on Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","date_updated":"2024-03-27T23:30:33Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:00Z"},{"_id":"6340","status":"public","conference":{"end_date":"2018-08-03","location":"Halifax, Canada","start_date":"2018-07-30","name":"IEEE International Conference on Blockchain"},"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"type":"conference","ddc":["000"],"date_updated":"2024-03-27T23:30:34Z","file_date_updated":"2020-07-14T12:47:27Z","department":[{"_id":"KrCh"}],"oa_version":"Submitted Version","abstract":[{"text":"We present a secure approach for maintaining andreporting credit history records on the Blockchain. Our ap-proach removes third-parties such as credit reporting agen-cies from the lending process and replaces them with smartcontracts. This allows customers to interact directly with thelenders or banks while ensuring the integrity, unmalleabilityand privacy of their credit data. Additionally, each customerhas full control over complete or selective disclosure of hercredit records, eliminating the risk of privacy violations or databreaches. Moreover, our approach provides strong guaranteesfor the lenders as well. A lender can check both correctness andcompleteness of the credit data disclosed to her. This is the firstapproach that can perform all credit reporting tasks withouta central authority or changing the financial mechanisms*.","lang":"eng"}],"month":"09","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2019-04-18T10:36:39Z","file_name":"blockchain2018.pdf","date_updated":"2020-07-14T12:47:27Z","file_size":624338,"creator":"akafshda","checksum":"b25c9bb7cf6e7e6634e692d26d41ead8","file_id":"6341","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-5386-7975-3 "]},"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: Proceedings of the IEEE International Conference on Blockchain. IEEE; 2018:1343-1348. doi:10.1109/Cybermatics_2018.2018.00231","apa":"Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231","ieee":"A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.","short":"A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.","mla":"Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.” Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48, doi:10.1109/Cybermatics_2018.2018.00231.","ista":"Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.","chicago":"Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231."},"title":"Secure Credit Reporting on the Blockchain","external_id":{"arxiv":["1805.09104"],"isi":["000481634500196"]},"article_processing_charge":"No","author":[{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"last_name":"Behrouz","full_name":"Behrouz, Ali","first_name":"Ali"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"quality_controlled":"1","publisher":"IEEE","publication":"Proceedings of the IEEE International Conference on Blockchain","day":"01","year":"2018","has_accepted_license":"1","isi":1,"date_created":"2019-04-18T10:37:35Z","date_published":"2018-09-01T00:00:00Z","doi":"10.1109/Cybermatics_2018.2018.00231","page":"1343-1348"},{"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"9","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"isi":["000444694800001"],"arxiv":["1510.07565"]},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3). doi:10.1145/3210257","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:10.1145/3210257."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Association for Computing Machinery (ACM)","quality_controlled":"1","oa":1,"date_published":"2018-08-01T00:00:00Z","doi":"10.1145/3210257","date_created":"2019-02-14T14:31:52Z","isi":1,"year":"2018","day":"01","publication":"ACM Transactions on Programming Languages and Systems","type":"journal_article","status":"public","_id":"6009","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:34Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.07565"}],"month":"08","intvolume":" 40","abstract":[{"text":"We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n","lang":"eng"}],"oa_version":"Preprint","volume":40,"related_material":{"record":[{"relation":"earlier_version","id":"1437","status":"public"},{"id":"5441","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5442"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"issue":"3","ec_funded":1,"publication_identifier":{"issn":["0164-0925"]},"publication_status":"published","language":[{"iso":"eng"}]},{"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"title":"Computational approaches for stochastic shortest path on succinct MDPs","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Fu, Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei"},{"first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584"},{"full_name":"Okati, Nastaran","last_name":"Okati","first_name":"Nastaran"}],"external_id":{"arxiv":["1804.08984"],"isi":["000764175404118"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653","ama":"Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707. doi:10.24963/ijcai.2018/653","mla":"Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:10.24963/ijcai.2018/653.","ista":"Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653."},"publisher":"IJCAI","quality_controlled":"1","oa":1,"doi":"10.24963/ijcai.2018/653","date_published":"2018-07-17T00:00:00Z","date_created":"2019-02-13T13:26:27Z","page":"4700-4707","day":"17","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","isi":1,"year":"2018","status":"public","type":"conference","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"_id":"5977","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:34Z","month":"07","intvolume":" 2018","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.08984","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs. Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature.","lang":"eng"}],"volume":2018,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10450823"],"isbn":["978-099924112-7"]},"publication_status":"published"},{"quality_controlled":"1","publisher":"National Academy of Sciences","oa":1,"page":"12241-12246","date_published":"2018-11-27T00:00:00Z","doi":"10.1073/pnas.1810565115","date_created":"2018-12-11T11:44:05Z","isi":1,"year":"2018","day":"27","publication":"PNAS","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Hilbe","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X"},{"full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","last_name":"Schmid","first_name":"Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"article_processing_charge":"No","external_id":{"isi":["000451351000063"],"pmid":["30429320"]},"title":"Indirect reciprocity with private, noisy, and incomplete information","citation":{"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.","chicago":"Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1810565115.","ieee":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” PNAS, vol. 115, no. 48. National Academy of Sciences, pp. 12241–12246, 2018.","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. PNAS. 2018;115(48):12241-12246. doi:10.1073/pnas.1810565115","apa":"Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1810565115","mla":"Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS, vol. 115, no. 48, National Academy of Sciences, 2018, pp. 12241–46, doi:10.1073/pnas.1810565115."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30429320","open_access":"1"}],"month":"11","intvolume":" 115","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"}],"pmid":1,"oa_version":"Submitted Version","related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/no-cooperation-without-open-communication/","relation":"press_release"}],"record":[{"relation":"dissertation_contains","status":"public","id":"10293"}]},"issue":"48","volume":115,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"2","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:44Z"},{"day":"07","publication":"Proceedings of the ACM on Programming Languages","year":"2017","doi":"10.1145/3158121","date_published":"2017-12-07T00:00:00Z","date_created":"2021-12-05T23:01:49Z","acknowledgement":"McIver and Morgan are grateful to David Basin and the Information Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during part of which this work began. And thanks particularly to Andreas Lochbihler, who shared with us the probabilistic termination problem that led to it. They acknowledge the support of ARC grant DP140101119. Part of this work was carried out during the Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden. Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4.","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.","apa":"Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121","ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158121","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158121.","ista":"Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33."},"title":"A new proof rule for almost-sure termination","author":[{"first_name":"Annabelle","full_name":"Mciver, Annabelle","last_name":"Mciver"},{"first_name":"Carroll","last_name":"Morgan","full_name":"Morgan, Carroll"},{"first_name":"Benjamin Lucien","full_name":"Kaminski, Benjamin Lucien","last_name":"Kaminski"},{"id":"4524F760-F248-11E8-B48F-1D18A9856A87","first_name":"Joost P","full_name":"Katoen, Joost P","last_name":"Katoen"}],"article_processing_charge":"No","external_id":{"arxiv":["1711.03588"]},"article_number":"33","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","issue":"POPL","volume":2,"oa_version":"Published Version","abstract":[{"text":"We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates \"almost surely\". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. \"super-martingales\") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.","lang":"eng"}],"month":"12","intvolume":" 2","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158121"}],"date_updated":"2021-12-07T08:04:14Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"10418","status":"public","article_type":"original","type":"journal_article","conference":{"start_date":"2018-01-07","end_date":"2018-01-13","location":"Los Angeles, CA, United States","name":"POPL: Programming Languages"}},{"quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"day":"26","publication":"Logical Methods in Computer Science","has_accepted_license":"1","year":"2017","date_published":"2017-09-26T00:00:00Z","doi":"10.23638/LMCS-13(3:26)2017","date_created":"2018-12-11T11:46:37Z","article_number":"26","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017."},"title":"Improved algorithms for parity and Streett objectives","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"publist_id":"7357","external_id":{"arxiv":["1410.0833"]},"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"month":"09","intvolume":" 13","scopus_import":"1","file":[{"file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z","creator":"system","file_size":582940,"date_updated":"2020-07-14T12:46:32Z","file_id":"5010","checksum":"12d469ae69b80361333d7dead965cf5d","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1860-5974"]},"publication_status":"published","related_material":{"record":[{"status":"public","id":"1661","relation":"earlier_version"}]},"issue":"3","volume":13,"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","_id":"464","status":"public","pubrep_id":"956","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"ddc":["004"],"date_updated":"2023-02-23T10:08:55Z","file_date_updated":"2020-07-14T12:46:32Z","department":[{"_id":"KrCh"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017."},"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Zuzana","last_name":"Křetínská","full_name":"Křetínská, Zuzana"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"}],"publist_id":"7355","article_number":"15","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309","call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"day":"03","publication":"Logical Methods in Computer Science","has_accepted_license":"1","year":"2017","doi":"10.23638/LMCS-13(2:15)2017","date_published":"2017-07-03T00:00:00Z","date_created":"2018-12-11T11:46:38Z","quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"ddc":["004"],"date_updated":"2023-02-23T12:26:16Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:33Z","_id":"466","status":"public","pubrep_id":"957","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"file":[{"date_created":"2018-12-12T10:18:32Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","creator":"system","date_updated":"2020-07-14T12:46:33Z","file_size":511832,"file_id":"5354","checksum":"bfa405385ec6229ad5ead89ab5751639","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["18605974"]},"publication_status":"published","related_material":{"record":[{"status":"public","id":"1657","relation":"earlier_version"},{"relation":"earlier_version","id":"5429","status":"public"},{"id":"5435","status":"public","relation":"earlier_version"}]},"volume":13,"issue":"2","ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"month":"07","intvolume":" 13","scopus_import":1},{"date_published":"2017-12-01T00:00:00Z","doi":"10.1145/3152769","date_created":"2018-12-11T11:46:38Z","day":"01","publication":"ACM Transactions on Computational Logic (TOCL)","year":"2017","quality_controlled":"1","publisher":"ACM","oa":1,"title":"Nested weighted automata","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"publist_id":"7354","external_id":{"arxiv":["1606.03598"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769."},"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"31","related_material":{"record":[{"relation":"earlier_version","id":"1656","status":"public"},{"id":"5415","status":"public","relation":"earlier_version"},{"id":"5436","status":"public","relation":"earlier_version"}]},"issue":"4","volume":18,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["15293785"]},"publication_status":"published","month":"12","intvolume":" 18","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T12:26:19Z","status":"public","type":"journal_article","_id":"467"},{"quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"day":"13","publication":"Logical Methods in Computer Science","has_accepted_license":"1","year":"2017","doi":"10.23638/LMCS-13(3:23)2017","date_published":"2017-09-13T00:00:00Z","date_created":"2018-12-11T11:46:37Z","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3)."},"title":"Edit distance for pushdown automata","publist_id":"7356","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"oa_version":"Published Version","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"month":"09","intvolume":" 13","scopus_import":1,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"08041379ba408d40664f449eb5907a8f","file_id":"5090","date_updated":"2020-07-14T12:46:33Z","file_size":279071,"creator":"system","date_created":"2018-12-12T10:14:37Z","file_name":"IST-2015-321-v1+1_main.pdf"},{"date_created":"2018-12-12T10:14:38Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","date_updated":"2020-07-14T12:46:33Z","file_size":279071,"creator":"system","file_id":"5091","checksum":"08041379ba408d40664f449eb5907a8f","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["18605974"]},"publication_status":"published","volume":13,"related_material":{"record":[{"status":"public","id":"1610","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5438"}]},"issue":"3","ec_funded":1,"_id":"465","status":"public","pubrep_id":"955","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"ddc":["004"],"date_updated":"2023-02-23T12:26:25Z","file_date_updated":"2020-07-14T12:46:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"language":[{"iso":"eng"}],"file":[{"file_id":"5357","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:18:35Z","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","creator":"system","date_updated":"2020-07-14T12:46:36Z","file_size":1536783}],"publication_status":"published","publication_identifier":{"issn":["20452322"]},"ec_funded":1,"issue":"1","volume":7,"related_material":{"record":[{"status":"public","id":"5449","relation":"earlier_version"}]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. "}],"intvolume":" 7","month":"03","scopus_import":1,"ddc":["004"],"date_updated":"2023-02-23T12:26:57Z","file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"KrCh"}],"_id":"512","pubrep_id":"938","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","publication":"Scientific Reports","day":"06","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:46:53Z","doi":"10.1038/s41598-017-00107-w","date_published":"2017-03-06T00:00:00Z","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w."},"title":"Amplification on undirected population structures: Comets beat stars","article_processing_charge":"No","publist_id":"7307","author":[{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"article_number":"82","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}]},{"publication":"Proceedings of the ACM on Programming Languages","day":"27","year":"2017","has_accepted_license":"1","date_created":"2021-12-05T23:01:48Z","date_published":"2017-12-27T00:00:00Z","doi":"10.1145/3158118","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017."},"title":"Optimal Dyck reachability for data-dependence and Alias analysis","external_id":{"arxiv":["1910.00241"]},"article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Bhavya","last_name":"Choudhary","full_name":"Choudhary, Bhavya"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"article_number":"30","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"file":[{"date_updated":"2021-12-07T08:06:28Z","file_size":460188,"creator":"cchlebak","date_created":"2021-12-07T08:06:28Z","file_name":"2017_ACMProgLang_Chatterjee.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"10421","checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","success":1}],"publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"ec_funded":1,"issue":"POPL","volume":2,"related_material":{"record":[{"id":"5455","status":"public","relation":"earlier_version"}]},"oa_version":"Published Version","abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.","lang":"eng"}],"intvolume":" 2","month":"12","scopus_import":"1","ddc":["000"],"date_updated":"2023-02-23T12:27:13Z","file_date_updated":"2021-12-07T08:06:28Z","department":[{"_id":"KrCh"}],"_id":"10416","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2018-01-07","end_date":"2018-01-13","location":"Los Angeles, CA, United States","name":"POPL: Programming Languages"},"type":"journal_article","article_type":"original"},{"related_material":{"record":[{"relation":"later_version","status":"public","id":"10416"}]},"publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"177a84a46e3ac17e87b31534ad16a4c9","file_id":"5524","file_size":960491,"date_updated":"2020-07-14T12:46:59Z","creator":"system","file_name":"IST-2017-870-v1+1_main.pdf","date_created":"2018-12-12T11:54:02Z"}],"language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"month":"10","abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks."}],"oa_version":"Published Version","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","date_updated":"2023-02-21T15:54:10Z","ddc":["000"],"type":"technical_report","status":"public","pubrep_id":"870","_id":"5455","page":"37","doi":"10.15479/AT:IST-2017-870-v1-1","date_published":"2017-10-23T00:00:00Z","date_created":"2018-12-12T11:39:26Z","has_accepted_license":"1","year":"2017","day":"23","publisher":"IST Austria","oa":1,"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"article_processing_charge":"No","title":"Optimal Dyck reachability for data-dependence and alias analysis","citation":{"ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.","mla":"Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"_id":"10417","status":"public","type":"journal_article","article_type":"original","conference":{"location":"Los Angeles, CA, United States","end_date":"2018-01-13","start_date":"2018-01-07","name":"POPL: Programming Languages"},"date_updated":"2023-02-23T12:27:16Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"month":"12","intvolume":" 2","scopus_import":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158119","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","issue":"POPL","related_material":{"record":[{"status":"public","id":"5448","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5456"}]},"volume":2,"ec_funded":1,"article_number":"31","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31."},"title":"Data-centric dynamic partial order reduction","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sinha, Nishant","last_name":"Sinha","first_name":"Nishant"},{"last_name":"Vaidya","full_name":"Vaidya, Kapil","first_name":"Kapil"}],"external_id":{"arxiv":["1610.01188"]},"article_processing_charge":"No","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.","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"day":"27","publication":"Proceedings of the ACM on Programming Languages","year":"2017","date_published":"2017-12-27T00:00:00Z","doi":"10.1145/3158119","date_created":"2021-12-05T23:01:49Z"},{"_id":"5456","pubrep_id":"872","status":"public","type":"technical_report","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1."},"date_updated":"2023-02-23T12:26:54Z","file_date_updated":"2020-07-14T12:46:59Z","department":[{"_id":"KrCh"}],"title":"Data-centric dynamic partial order reduction","author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Sinha, Nishant","last_name":"Sinha","first_name":"Nishant"},{"first_name":"Kapil","full_name":"Vaidya, Kapil","last_name":"Vaidya"}],"oa_version":"Published Version","abstract":[{"lang":"eng","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\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.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes."}],"month":"10","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T11:53:26Z","file_name":"IST-2017-872-v1+1_main.pdf","date_updated":"2020-07-14T12:46:59Z","file_size":910347,"creator":"system","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7","file_id":"5487","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"day":"23","year":"2017","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:26Z","doi":"10.15479/AT:IST-2017-872-v1-1","date_published":"2017-10-23T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"10417"},{"status":"public","id":"5448","relation":"earlier_version"}]},"page":"36"},{"doi":"10.4230/LIPIcs.MFCS.2017.61","date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:08Z","day":"01","publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","year":"2017","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","publist_id":"7263","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61."},"article_number":"61","volume":83,"file":[{"file_id":"5322","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:18:04Z","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","creator":"system","date_updated":"2020-07-14T12:47:00Z","file_size":535077}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","month":"11","intvolume":" 83","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. "}],"file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"}],"ddc":["004"],"date_updated":"2021-01-12T08:02:34Z","status":"public","pubrep_id":"924","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2017-08-21","end_date":"2017-08-25","location":"Aalborg, Denmark","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"_id":"551"},{"oa_version":"Published Version","abstract":[{"text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).","lang":"eng"}],"month":"11","intvolume":" 83","scopus_import":"1","alternative_title":["LIPIcs"],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","file_id":"5248","creator":"system","date_updated":"2020-07-14T12:47:00Z","file_size":610339,"date_created":"2018-12-12T10:16:57Z","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","volume":83,"ec_funded":1,"license":"https://creativecommons.org/licenses/by/3.0/","_id":"552","status":"public","pubrep_id":"923","type":"conference","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","end_date":"2017-08-25","location":"Aalborg, Denmark"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"ddc":["004"],"date_updated":"2023-02-14T10:06:46Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:00Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"01","publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","year":"2017","doi":"10.4230/LIPIcs.MFCS.2017.39","date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:08Z","article_number":"39","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39","apa":"Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39","ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39."},"title":"Faster algorithms for mean-payoff parity games","publist_id":"7262","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}],"article_processing_charge":"No"},{"type":"conference","conference":{"end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"922","_id":"553","file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:02:35Z","ddc":["004"],"scopus_import":1,"alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://arxiv.org/abs/1506.02434","open_access":"1"}],"month":"11","intvolume":" 83","abstract":[{"lang":"eng","text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. "}],"oa_version":"Published Version","volume":83,"publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","file":[{"file_id":"4753","checksum":"7101facb56ade363205c695d72dbd173","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:09:29Z","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","date_updated":"2020-07-14T12:47:00Z","file_size":549967,"creator":"system"}],"language":[{"iso":"eng"}],"article_number":"55","publist_id":"7261","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Hansen, Kristofer","last_name":"Hansen","first_name":"Kristofer"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"title":"Strategy complexity of concurrent safety games","citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"doi":"10.4230/LIPIcs.MFCS.2017.55","date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:08Z","has_accepted_license":"1","year":"2017","day":"01","publication":"Leibniz International Proceedings in Informatics"},{"project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"title":"The cost of exactness in quantitative reachability","editor":[{"first_name":"Luca","full_name":"Aceto, Luca","last_name":"Aceto"},{"last_name":"Bacci","full_name":"Bacci, Giorgio","first_name":"Giorgio"},{"first_name":"Anna","last_name":"Ingólfsdóttir","full_name":"Ingólfsdóttir, Anna"},{"first_name":"Axel","last_name":"Legay","full_name":"Legay, Axel"},{"first_name":"Radu","full_name":"Mardare, Radu","last_name":"Mardare"}],"publist_id":"7170","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18","ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381."},"publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and 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.","doi":"10.1007/978-3-319-63121-9_18","date_published":"2017-07-25T00:00:00Z","date_created":"2018-12-11T11:47:34Z","page":"367 - 381","day":"25","publication":"Models, Algorithms, Logics and Tools","has_accepted_license":"1","year":"2017","status":"public","type":"book_chapter","series_title":"Theoretical Computer Science and General Issues","_id":"625","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:25Z","ddc":["000"],"date_updated":"2022-05-23T08:54:02Z","month":"07","intvolume":" 10460","scopus_import":"1","alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games.","lang":"eng"}],"volume":10460,"ec_funded":1,"file":[{"date_updated":"2020-07-14T12:47:25Z","file_size":192826,"creator":"dernst","date_created":"2019-11-19T08:06:50Z","file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b2402766ec02c79801aac634bd8f9f6c","file_id":"7048"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-319-63120-2"]},"publication_status":"published"},{"oa":1,"quality_controlled":"1","publisher":"Springer","year":"2017","day":"01","page":"118 - 139","date_created":"2018-12-11T11:47:35Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-63387-9_6","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:10.1007/978-3-319-63387-9_6","apa":"Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6","short":"K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.","ieee":"K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.","mla":"Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.","ista":"Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"last_name":"Murhekar","full_name":"Murhekar, Aniket","first_name":"Aniket"}],"publist_id":"7166","title":"Automated recurrence analysis for almost linear expected runtime bounds","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","full_name":"Kunčak, Viktor","last_name":"Kunčak"}],"abstract":[{"lang":"eng","text":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. The motivation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear or almost-linear (O(log n), O(n), O(n · log n), respectively, where n represents the input size). Our main contribution is an efficient (simple linear-time algorithm) sound approach for deriving such expected-runtime bounds for the analysis of recurrence relations induced by randomized algorithms. The experimental results show that our approach can efficiently derive asymptotically optimal expected-runtime bounds for recurrences of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select, Coupon-Collector, where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective."}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://arxiv.org/abs/1705.00314","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10426","month":"01","publication_status":"published","publication_identifier":{"isbn":["978-331963386-2"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":10426,"_id":"628","conference":{"name":"CAV: Computer Aided Verification","location":"Heidelberg, Germany","end_date":"2017-07-28","start_date":"2017-07-24"},"type":"conference","status":"public","date_updated":"2021-01-12T08:06:55Z","department":[{"_id":"KrCh"}]},{"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publist_id":"7135","author":[{"last_name":"Ashok","full_name":"Ashok, Pranav","first_name":"Pranav"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer"}],"editor":[{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"title":"Value iteration for long run average reward in markov decision processes","citation":{"ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","mla":"Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","quality_controlled":"1","oa":1,"page":"201 - 221","date_published":"2017-07-13T00:00:00Z","doi":"10.1007/978-3-319-63387-9_10","date_created":"2018-12-11T11:47:41Z","year":"2017","day":"13","type":"conference","conference":{"end_date":"2017-07-28","location":"Heidelberg, Germany","start_date":"2017-07-24","name":"CAV: Computer Aided Verification"},"status":"public","_id":"645","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:07:32Z","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"month":"07","intvolume":" 10426","abstract":[{"lang":"eng","text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks."}],"oa_version":"Submitted Version","volume":10426,"ec_funded":1,"publication_identifier":{"isbn":["978-331963386-2"]},"publication_status":"published","language":[{"iso":"eng"}]},{"oa":1,"publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","quality_controlled":"1","year":"2017","has_accepted_license":"1","day":"01","date_created":"2019-06-04T12:42:43Z","date_published":"2017-08-01T00:00:00Z","doi":"10.4230/LIPICS.CSL.2017.18","article_number":"18","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"citation":{"ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dvorák","full_name":"Dvorák, Wolfgang","first_name":"Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"title":"Improved set-based symbolic algorithms for parity games","abstract":[{"lang":"eng","text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. "}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 82","month":"08","publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6520","checksum":"7c2c9d09970af79026d7e37d9b632ef8","date_updated":"2020-07-14T12:47:33Z","file_size":710185,"creator":"kschuh","date_created":"2019-06-04T12:56:52Z","file_name":"2017_LIPIcs-Chatterjee.pdf"}],"ec_funded":1,"volume":82,"_id":"6519","conference":{"end_date":"2017-08-24","location":"Stockholm, Sweden","start_date":"2017-08-20","name":"CSL: Conference on Computer Science Logic"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public","date_updated":"2023-02-14T10:08:25Z","ddc":["004"],"file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"KrCh"}]},{"status":"public","type":"journal_article","article_type":"original","_id":"653","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:33Z","ddc":["000"],"date_updated":"2022-06-10T09:55:08Z","month":"03","intvolume":" 49","scopus_import":"1","oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease."}],"volume":49,"issue":"3","ec_funded":1,"file":[{"date_created":"2019-11-19T08:13:50Z","file_name":"2017_NatureGenetics_Makohon.pdf","date_updated":"2020-07-14T12:47:33Z","file_size":908099,"creator":"dernst","checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","file_id":"7050","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10614036"]},"publication_status":"published","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","publist_id":"7092","author":[{"first_name":"Alvin","full_name":"Makohon Moore, Alvin","last_name":"Makohon Moore"},{"last_name":"Zhang","full_name":"Zhang, Ming","first_name":"Ming"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"last_name":"Božić","full_name":"Božić, Ivana","first_name":"Ivana"},{"last_name":"Allen","full_name":"Allen, Benjamin","first_name":"Benjamin"},{"id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","first_name":"Deepanjan","last_name":"Kundu","full_name":"Kundu, Deepanjan"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Fay","full_name":"Wong, Fay","last_name":"Wong"},{"first_name":"Yuchen","full_name":"Jiao, Yuchen","last_name":"Jiao"},{"full_name":"Kohutek, Zachary","last_name":"Kohutek","first_name":"Zachary"},{"full_name":"Hong, Jungeui","last_name":"Hong","first_name":"Jungeui"},{"last_name":"Attiyeh","full_name":"Attiyeh, Marc","first_name":"Marc"},{"full_name":"Javier, Breanna","last_name":"Javier","first_name":"Breanna"},{"full_name":"Wood, Laura","last_name":"Wood","first_name":"Laura"},{"last_name":"Hruban","full_name":"Hruban, Ralph","first_name":"Ralph"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"},{"first_name":"Nickolas","full_name":"Papadopoulos, Nickolas","last_name":"Papadopoulos"},{"first_name":"Kenneth","full_name":"Kinzler, Kenneth","last_name":"Kinzler"},{"full_name":"Vogelstein, Bert","last_name":"Vogelstein","first_name":"Bert"},{"full_name":"Iacobuzio Donahue, Christine","last_name":"Iacobuzio Donahue","first_name":"Christine"}],"external_id":{"pmid":["28092682"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.","mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764","short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ieee":"A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017."},"quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","doi":"10.1038/ng.3764","date_published":"2017-03-01T00:00:00Z","date_created":"2018-12-11T11:47:43Z","page":"358 - 366","day":"01","publication":"Nature Genetics","has_accepted_license":"1","year":"2017"},{"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:08:37Z","type":"journal_article","status":"public","_id":"671","volume":114,"issue":"18","ec_funded":1,"publication_identifier":{"issn":["00278424"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/","open_access":"1"}],"month":"05","intvolume":" 114","abstract":[{"text":"Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","author":[{"last_name":"Hilbe","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Martinez","full_name":"Martinez, Vaquero","first_name":"Vaquero"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"publist_id":"7053","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["28420786"]},"title":"Memory-n strategies of direct reciprocity","citation":{"ieee":"C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.","short":"C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.","apa":"Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1621239114","ama":"Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. PNAS. 2017;114(18):4715-4720. doi:10.1073/pnas.1621239114","mla":"Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” PNAS, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114.","ista":"Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.","chicago":"Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1621239114."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"}],"page":"4715 - 4720","doi":"10.1073/pnas.1621239114","date_published":"2017-05-02T00:00:00Z","date_created":"2018-12-11T11:47:50Z","year":"2017","day":"02","publication":"PNAS","publisher":"National Academy of Sciences","quality_controlled":"1","oa":1},{"oa":1,"quality_controlled":"1","publisher":"Elsevier","year":"2017","publication":"Information and Computation","day":"01","page":"296 - 315","date_created":"2018-12-11T11:47:53Z","date_published":"2017-06-01T00:00:00Z","doi":"10.1016/j.ic.2016.10.012","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"citation":{"ista":"Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012.","short":"K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation 254 (2017) 296–315.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254. Elsevier, pp. 296–315, 2017.","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular games. Information and Computation. 2017;254:296-315. doi:10.1016/j.ic.2016.10.012","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.012","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["1311.3238"]},"publist_id":"7036","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"full_name":"Filiot, Emmanuel","last_name":"Filiot","first_name":"Emmanuel"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"title":"Doomsday equilibria for omega-regular games","abstract":[{"text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile where all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players' objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1311.3238"}],"scopus_import":"1","intvolume":" 254","month":"06","publication_status":"published","publication_identifier":{"issn":["08905401"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":254,"related_material":{"record":[{"status":"public","id":"10885","relation":"earlier_version"}]},"_id":"681","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-02-21T16:06:02Z","department":[{"_id":"KrCh"}]},{"_id":"684","status":"public","type":"journal_article","date_updated":"2021-04-16T12:10:53Z","department":[{"_id":"KrCh"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic."}],"month":"06","intvolume":" 82","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1206.5174"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1943-5886"],"issn":["0022-4812"]},"publication_status":"published","volume":82,"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.","short":"K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.","ama":"Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71","apa":"Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71","mla":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:10.1017/jsl.2016.71.","ista":"Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017. https://doi.org/10.1017/jsl.2016.71."},"title":"Obligation blackwell games and p-automata","publist_id":"7026","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"article_processing_charge":"No","publisher":"Cambridge University Press","quality_controlled":"1","oa":1,"day":"01","publication":"Journal of Symbolic Logic","year":"2017","doi":"10.1017/jsl.2016.71","date_published":"2017-06-01T00:00:00Z","date_created":"2018-12-11T11:47:54Z","page":"420 - 452"},{"publication_identifier":{"issn":["00278424"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"27","volume":114,"abstract":[{"lang":"eng","text":"In antagonistic symbioses, such as host–parasite interactions, one population’s success is the other’s loss. In mutualistic symbioses, such as division of labor, both parties can gain, but they might have different preferences over the possible mutualistic arrangements. The rates of evolution of the two populations in a symbiosis are important determinants of which population will be more successful: Faster evolution is thought to be favored in antagonistic symbioses (the “Red Queen effect”), but disfavored in certain mutualistic symbioses (the “Red King effect”). However, it remains unclear which biological parameters drive these effects. Here, we analyze the effects of the various determinants of evolutionary rate: generation time, mutation rate, population size, and the intensity of natural selection. Our main results hold for the case where mutation is infrequent. Slower evolution causes a long-term advantage in an important class of mutualistic interactions. Surprisingly, less intense selection is the strongest driver of this Red King effect, whereas relative mutation rates and generation times have little effect. In antagonistic interactions, faster evolution by any means is beneficial. Our results provide insight into the demographic evolution of symbionts. "}],"oa_version":"Submitted Version","pmid":1,"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5502615/"}],"month":"07","intvolume":" 114","date_updated":"2021-01-12T08:11:21Z","department":[{"_id":"KrCh"}],"_id":"699","type":"journal_article","status":"public","year":"2017","day":"03","publication":"PNAS","page":"E5396 - E5405","doi":"10.1073/pnas.1702020114","date_published":"2017-07-03T00:00:00Z","date_created":"2018-12-11T11:48:00Z","quality_controlled":"1","publisher":"National Academy of Sciences","oa":1,"citation":{"ista":"Veller C, Hayward L, Nowak M, Hilbe C. 2017. The red queen and king in finite populations. PNAS. 114(27), E5396–E5405.","chicago":"Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red Queen and King in Finite Populations.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1702020114.","ieee":"C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in finite populations,” PNAS, vol. 114, no. 27. National Academy of Sciences, pp. E5396–E5405, 2017.","short":"C. Veller, L. Hayward, M. Nowak, C. Hilbe, PNAS 114 (2017) E5396–E5405.","apa":"Veller, C., Hayward, L., Nowak, M., & Hilbe, C. (2017). The red queen and king in finite populations. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1702020114","ama":"Veller C, Hayward L, Nowak M, Hilbe C. The red queen and king in finite populations. PNAS. 2017;114(27):E5396-E5405. doi:10.1073/pnas.1702020114","mla":"Veller, Carl, et al. “The Red Queen and King in Finite Populations.” PNAS, vol. 114, no. 27, National Academy of Sciences, 2017, pp. E5396–405, doi:10.1073/pnas.1702020114."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Veller","full_name":"Veller, Carl","first_name":"Carl"},{"first_name":"Laura","full_name":"Hayward, Laura","last_name":"Hayward"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"},{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"}],"publist_id":"7002","external_id":{"pmid":["28630336"]},"title":"The red queen and king in finite populations"},{"_id":"711","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"28th International Conference on Concurrency Theory, CONCUR","start_date":"2017-09-05","end_date":"2017-09-08","location":"Berlin, Germany"},"status":"public","pubrep_id":"886","date_updated":"2021-01-12T08:11:53Z","ddc":["004","005"],"file_date_updated":"2020-07-14T12:47:49Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow the automata to process input words backwards as well, for example, to measure the maximal or average time between a response and the preceding request. We therefore introduce and study bidirectional NWA that can process input words in both directions. First, we show that bidirectional NWA can express interesting quantitative properties that are not expressible by forward-only NWA. Second, for the fundamental decision problems of emptiness and universality, we establish decidability and complexity results for the new framework which match the best-known results for the special case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality is achieved at no additional computational complexity. This is in stark contrast to the unweighted case, where bidirectional finite automata are no more expressive but exponentially more succinct than their forward-only counterparts."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"08","intvolume":" 85","publication_identifier":{"issn":["18688969"]},"publication_status":"published","file":[{"date_created":"2018-12-12T10:08:02Z","file_name":"IST-2017-886-v1+1_LIPIcs-CONCUR-2017-5.pdf","creator":"system","date_updated":"2020-07-14T12:47:49Z","file_size":570294,"checksum":"d2bda4783821a6358333fe27f11f4737","file_id":"4661","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":85,"article_number":"5","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5.","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 5.","mla":"Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5","ama":"Chatterjee K, Henzinger TA, Otop J. Bidirectional nested weighted automata. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.5","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"publist_id":"6976","title":"Bidirectional nested weighted automata","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2017","day":"01","date_published":"2017-08-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2017.5","date_created":"2018-12-11T11:48:04Z"},{"publication_status":"published","publication_identifier":{"issn":["00045411"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":64,"issue":"5","abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion.While pushdown games have been studied before with qualitative objectives-such as reachability and ?-regular objectives- in this work, we study for the first time such games with the most well-studied quantitative objective, the mean-payoff objective. In pushdown games, two types of strategies are relevant: (1) global strategies, which depend on the entire global history; and (2) modular strategies, which have only local memory and thus do not depend on the context of invocation but rather only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity by showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games and memoryless modular strategies are sufficient in two-player pushdown games. Finally, we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1201.2829"}],"scopus_import":1,"intvolume":" 64","month":"09","date_updated":"2021-01-12T08:12:08Z","department":[{"_id":"KrCh"}],"_id":"716","article_type":"original","type":"journal_article","status":"public","year":"2017","publication":"Journal of the ACM","day":"01","page":"34","date_created":"2018-12-11T11:48:06Z","date_published":"2017-09-01T00:00:00Z","doi":"10.1145/3121408","oa":1,"publisher":"ACM","quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM, vol. 64, no. 5, ACM, 2017, p. 34, doi:10.1145/3121408.","short":"K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.","ieee":"K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.","ama":"Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. Journal of the ACM. 2017;64(5):34. doi:10.1145/3121408","apa":"Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408.","ista":"Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1201.2829"]},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"publist_id":"6964","title":"The complexity of mean-payoff pushdown games","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}]},{"oa":1,"publisher":"Academic Press","quality_controlled":"1","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.","date_created":"2018-12-11T11:48:07Z","date_published":"2017-09-01T00:00:00Z","doi":"10.1016/j.jcss.2017.04.005","page":"236 - 259","publication":"Journal of Computer and System Sciences","day":"01","year":"2017","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Hyperplane separation technique for multidimensional mean-payoff games","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"publist_id":"6963","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences. Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005.","ieee":"K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88. Academic Press, pp. 236–259, 2017.","short":"K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.","ama":"Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 2017;88:236-259. doi:10.1016/j.jcss.2017.04.005","apa":"Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press. https://doi.org/10.1016/j.jcss.2017.04.005","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences, vol. 88, Academic Press, 2017, pp. 236–59, doi:10.1016/j.jcss.2017.04.005."},"intvolume":" 88","month":"09","main_file_link":[{"url":"https://arxiv.org/abs/1210.3141","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider finite-state and recursive game graphs with multidimensional mean-payoff objectives. In recursive games two types of strategies are relevant: global strategies and modular strategies. Our contributions are: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of weights are fixed; whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that one-player recursive games with multidimensional mean-payoff objectives can be solved in polynomial time. Both above algorithms are based on hyperplane separation technique. (3) For recursive games we show that under modular strategies the multidimensional problem is undecidable. We show that if the number of modules, exits, and the maximal absolute value of the weights are fixed, then one-dimensional recursive mean-payoff games under modular strategies can be solved in polynomial time, whereas for unbounded number of exits or modules the problem is NP-hard."}],"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"2329","status":"public"}]},"volume":88,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"717","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T10:38:15Z"},{"oa_version":"None","abstract":[{"lang":"eng","text":"The ubiquity of computation in modern machines and devices imposes a need to assert the correctness of their behavior. Especially in the case of safety-critical systems, their designers need to take measures that enforce their safe operation. Formal methods has emerged as a research field that addresses this challenge: by rigorously proving that all system executions adhere to their specifications, the correctness of an implementation under concern can be assured. To achieve this goal, a plethora of techniques are nowadays available, all of which are optimized for different system types and application domains."}],"intvolume":" 54","month":"09","quality_controlled":"1","publisher":"Springer","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Acta Informatica","day":"01","year":"2017","publication_status":"published","publication_identifier":{"issn":["00015903"]},"date_created":"2018-12-11T11:48:07Z","date_published":"2017-09-01T00:00:00Z","issue":"6","volume":54,"doi":"10.1007/s00236-017-0299-0","page":"543 - 544","_id":"719","status":"public","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:12:18Z","citation":{"mla":"Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica, vol. 54, no. 6, Springer, 2017, pp. 543–44, doi:10.1007/s00236-017-0299-0.","short":"K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.","ieee":"K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6. Springer, pp. 543–544, 2017.","apa":"Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0","ama":"Chatterjee K, Ehlers R. Special issue: Synthesis and SYNT 2014. Acta Informatica. 2017;54(6):543-544. doi:10.1007/s00236-017-0299-0","chicago":"Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-017-0299-0.","ista":"Chatterjee K, Ehlers R. 2017. Special issue: Synthesis and SYNT 2014. Acta Informatica. 54(6), 543–544."},"department":[{"_id":"KrCh"}],"title":"Special issue: Synthesis and SYNT 2014","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rüdiger","last_name":"Ehlers","full_name":"Ehlers, Rüdiger"}],"publist_id":"6961"},{"date_updated":"2023-06-21T13:29:46Z","department":[{"_id":"KrCh"}],"_id":"13160","conference":{"start_date":"2017-04-22","location":"Uppsala, Sweden","end_date":"2017-04-29","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"eisbn":["9783662545775"],"eissn":["1611-3349"],"isbn":["9783662545768"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"volume":10205,"abstract":[{"lang":"eng","text":"Transforming deterministic ω\r\n-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1701.05738"}],"alternative_title":["LNCS"],"intvolume":" 10205","month":"03","citation":{"chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60. Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26.","ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance record for transforming Rabin automata into parity automata. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.","mla":"Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi:10.1007/978-3-662-54577-5_26","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1701.05738"]},"article_processing_charge":"No","author":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias"},{"first_name":"Clara","full_name":"Waldmann, Clara","last_name":"Waldmann"},{"first_name":"Maximilian","full_name":"Weininger, Maximilian","last_name":"Weininger"}],"title":"Index appearance record for transforming Rabin automata into parity automata","year":"2017","publication":"Tools and Algorithms for the Construction and Analysis of Systems","day":"31","page":"443-460","date_created":"2023-06-21T13:21:14Z","date_published":"2017-03-31T00:00:00Z","doi":"10.1007/978-3-662-54577-5_26","acknowledgement":"This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.","oa":1,"quality_controlled":"1","publisher":"Springer"},{"pubrep_id":"844","status":"public","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2017-09-05","location":"Berlin, Germany","end_date":"2017-09-07"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"950","file_date_updated":"2020-07-14T12:48:16Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-08-29T07:02:13Z","intvolume":" 85","month":"09","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"text":"Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. Both players have separate budgets, which sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously, and a bid is legal if it does not exceed the available budget. The winner of the bidding pays his bid to the other player and moves the token. For reachability objectives, repeated bidding games have been studied and are called Richman games. There, a central question is the existence and computation of threshold budgets; namely, a value t\\in [0,1] such that if\\PO's budget exceeds $t$, he can win the game, and if\\PT's budget exceeds 1-t, he can win the game. We focus on parity games and mean-payoff games. We show the existence of threshold budgets in these games, and reduce the problem of finding them to Richman games. We also determine the strategy-complexity of an optimal strategy. Our most interesting result shows that memoryless strategies suffice for mean-payoff bidding games. \r\n","lang":"eng"}],"volume":85,"related_material":{"record":[{"relation":"later_version","id":"6752","status":"public"}]},"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:18:00Z","file_name":"IST-2017-844-v1+1_concur-cr.pdf","date_updated":"2020-07-14T12:48:16Z","file_size":335170,"creator":"system","checksum":"6d5cccf755207b91ccbef95d8275b013","file_id":"5318","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"]},"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"article_number":"17","title":"Infinite-duration bidding games","external_id":{"arxiv":["1705.01433"]},"author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K","last_name":"Chonev","full_name":"Chonev, Ventsislav K"}],"publist_id":"6466","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21.","ista":"Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.","mla":"Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.","ama":"Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21","apa":"Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21","short":"G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2018-12-11T11:49:22Z","date_published":"2017-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2017.21","day":"01","year":"2017","has_accepted_license":"1"},{"acknowledgement":"First, I am thankful to my advisor, Krishnendu Chatterjee, for offering me the opportunity to\r\nmaterialize my scientific curiosity in a remarkably wide range of interesting topics, as well as for his constant availability and continuous support throughout my doctoral studies. I have had the privilege of collaborating with, discussing and getting inspired by all members of my committee: Thomas A. Henzinger, Ulrich Schmid and Martin A. Nowak. The role of the above four people has been very instrumental both to the research carried out for this dissertation, and to the researcher I evolved to in the process.\r\nI have greatly enjoyed my numerous brainstorming sessions with Rasmus Ibsen-Jensen, many\r\nof which led to results on low-treewidth graphs presented here. I thank Alex Kößler for our\r\ndiscussions on modeling and analyzing real-time scheduling algorithms, Yaron Velner for our\r\ncollaboration on the Quantitative Interprocedural Analysis framework, and Nishant Sinha for our initial discussions on partial order reduction techniques in stateless model checking. I also thank Jan Otop, Ben Adlam, Bernhard Kragl and Josef Tkadlec for our fruitful collaborations on\r\ntopics outside the scope of this dissertation, as well as the interns Prateesh Goyal, Amir Kafshdar Goharshady, Samarth Mishra, Bhavya Choudhary and Marek Chalupa, with whom I have shared my excitement on various research topics. Together with my collaborators, I thank officemates and members of the Chatterjee and Henzinger groups throughout the years, Thorsten Tarrach, Ventsi Chonev, Roopsha Samanta, Przemek Daca, Mirco Giacobbe, Tanja Petrov, Ashutosh\r\nGupta, Arjun Radhakrishna, Petr Novontý, Christian Hilbe, Jakob Ruess, Martin Chmelik,\r\nCezara Dragoi, Johannes Reiter, Andrey Kupriyanov, Guy Avni, Sasha Rubin, Jessica Davies, Hongfei Fu, Thomas Ferrère, Pavol Cerný, Ali Sezgin, Jan Kretínský, Sergiy Bogomolov, Hui\r\nKong, Benjamin Aminof, Duc-Hiep Chu, and Damien Zufferey. Besides collaborations and office spaces, with many of the above people I have been fortunate to share numerous whiteboard\r\ndiscussions, as well as memorable long walks and amicable meals accompanied by stimulating\r\nconversations. I am highly indebted to Elisabeth Hacker for her continuous assistance in matters\r\nthat often exceeded her official duties, and who made my integration in Austria a smooth process.","oa":1,"publisher":"Institute of Science and Technology Austria","year":"2017","has_accepted_license":"1","day":"09","page":"418","date_created":"2018-12-11T11:48:41Z","doi":"10.15479/AT:ISTA:th_854","date_published":"2017-08-09T00:00:00Z","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"citation":{"short":"A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications, Institute of Science and Technology Austria, 2017.","ieee":"A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.","ama":"Pavlogiannis A. Algorithmic advances in program analysis and their applications. 2017. doi:10.15479/AT:ISTA:th_854","apa":"Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their applications. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_854","mla":"Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their Applications. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_854.","ista":"Pavlogiannis A. 2017. Algorithmic advances in program analysis and their applications. Institute of Science and Technology Austria.","chicago":"Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their Applications.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_854."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"}],"publist_id":"6828","title":"Algorithmic advances in program analysis and their applications","abstract":[{"text":"This dissertation focuses on algorithmic aspects of program verification, and presents modeling and complexity advances on several problems related to the\r\nstatic analysis of programs, the stateless model checking of concurrent programs, and the competitive analysis of real-time scheduling algorithms.\r\nOur contributions can be broadly grouped into five categories.\r\n\r\nOur first contribution is a set of new algorithms and data structures for the quantitative and data-flow analysis of programs, based on the graph-theoretic notion of treewidth.\r\nIt has been observed that the control-flow graphs of typical programs have special structure, and are characterized as graphs of small treewidth.\r\nWe utilize this structural property to provide faster algorithms for the quantitative and data-flow analysis of recursive and concurrent programs.\r\nIn most cases we make an algebraic treatment of the considered problem,\r\nwhere several interesting analyses, such as the reachability, shortest path, and certain kind of data-flow analysis problems follow as special cases. \r\nWe exploit the constant-treewidth property to obtain algorithmic improvements for on-demand versions of the problems, \r\nand provide data structures with various tradeoffs between the resources spent in the preprocessing and querying phase.\r\nWe also improve on the algorithmic complexity of quantitative problems outside the algebraic path framework,\r\nnamely of the minimum mean-payoff, minimum ratio, and minimum initial credit for energy problems.\r\n\r\n\r\nOur second contribution is a set of algorithms for Dyck reachability with applications to data-dependence analysis and alias analysis.\r\nIn particular, we develop an optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous in context-insensitive, field-sensitive points-to analysis.\r\nAdditionally, we develop an efficient algorithm for context-sensitive data-dependence analysis via Dyck reachability,\r\nwhere the task is to obtain analysis summaries of library code in the presence of callbacks.\r\nOur algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is (i)~linear in the number of call sites and (ii)~only logarithmic in the size of the whole library, as opposed to linear in the size of the whole library.\r\nFinally, we prove that Dyck reachability is Boolean Matrix Multiplication-hard in general, and the hardness also holds for graphs of constant treewidth.\r\nThis hardness result strongly indicates that there exist no combinatorial algorithms for Dyck reachability with truly subcubic complexity.\r\n\r\n\r\nOur third contribution is the formalization and algorithmic treatment of the Quantitative Interprocedural Analysis framework.\r\nIn this framework, the transitions of a recursive program are annotated as good, bad or neutral, and receive a weight which measures\r\nthe magnitude of their respective effect.\r\nThe Quantitative Interprocedural Analysis problem asks to determine whether there exists an infinite run of the program where the long-run ratio of the bad weights over the good weights is above a given threshold.\r\nWe illustrate how several quantitative problems related to static analysis of recursive programs can be instantiated in this framework,\r\nand present some case studies to this direction.\r\n\r\n\r\nOur fourth contribution is a new dynamic partial-order reduction for the stateless model checking of concurrent programs. Traditional approaches rely on the standard Mazurkiewicz equivalence between traces, by means of partitioning the trace space into equivalence classes, and attempting to explore a few representatives from each class.\r\nWe present a new dynamic partial-order reduction method called the Data-centric Partial Order Reduction (DC-DPOR).\r\nOur algorithm is based on a new equivalence between traces, called the observation equivalence.\r\nDC-DPOR explores a coarser partitioning of the trace space than any exploration method based on the standard Mazurkiewicz equivalence.\r\nDepending on the program, the new partitioning can be even exponentially coarser.\r\nAdditionally, DC-DPOR spends only polynomial time in each explored class.\r\n\r\n\r\nOur fifth contribution is the use of automata and game-theoretic verification techniques in the competitive analysis and synthesis of real-time scheduling algorithms for firm-deadline tasks.\r\nOn the analysis side, we leverage automata on infinite words to compute the competitive ratio of real-time schedulers subject to various environmental constraints.\r\nOn the synthesis side, we introduce a new instance of two-player mean-payoff partial-information games, and show\r\nhow the synthesis of an optimal real-time scheduler can be reduced to computing winning strategies in this new type of games.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"08","degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4900","checksum":"3a3ec003f6ee73f41f82a544d63dfc77","creator":"system","file_size":4103115,"date_updated":"2020-07-14T12:48:10Z","file_name":"IST-2017-854-v1+1_Pavlogiannis_Thesis_PubRep.pdf","date_created":"2018-12-12T10:11:44Z"},{"date_created":"2019-04-05T07:59:31Z","file_name":"2017_thesis_Pavlogiannis.zip","creator":"dernst","date_updated":"2020-07-14T12:48:10Z","file_size":14744374,"checksum":"bd2facc45ff8a2e20c5ed313c2ccaa83","file_id":"6201","access_level":"closed","relation":"source_file","content_type":"application/zip"}],"ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1071"},{"relation":"part_of_dissertation","id":"1437","status":"public"},{"relation":"part_of_dissertation","id":"1602","status":"public"},{"id":"1604","status":"public","relation":"part_of_dissertation"},{"id":"1607","status":"public","relation":"part_of_dissertation"},{"id":"1714","status":"public","relation":"part_of_dissertation"}]},"_id":"821","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"type":"dissertation","pubrep_id":"854","status":"public","date_updated":"2023-09-07T12:01:59Z","supervisor":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:48:10Z","department":[{"_id":"KrCh"}]},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.04.006","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 2017;23(2):230-253. doi:10.1016/j.nahs.2016.04.006","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006."},"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","article_processing_charge":"No","external_id":{"isi":["000390637000014"],"arxiv":["1410.5387"]},"publist_id":"5800","author":[{"first_name":"Mária","last_name":"Svoreňová","full_name":"Svoreňová, Mária"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Ivana","last_name":"Cěrná","full_name":"Cěrná, Ivana"},{"first_name":"Cǎlin","full_name":"Belta, Cǎlin","last_name":"Belta"}],"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"}],"publication":"Nonlinear Analysis: Hybrid Systems","day":"01","year":"2017","isi":1,"date_created":"2018-12-11T11:51:50Z","doi":"10.1016/j.nahs.2016.04.006","date_published":"2017-02-01T00:00:00Z","page":"230 - 253","oa":1,"quality_controlled":"1","publisher":"Elsevier","date_updated":"2023-09-20T09:43:09Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"1407","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1689"}]},"volume":23,"issue":"2","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study."}],"intvolume":" 23","month":"02","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.5387"}],"scopus_import":"1"},{"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"717","_id":"1294","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:42Z","date_updated":"2023-09-20T11:15:31Z","ddc":["004","006"],"scopus_import":"1","month":"03","intvolume":" 84","abstract":[{"lang":"eng","text":"We study controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize the expected mean-payoff performance and stability (also known as variability in the literature). We argue that the basic notion of expressing the stability using the statistical variance of the mean payoff is sometimes insufficient, and propose an alternative definition. We show that a strategy ensuring both the expected mean payoff and the variance below given bounds requires randomization and memory, under both the above definitions. We then show that the problem of finding such a strategy can be expressed as a set of constraints."}],"oa_version":"Published Version","volume":84,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2305"}]},"ec_funded":1,"publication_status":"published","file":[{"checksum":"91271b23cf884d7c06d33bef0cd623b1","file_id":"4885","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-717-v1+1_1-s2.0-S0022000016300897-main.pdf","date_created":"2018-12-12T10:11:30Z","creator":"system","file_size":708657,"date_updated":"2020-07-14T12:44:42Z"}],"language":[{"iso":"eng"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publist_id":"6009","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"last_name":"Kučera","full_name":"Kučera, Antonín","first_name":"Antonín"}],"article_processing_charge":"No","external_id":{"isi":["000388430000011"]},"title":"Trading performance for stability in Markov decision processes","citation":{"ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84. Elsevier, pp. 144–170, 2017.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, Journal of Computer and System Sciences 84 (2017) 144–170.","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 2017;84:144-170. doi:10.1016/j.jcss.2016.09.009","apa":"Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2017). Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.09.009","mla":"Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences, vol. 84, Elsevier, 2017, pp. 144–70, doi:10.1016/j.jcss.2016.09.009.","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2017. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 84, 144–170.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences. Elsevier, 2017. https://doi.org/10.1016/j.jcss.2016.09.009."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Elsevier","quality_controlled":"1","oa":1,"page":"144 - 170","date_published":"2017-03-01T00:00:00Z","doi":"10.1016/j.jcss.2016.09.009","date_created":"2018-12-11T11:51:12Z","has_accepted_license":"1","isi":1,"year":"2017","day":"01","publication":"Journal of Computer and System Sciences"},{"quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"date_published":"2017-01-31T00:00:00Z","doi":"10.1038/ncomms14114","date_created":"2018-12-11T11:50:02Z","day":"31","publication":"Nature Communications","isi":1,"has_accepted_license":"1","year":"2017","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"14114","title":"Reconstructing metastatic seeding patterns of human cancers","author":[{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353"},{"first_name":"Alvin","last_name":"Makohon Moore","full_name":"Makohon Moore, Alvin"},{"last_name":"Gerold","full_name":"Gerold, Jeffrey","first_name":"Jeffrey"},{"first_name":"Ivana","last_name":"Božić","full_name":"Božić, Ivana"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iacobuzio Donahue","full_name":"Iacobuzio Donahue, Christine","first_name":"Christine"},{"first_name":"Bert","last_name":"Vogelstein","full_name":"Vogelstein, Bert"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"publist_id":"6301","external_id":{"isi":["000393096600001"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Božić, Krishnendu Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing Metastatic Seeding Patterns of Human Cancers.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14114.","ista":"Reiter J, Makohon Moore A, Gerold J, Božić I, Chatterjee K, Iacobuzio Donahue C, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 8, 14114.","mla":"Reiter, Johannes, et al. “Reconstructing Metastatic Seeding Patterns of Human Cancers.” Nature Communications, vol. 8, 14114, Nature Publishing Group, 2017, doi:10.1038/ncomms14114.","ieee":"J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","short":"J. Reiter, A. Makohon Moore, J. Gerold, I. Božić, K. Chatterjee, C. Iacobuzio Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).","ama":"Reiter J, Makohon Moore A, Gerold J, et al. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 2017;8. doi:10.1038/ncomms14114","apa":"Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114"},"month":"01","intvolume":" 8","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Reconstructing the evolutionary history of metastases is critical for understanding their basic biological principles and has profound clinical implications. Genome-wide sequencing data has enabled modern phylogenomic methods to accurately dissect subclones and their phylogenies from noisy and impure bulk tumour samples at unprecedented depth. However, existing methods are not designed to infer metastatic seeding patterns. Here we develop a tool, called Treeomics, to reconstruct the phylogeny of metastases and map subclones to their anatomic locations. Treeomics infers comprehensive seeding patterns for pancreatic, ovarian, and prostate cancers. Moreover, Treeomics correctly disambiguates true seeding patterns from sequencing artifacts; 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumour heterogeneity among distinct samples. In silico benchmarking on simulated tumour phylogenies across a wide range of sample purities (15–95%) and sequencing depths (25-800 × ) demonstrates the accuracy of Treeomics compared with existing methods.","lang":"eng"}],"volume":8,"ec_funded":1,"file":[{"file_id":"5133","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2017-786-v1+1_ncomms14114.pdf","date_created":"2018-12-12T10:15:15Z","file_size":897050,"date_updated":"2018-12-12T10:15:15Z","creator":"system"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["20411723"]},"publication_status":"published","status":"public","pubrep_id":"786","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"1080","department":[{"_id":"KrCh"}],"file_date_updated":"2018-12-12T10:15:15Z","ddc":["004","006"],"date_updated":"2023-09-20T11:55:31Z"},{"publisher":"Elsevier","quality_controlled":"1","oa":1,"page":"25 - 29","doi":"10.1016/j.ipl.2017.02.003","date_published":"2017-06-01T00:00:00Z","date_created":"2018-12-11T11:49:57Z","has_accepted_license":"1","isi":1,"year":"2017","day":"01","publication":"Information Processing Letters","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116"}],"publist_id":"6323","external_id":{"isi":["000399506600005"]},"article_processing_charge":"No","title":"Pushdown reachability with constant treewidth","citation":{"mla":"Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters, vol. 122, Elsevier, 2017, pp. 25–29, doi:10.1016/j.ipl.2017.02.003.","ama":"Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003","apa":"Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2017.02.003","short":"K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.","ieee":"K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.","chicago":"Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters. Elsevier, 2017. https://doi.org/10.1016/j.ipl.2017.02.003.","ista":"Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","month":"06","intvolume":" 122","abstract":[{"lang":"eng","text":"We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs."}],"oa_version":"Submitted Version","volume":122,"ec_funded":1,"publication_identifier":{"issn":["00200190"]},"publication_status":"published","file":[{"file_id":"4998","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:13:17Z","file_name":"IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf","creator":"system","date_updated":"2019-10-15T07:44:51Z","file_size":247657}],"language":[{"iso":"eng"}],"type":"journal_article","status":"public","pubrep_id":"991","_id":"1065","department":[{"_id":"KrCh"},{"_id":"HeEd"}],"file_date_updated":"2019-10-15T07:44:51Z","date_updated":"2023-09-20T12:08:18Z","ddc":["000"]},{"month":"06","intvolume":" 254","scopus_import":"1","oa_version":"None","abstract":[{"text":"Simulation is an attractive alternative to language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simulation over specified set of infinite runs; and (2) quantitative simulation, for simulation between weighted automata. While fair trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial time. For weighted automata, the (quantitative) language inclusion problem is undecidable in general, whereas the (quantitative) simulation reduces to quantitative games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted automata with Büchi acceptance conditions, i.e., we generalize fair simulation from non-weighted automata to weighted automata. We show that imposing Büchi acceptance conditions on weighted automata changes many fundamental properties of the simulation games, yet they still admit pseudo-polynomial time algorithms.","lang":"eng"}],"related_material":{"record":[{"relation":"earlier_version","id":"5428","status":"public"}]},"volume":254,"issue":"2","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"1066","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-09-20T12:07:48Z","publisher":"Elsevier","quality_controlled":"1","doi":"10.1016/j.ic.2016.10.006","date_published":"2017-06-01T00:00:00Z","date_created":"2018-12-11T11:49:58Z","page":"143 - 166","day":"01","publication":"Information and Computation","isi":1,"year":"2017","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Quantitative fair simulation games","publist_id":"6322","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"article_processing_charge":"No","external_id":{"isi":["000402025600002"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.006.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.006","ama":"Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games. Information and Computation. 2017;254(2):143-166. doi:10.1016/j.ic.2016.10.006","mla":"Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” Information and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006."}},{"oa":1,"publisher":"Springer","quality_controlled":"1","year":"2017","isi":1,"day":"19","page":"287 - 313","date_created":"2018-12-11T11:49:41Z","doi":"10.1007/978-3-662-54434-1_11","date_published":"2017-03-19T00:00:00Z","project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:10.1007/978-3-662-54434-1_11.","apa":"Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11","ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:10.1007/978-3-662-54434-1_11","ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. https://doi.org/10.1007/978-3-662-54434-1_11.","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000681702400011"]},"article_processing_charge":"No","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Samarth","last_name":"Mishra","full_name":"Mishra, Samarth"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"publist_id":"6384","editor":[{"last_name":"Yang","full_name":"Yang, Hongseok","first_name":"Hongseok"}],"title":"Faster algorithms for weighted recursive state machines","abstract":[{"lang":"eng","text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project."}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://arxiv.org/abs/1701.04914","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 10201","month":"03","publication_status":"published","publication_identifier":{"issn":["03029743"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":10201,"_id":"1011","conference":{"start_date":"2017-04-22","end_date":"2017-04-29","location":"Uppsala, Sweden","name":"ESOP: European Symposium on Programming"},"type":"conference","status":"public","date_updated":"2023-09-22T09:44:50Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"abstract":[{"lang":"eng","text":"A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the “expectation” and “threshold” approaches and consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we are given a threshold t and the objective is to find a policy σ such that a) each possible outcome of σ yields a discounted-sum payoff of at least t, and b) the expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies satisfying a). We present a practical approach to tackle the GPO problem and evaluate it on standard POMDP benchmarks."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092"}],"scopus_import":"1","intvolume":" 5","month":"01","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":5,"_id":"1009","conference":{"start_date":"2017-02-04","location":"San Francisco, CA, United States","end_date":"2017-02-10","name":"AAAI: Conference on Artificial Intelligence"},"type":"conference","status":"public","date_updated":"2023-09-22T09:46:41Z","department":[{"_id":"KrCh"}],"acknowledgement":"he research leading to these results was supported by the Austrian Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants (279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund (WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734].","oa":1,"quality_controlled":"1","publisher":"AAAI Press","year":"2017","isi":1,"publication":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","day":"01","page":"3725 - 3732","date_created":"2018-12-11T11:49:40Z","date_published":"2017-01-01T00:00:00Z","project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"citation":{"chicago":"Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press, 2017.","ista":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.","mla":"Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol. 5, AAAI Press, 2017, pp. 3725–32.","ieee":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.","short":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.","ama":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence. Vol 5. AAAI Press; 2017:3725-3732.","apa":"Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000485630703107"]},"article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Novotny, Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr"},{"first_name":"Guillermo","last_name":"Pérez","full_name":"Pérez, Guillermo"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"},{"first_name":"Djordje","last_name":"Zikelic","full_name":"Zikelic, Djordje"}],"publist_id":"6387","title":"Optimizing expectation with guarantees in POMDPs"},{"publication_identifier":{"issn":["00225193"]},"publication_status":"published","file":[{"date_updated":"2020-07-14T12:47:58Z","file_size":537323,"creator":"dernst","date_created":"2019-11-19T07:57:39Z","file_name":"2017_JournTheoretBio_Priklopil.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"4b43af1615ebf1a861840cb03d8a320c","file_id":"7047"}],"language":[{"iso":"eng"}],"volume":433,"ec_funded":1,"abstract":[{"lang":"eng","text":"In evolutionary game theory interactions between individuals are often assumed obligatory. However, in many real-life situations, individuals can decide to opt out of an interaction depending on the information they have about the opponent. We consider a simple evolutionary game theoretic model to study such a scenario, where at each encounter between two individuals the type of the opponent (cooperator/defector) is known with some probability, and where each individual either accepts or opts out of the interaction. If the type of the opponent is unknown, a trustful individual accepts the interaction, whereas a suspicious individual opts out of the interaction. If either of the two individuals opt out both individuals remain without an interaction. We show that in the prisoners dilemma optional interactions along with suspicious behaviour facilitates the emergence of trustful cooperation."}],"pmid":1,"oa_version":"Submitted Version","scopus_import":"1","month":"11","intvolume":" 433","date_updated":"2023-09-27T12:29:02Z","ddc":["000","570"],"file_date_updated":"2020-07-14T12:47:58Z","department":[{"_id":"KrCh"}],"_id":"744","type":"journal_article","article_type":"original","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","has_accepted_license":"1","isi":1,"year":"2017","day":"21","publication":" Journal of Theoretical Biology","page":"64 - 72","doi":"10.1016/j.jtbi.2017.08.025","date_published":"2017-11-21T00:00:00Z","date_created":"2018-12-11T11:48:16Z","quality_controlled":"1","publisher":"Elsevier","oa":1,"citation":{"short":"T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.","ieee":"T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433. Elsevier, pp. 64–72, 2017.","apa":"Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2017.08.025","ama":"Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 2017;433:64-72. doi:10.1016/j.jtbi.2017.08.025","mla":"Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology, vol. 433, Elsevier, 2017, pp. 64–72, doi:10.1016/j.jtbi.2017.08.025.","ista":"Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.","chicago":"Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology. Elsevier, 2017. https://doi.org/10.1016/j.jtbi.2017.08.025."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6923","author":[{"full_name":"Priklopil, Tadeas","last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","first_name":"Tadeas"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"external_id":{"isi":["000412039800007"],"pmid":["28867224"]},"article_processing_charge":"No","title":"Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}]},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["07308566"]},"publication_status":"published","volume":52,"issue":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14539"}]},"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"text":"Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples. ","lang":"eng"}],"month":"01","intvolume":" 52","alternative_title":["ACM SIGPLAN Notices"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.01063"}],"date_updated":"2023-11-30T10:55:36Z","department":[{"_id":"KrCh"}],"_id":"1194","status":"public","type":"conference","conference":{"name":"POPL: Principles of Programming Languages","location":"Paris, France","end_date":"2017-01-21","start_date":"2017-01-15"},"day":"01","isi":1,"year":"2017","doi":"10.1145/3009837.3009873","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:50:39Z","page":"145 - 160","publisher":"ACM","quality_controlled":"1","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.","ieee":"K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.","ama":"Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:10.1145/3009837.3009873","apa":"Chatterjee, K., Novotný, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. https://doi.org/10.1145/3009837.3009873","mla":"Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.","ista":"Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.","chicago":"Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. https://doi.org/10.1145/3009837.3009873."},"title":"Stochastic invariants for probabilistic termination","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Novotny","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr"},{"first_name":"Djordje","full_name":"Zikelic, Djordje","last_name":"Zikelic"}],"publist_id":"6157","external_id":{"isi":["000408311200013"]},"article_processing_charge":"No","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}]},{"oa":1,"publisher":"Institute of Science and Technology Austria","month":"01","abstract":[{"text":"Strong amplifiers of natural selection","lang":"eng"}],"oa_version":"Published Version","date_created":"2018-12-12T12:31:32Z","ec_funded":1,"doi":"10.15479/AT:ISTA:51","date_published":"2017-01-02T00:00:00Z","related_material":{"record":[{"id":"5452","status":"public","relation":"research_paper"},{"id":"5751","status":"public","relation":"research_paper"}]},"datarep_id":"51","year":"2017","has_accepted_license":"1","day":"02","file":[{"content_type":"video/mp4","access_level":"open_access","relation":"main_file","checksum":"b427dd46a30096a1911b245640c47af8","file_id":"5644","date_updated":"2020-07-14T12:47:02Z","file_size":32987015,"creator":"system","date_created":"2018-12-12T13:05:18Z","file_name":"IST-2017-51-v1+2_illustration.mp4"}],"type":"research_data","keyword":["natural selection"],"status":"public","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"_id":"5559","article_processing_charge":"No","author":[{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","full_name":"Nowak , Martin","last_name":"Nowak "}],"file_date_updated":"2020-07-14T12:47:02Z","title":"Strong amplifiers of natural selection","department":[{"_id":"KrCh"}],"citation":{"chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers of natural selection, Institute of Science and Technology Austria, 10.15479/AT:ISTA:51.","mla":"Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:51.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” Institute of Science and Technology Austria, 2017.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong amplifiers of natural selection. 2017. doi:10.15479/AT:ISTA:51","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:51"},"date_updated":"2024-02-21T13:48:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["519"]},{"year":"2017","day":"01","page":"41 - 63","doi":"10.1007/978-3-319-63390-9_3","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:39Z","publisher":"Springer","quality_controlled":"1","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. Non-Polynomial Worst Case Analysis of Recursive Programs. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 41–63, doi:10.1007/978-3-319-63390-9_3.","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:10.1007/978-3-319-63390-9_3","apa":"Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3","short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_3.","ista":"Chatterjee K, Fu H, Goharshady AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7149","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"last_name":"Goharshady","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["1705.00317"]},"title":"Non-polynomial worst case analysis of recursive programs","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","full_name":"Kunčak, Viktor","last_name":"Kunčak"}],"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"publication_identifier":{"isbn":["978-331963389-3"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"7014"},{"relation":"dissertation_contains","status":"public","id":"8934"}]},"volume":10427,"ec_funded":1,"abstract":[{"lang":"eng","text":"We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in non-polynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr) where r is not an integer. We present experimental results to demonstrate that our approach can efficiently obtain worst-case bounds of classical recursive algorithms such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm."}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"https://arxiv.org/abs/1705.00317","open_access":"1"}],"month":"01","intvolume":" 10427","date_updated":"2024-03-27T23:30:33Z","department":[{"_id":"KrCh"}],"_id":"639","type":"conference","conference":{"location":"Heidelberg, Germany","end_date":"2017-07-28","start_date":"2017-07-24","name":"CAV: Computer Aided Verification"},"status":"public"},{"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 10482","month":"01","abstract":[{"lang":"eng","text":"The notion of treewidth of graphs has been exploited for faster algorithms for several problems arising in verification and program analysis. Moreover, various notions of balanced tree decompositions have been used for improved algorithms supporting dynamic updates and analysis of concurrent programs. In this work, we present a tool for constructing tree-decompositions of CFGs obtained from Java methods, which is implemented as an extension to the widely used Soot framework. The experimental results show that our implementation on real-world Java benchmarks is very efficient. Our tool also provides the first implementation for balancing tree-decompositions. In summary, we present the first tool support for exploiting treewidth in the static analysis problems on Java programs."}],"oa_version":"Submitted Version","ec_funded":1,"volume":10482,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"publication_status":"published","publication_identifier":{"issn":["03029743"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:48:16Z","file_size":948514,"creator":"system","date_created":"2018-12-12T10:10:45Z","file_name":"IST-2017-845-v1+1_2017_Chatterjee_JTDec.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"a0d9f5f94dc594c4e71e78525c9942f1","file_id":"4835"}],"conference":{"end_date":"2017-10-06","location":"Pune, India","start_date":"2017-10-03","name":"ATVA: Automated Technology for Verification and Analysis"},"type":"conference","pubrep_id":"845","status":"public","_id":"949","file_date_updated":"2020-07-14T12:48:16Z","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:34Z","ddc":["005"],"oa":1,"publisher":"Springer","quality_controlled":"1","page":"59 - 66","date_created":"2018-12-11T11:49:22Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-68167-2_4","year":"2017","isi":1,"has_accepted_license":"1","day":"01","project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"article_processing_charge":"No","external_id":{"isi":["000723567800004"]},"publist_id":"6468","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"editor":[{"last_name":"D'Souza","full_name":"D'Souza, Deepak","first_name":"Deepak"}],"title":"JTDec: A tool for tree decompositions in soot","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.” edited by Deepak D’Souza, 10482:59–66. Springer, 2017. https://doi.org/10.1007/978-3-319-68167-2_4.","ista":"Chatterjee K, Goharshady AK, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482, 59–66.","mla":"Chatterjee, Krishnendu, et al. JTDec: A Tool for Tree Decompositions in Soot. Edited by Deepak D’Souza, vol. 10482, Springer, 2017, pp. 59–66, doi:10.1007/978-3-319-68167-2_4.","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.","short":"K. Chatterjee, A.K. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.","apa":"Chatterjee, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4","ama":"Chatterjee K, Goharshady AK, Pavlogiannis A. JTDec: A tool for tree decompositions in soot. In: D’Souza D, ed. Vol 10482. Springer; 2017:59-66. doi:10.1007/978-3-319-68167-2_4"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"25","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Dvorák, Wolfgang","last_name":"Dvorák","first_name":"Wolfgang"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"publist_id":"6317","article_processing_charge":"No","title":"Conditionally optimal algorithms for generalized Büchi Games","citation":{"apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.","mla":"Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.25.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 25.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant (279307","date_published":"2016-08-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2016.25","date_created":"2018-12-11T11:49:58Z","has_accepted_license":"1","year":"2016","day":"01","type":"conference","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2016-08-26","location":"Krakow, Poland","start_date":"2016-08-22"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","pubrep_id":"779","_id":"1068","department":[{"_id":"KrCh"}],"file_date_updated":"2018-12-12T10:16:02Z","date_updated":"2023-02-14T10:11:07Z","ddc":["000","004","006"],"alternative_title":["LIPIcs"],"scopus_import":"1","month":"08","intvolume":" 58","abstract":[{"lang":"eng","text":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m > n^{1.5}. "}],"oa_version":"Published Version","volume":58,"ec_funded":1,"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5187","date_updated":"2018-12-12T10:16:02Z","file_size":632786,"creator":"system","date_created":"2018-12-12T10:16:02Z","file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf"}],"language":[{"iso":"eng"}]},{"scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 55","month":"08","abstract":[{"lang":"eng","text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers."}],"oa_version":"Published Version","ec_funded":1,"volume":55,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5213","date_updated":"2018-12-12T10:16:26Z","file_size":521415,"creator":"system","date_created":"2018-12-12T10:16:26Z","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf"}],"conference":{"name":"ICALP: Automata, Languages and Programming","location":"Rome, Italy","end_date":"2016-07-15","start_date":"2016-07-12"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","pubrep_id":"778","status":"public","_id":"1069","file_date_updated":"2018-12-12T10:16:26Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:48:03Z","ddc":["004","006"],"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC Advanced Grant (267989: QUAREM).","date_created":"2018-12-11T11:49:59Z","doi":"10.4230/LIPIcs.ICALP.2016.100","date_published":"2016-08-01T00:00:00Z","year":"2016","has_accepted_license":"1","day":"01","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"article_number":"100","publist_id":"6314","author":[{"full_name":"Chonev, Ventsislav K","last_name":"Chonev","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K"},{"last_name":"Ouaknine","full_name":"Ouaknine, Joël","first_name":"Joël"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}],"title":"On the skolem problem for continuous linear dynamical systems","citation":{"ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","apa":"Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100","ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.100","mla":"Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.100."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"article_number":"98","title":"Computation tree logic for synchronization properties","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"publist_id":"6313","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.98.","short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ieee":"K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","ama":"Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98","apa":"Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003, and European project Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for their insightful\r\ncomments and suggestions.\r\n","date_created":"2018-12-11T11:49:59Z","doi":"10.4230/LIPIcs.ICALP.2016.98","date_published":"2016-01-01T00:00:00Z","day":"01","year":"2016","has_accepted_license":"1","pubrep_id":"812","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2016-07-12","end_date":"2016-07-15","location":"Rome, Italy"},"type":"conference","_id":"1070","file_date_updated":"2018-12-12T10:08:52Z","department":[{"_id":"KrCh"}],"ddc":["005"],"date_updated":"2021-01-12T06:48:03Z","intvolume":" 55","month":"01","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"text":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We analogously consider quantifier exchange in extensions of CTL, and we present operators defined using basic operators of CTL* that express the occurrence of infinitely many synchronization points. We show that the model-checking problem remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide if the Next operator is allowed in the logics, thus the classical bisimulation quotient can be used for state-space reduction before model checking. ","lang":"eng"}],"ec_funded":1,"volume":55,"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:08:52Z","file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","creator":"system","date_updated":"2018-12-12T10:08:52Z","file_size":546133,"file_id":"4714","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published"},{"volume":58,"ec_funded":1,"file":[{"file_id":"5286","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:17:31Z","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf","creator":"system","date_updated":"2018-12-12T10:17:31Z","file_size":564560}],"language":[{"iso":"eng"}],"publication_status":"published","month":"08","intvolume":" 58","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":" While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness."}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2018-12-12T10:17:31Z","ddc":["004"],"date_updated":"2021-01-12T06:48:12Z","status":"public","pubrep_id":"795","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2016-08-22","end_date":"2016-08-26","location":"Krakow; Poland","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"_id":"1090","doi":"10.4230/LIPIcs.MFCS.2016.24","date_published":"2016-08-01T00:00:00Z","date_created":"2018-12-11T11:50:05Z","day":"01","has_accepted_license":"1","year":"2016","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under grant 2014/15/D/ST6/04543.","title":"Nested weighted limit-average automata of bounded width","publist_id":"6286","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. Nested Weighted Limit-Average Automata of Bounded Width. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.24.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.24","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.24","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.24.","ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24."},"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"article_number":"24"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-01-12T06:48:34Z","status":"public","conference":{"location":"New York, NY, USA","end_date":"2016-07-08","start_date":"2016-07-05","name":"LICS: Logic in Computer Science"},"type":"conference","_id":"1138","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06764"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider. © 2016 ACM."}],"title":"Quantitative automata under probabilistic semantics","external_id":{"arxiv":["1604.06764"]},"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"publist_id":"6220","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 76–85.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.” In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016. https://doi.org/10.1145/2933575.2933588.","ama":"Chatterjee K, Henzinger TA, Otop J. Quantitative automata under probabilistic semantics. In: Proceedings of the 31st Annual ACM/IEEE Symposium. IEEE; 2016:76-85. doi:10.1145/2933575.2933588","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.” Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85, doi:10.1145/2933575.2933588."},"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:50:21Z","date_published":"2016-07-05T00:00:00Z","doi":"10.1145/2933575.2933588","page":"76 - 85","publication":"Proceedings of the 31st Annual ACM/IEEE Symposium","day":"05","year":"2016","oa":1,"quality_controlled":"1","publisher":"IEEE","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S114"},{"date_updated":"2022-09-09T11:46:17Z","department":[{"_id":"KrCh"}],"_id":"1140","conference":{"location":"New York, NY, USA","end_date":"2016-07-08","start_date":"2016-07-05","name":"LICS: Logic in Computer Science"},"type":"conference","status":"public","publication_status":"published","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental -regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, Büchi, and coBüchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical -regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives. © 2016 ACM."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02670"}],"alternative_title":["Proceedings Symposium on Logic in Computer Science"],"scopus_import":"1","month":"07","citation":{"ista":"Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, , 197–206.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016. https://doi.org/10.1145/2933575.2935304.","short":"K. Chatterjee, W. Dvoák, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.","ieee":"K. Chatterjee, W. Dvoák, M. H. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.","ama":"Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2016:197-206. doi:10.1145/2933575.2935304","apa":"Chatterjee, K., Dvoák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304","mla":"Chatterjee, Krishnendu, et al. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206, doi:10.1145/2933575.2935304."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1602.02670"]},"article_processing_charge":"No","publist_id":"6219","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dvoák, Wolfgang","last_name":"Dvoák","first_name":"Wolfgang"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika","first_name":"Veronika"}],"title":"Model and objective separation with conditional lower bounds: disjunction is harder than conjunction","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"year":"2016","publication":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","day":"05","page":"197 - 206","date_created":"2018-12-11T11:50:22Z","doi":"10.1145/2933575.2935304","date_published":"2016-07-05T00:00:00Z","acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003.\r\nK. C. is partially supported by the Austrian Science Fund (FWF)\r\nNFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant\r\n(279307: Graph Games). For W. D., M. H., and V. L. the research\r\nleading to these results has received funding from the European\r\nResearch Council under the European Union’s Seventh Framework\r\nProgramme (FP/2007-2013) / ERC Grant Agreement no. 340506.","oa":1,"publisher":"IEEE","quality_controlled":"1"},{"ec_funded":1,"date_created":"2018-12-11T11:50:35Z","date_published":"2016-01-01T00:00:00Z","volume":"2016-January","related_material":{"link":[{"relation":"table_of_contents","url":"https://www.ijcai.org/proceedings/2016"}]},"page":"172 - 179","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2016","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1604.05090v1","open_access":"1"}],"oa":1,"publisher":"AAAI Press","quality_controlled":"1","scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisely, while we study how robust is the winning probability with respect to small errors in the pairwise winning probabilities. First, we present several illuminating examples to establish: (a) there exist deterministic tournaments (where the pairwise winning probabilities are 0 or 1) where one optimal draw is much more robust than the other; and (b) in general, there exist tournaments with slightly suboptimal draws that are more robust than all the optimal draws. The above examples motivate the study of the computational problem of robust draws that guarantee a specified winning probability. Second, we present a polynomial-time algorithm for approximating the robustness of a draw for sufficiently small errors in pairwise winning probabilities, and obtain that the stated computational problem is NP-complete. We also show that two natural cases of deterministic tournaments where the optimal draw could be computed in polynomial time also admit polynomial-time algorithms to compute robust optimal draws."}],"title":"Robust draws in balanced knockout tournaments","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"}],"publist_id":"6171","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:04:26Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.","ama":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.","short":"K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.","ista":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"status":"public","conference":{"start_date":"2016-07-09","end_date":"2016-07-15","location":"New York, NY, USA","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"type":"conference","_id":"1182"},{"quality_controlled":"1","publisher":"Elsevier","oa":1,"acknowledgement":"C.H. acknowledges generous support from the ISTFELLOW program.","page":"29 - 31","date_published":"2016-12-01T00:00:00Z","doi":"10.1016/j.plrev.2016.10.004","date_created":"2018-12-11T11:50:40Z","has_accepted_license":"1","year":"2016","day":"01","publication":"Physics of Life Reviews","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"publist_id":"6150","author":[{"last_name":"Hilbe","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arne","last_name":"Traulsen","full_name":"Traulsen, Arne"}],"title":"Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze","citation":{"ista":"Hilbe C, Traulsen A. 2016. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. 19, 29–31.","chicago":"Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.” Physics of Life Reviews. Elsevier, 2016. https://doi.org/10.1016/j.plrev.2016.10.004.","ieee":"C. Hilbe and A. Traulsen, “Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on ‘Evolutionary game theory using agent-based methods’ by C. Adami, J. Schossau and A. Hintze,” Physics of Life Reviews, vol. 19. Elsevier, pp. 29–31, 2016.","short":"C. Hilbe, A. Traulsen, Physics of Life Reviews 19 (2016) 29–31.","apa":"Hilbe, C., & Traulsen, A. (2016). Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. Elsevier. https://doi.org/10.1016/j.plrev.2016.10.004","ama":"Hilbe C, Traulsen A. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. 2016;19:29-31. doi:10.1016/j.plrev.2016.10.004","mla":"Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.” Physics of Life Reviews, vol. 19, Elsevier, 2016, pp. 29–31, doi:10.1016/j.plrev.2016.10.004."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"12","intvolume":" 19","oa_version":"Submitted Version","volume":19,"ec_funded":1,"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4855","checksum":"95e6dc78278334b99dacbf8822509364","file_size":171352,"date_updated":"2020-07-14T12:44:39Z","creator":"system","file_name":"IST-2017-798-v1+1_comment_adami.pdf","date_created":"2018-12-12T10:11:02Z"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","pubrep_id":"798","_id":"1200","file_date_updated":"2020-07-14T12:44:39Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:49:03Z","ddc":["530"]},{"project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” Proceedings of the ACM Conference on Computer Supported Cooperative Work, vol. 26, no. Februar-2016, ACM, 2016, pp. 365–68, doi:10.1145/2818052.2869122.","short":"V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.","ieee":"V. Pandey and K. Chatterjee, “Game-theoretic models identify useful principles for peer collaboration in online learning platforms,” in Proceedings of the ACM Conference on Computer Supported Cooperative Work, San Francisco, CA, USA, 2016, vol. 26, no. Februar-2016, pp. 365–368.","ama":"Pandey V, Chatterjee K. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In: Proceedings of the ACM Conference on Computer Supported Cooperative Work. Vol 26. ACM; 2016:365-368. doi:10.1145/2818052.2869122","apa":"Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122","chicago":"Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 26:365–68. ACM, 2016. https://doi.org/10.1145/2818052.2869122.","ista":"Pandey V, Chatterjee K. 2016. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26, 365–368."},"title":"Game-theoretic models identify useful principles for peer collaboration in online learning platforms","author":[{"first_name":"Vineet","full_name":"Pandey, Vineet","last_name":"Pandey"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"publist_id":"6083","acknowledgement":"ERC Start Grant Graph Games 279307 supported this research. ","quality_controlled":"1","publisher":"ACM","publication":"Proceedings of the ACM Conference on Computer Supported Cooperative Work","day":"27","year":"2016","date_created":"2018-12-11T11:50:55Z","doi":"10.1145/2818052.2869122","date_published":"2016-02-27T00:00:00Z","page":"365 - 368","_id":"1245","status":"public","conference":{"name":"CSCW: Computer Supported Cooperative Work and Social Computing","start_date":"2016-02-26","location":"San Francisco, CA, USA","end_date":"2016-03-02"},"type":"conference","date_updated":"2021-01-12T06:49:22Z","department":[{"_id":"KrCh"}],"oa_version":"None","abstract":[{"text":"To facilitate collaboration in massive online classrooms, instructors must make many decisions. For instance, the following parameters need to be decided when designing a peer-feedback system where students review each others' essays: the number of students each student must provide feedback to, an algorithm to map feedback providers to receivers, constraints that ensure students do not become free-riders (receiving feedback but not providing it), the best times to receive feedback to improve learning etc. While instructors can answer these questions by running experiments or invoking past experience, game-theoretic models with data from online learning platforms can identify better initial designs for further improvements. As an example, we explore the design space of a peer feedback system by modeling it using game theory. Our simulations show that incentivizing students to provide feedback requires the value obtained from receiving a feedback to exceed the cost of providing it by a large factor (greater than 7). Furthermore, hiding feedback from low-effort students incentivizes them to provide more feedback.","lang":"eng"}],"intvolume":" 26","month":"02","scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"issue":"Februar-2016","volume":26},{"pubrep_id":"665","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CONCUR: Concurrency Theory","start_date":"2016-08-23","location":"Quebec City, Canada","end_date":"2016-08-26"},"type":"conference","_id":"1325","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:44Z","ddc":["004"],"date_updated":"2021-01-12T06:49:53Z","intvolume":" 59","month":"08","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system.","lang":"eng"}],"ec_funded":1,"volume":59,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"3c2dc6ab0358f8aa8f7aa7d6c1293159","file_id":"5229","file_size":553648,"date_updated":"2020-07-14T12:44:44Z","creator":"system","file_name":"IST-2016-665-v1+1_Forejt_et_al__Stability_in_graphs_and_games.pdf","date_created":"2018-12-12T10:16:40Z"}],"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"article_number":"10","title":"Stability in graphs and games","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"},{"first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","full_name":"Novotny, Petr"}],"publist_id":"5944","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Brázdil, Tomáš, et al. Stability in Graphs and Games. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.10.","ama":"Brázdil T, Forejt V, Kučera A, Novotný P. Stability in graphs and games. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.10","apa":"Brázdil, T., Forejt, V., Kučera, A., & Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.10","ieee":"T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.","short":"T. Brázdil, V. Forejt, A. Kučera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Brázdil, Tomáš, Vojtěch Forejt, Antonín Kučera, and Petr Novotný. “Stability in Graphs and Games,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.10.","ista":"Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"The work has been supported by the Czech Science Foundation, grant No. 15-17564S, by EPSRC grant\r\nEP/M023656/1, and by the People Programme (Marie Curie Actions) of the European Union’s Seventh\r\nFramework Programme (FP7/2007-2013) under REA grant agreement no [291734]","date_created":"2018-12-11T11:51:23Z","doi":"10.4230/LIPIcs.CONCUR.2016.10","date_published":"2016-08-01T00:00:00Z","day":"01","year":"2016","has_accepted_license":"1"},{"month":"01","scopus_import":1,"quality_controlled":"1","publisher":"AAAI Press","main_file_link":[{"url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12999"}],"oa_version":"None","abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. Copyright "}],"volume":"2016-January","date_published":"2016-01-01T00:00:00Z","date_created":"2018-12-11T11:51:22Z","ec_funded":1,"page":"88 - 96","day":"01","publication":"Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling","language":[{"iso":"eng"}],"year":"2016","publication_status":"published","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"status":"public","type":"conference","conference":{"start_date":"2016-06-12","end_date":"2016-06-17","location":"London, United Kingdom","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"_id":"1324","department":[{"_id":"KrCh"}],"title":"Indefinite-horizon reachability in Goal-DEC-POMDPs","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5946","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January, 88–96.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.","ieee":"K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.","short":"K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.","ama":"Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. Vol 2016-January. AAAI Press; 2016:88-96.","apa":"Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, vol. 2016–January, AAAI Press, 2016, pp. 88–96."},"date_updated":"2021-01-12T06:49:53Z"},{"ec_funded":1,"date_created":"2018-12-11T11:51:23Z","date_published":"2016-01-01T00:00:00Z","page":"1465 - 1466","publication":"Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems","language":[{"iso":"eng"}],"day":"01","year":"2016","publication_status":"published","month":"01","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.07565","open_access":"1"}],"scopus_import":1,"quality_controlled":"1","publisher":"ACM","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we present a novel algorithm for solving POMDPs with energy levels, developing on existing POMDP solvers and using RTDP as its main method. Our second contribution is related to policy representation. For larger POMDP instances the policies computed by existing solvers are too large to be understandable. We present an automated procedure based on machine learning techniques that automatically extracts important decisions of the policy allowing us to compute succinct human readable policies. Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels. "}],"department":[{"_id":"KrCh"}],"title":"Stochastic shortest path with energy constraints in POMDPs","publist_id":"5942","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Anchit","last_name":"Gupta","full_name":"Gupta, Anchit"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems, 1465–1466.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.","ama":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. Stochastic shortest path with energy constraints in POMDPs. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. ACM; 2016:1465-1466.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotný, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.","mla":"Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–66."},"date_updated":"2021-01-12T06:49:54Z","status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"conference":{"start_date":"2016-05-09","end_date":"2016-05-13","location":"Singapore","name":"AAMAS: Autonomous Agents & Multiagent Systems"},"type":"conference","_id":"1327"},{"page":"32 - 49","date_published":"2016-09-22T00:00:00Z","doi":"10.1007/978-3-319-46520-3_3","date_created":"2018-12-11T11:51:23Z","year":"2016","day":"22","quality_controlled":"1","publisher":"Springer","oa":1,"acknowledgement":"The research was funded by the Czech Science Foundation Grant No. P202/12/G061 and by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].","publist_id":"5943","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"first_name":"Antonín","full_name":"Kučera, Antonín","last_name":"Kučera"},{"first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","full_name":"Novotny, Petr"}],"title":"Optimizing the expected mean payoff in Energy Markov Decision Processes","citation":{"mla":"Brázdil, Tomáš, et al. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. Vol. 9938, Springer, 2016, pp. 32–49, doi:10.1007/978-3-319-46520-3_3.","short":"T. Brázdil, A. Kučera, P. Novotný, in:, Springer, 2016, pp. 32–49.","ieee":"T. Brázdil, A. Kučera, and P. Novotný, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.","ama":"Brázdil T, Kučera A, Novotný P. Optimizing the expected mean payoff in Energy Markov Decision Processes. In: Vol 9938. Springer; 2016:32-49. doi:10.1007/978-3-319-46520-3_3","apa":"Brázdil, T., Kučera, A., & Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. https://doi.org/10.1007/978-3-319-46520-3_3","chicago":"Brázdil, Tomáš, Antonín Kučera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,” 9938:32–49. Springer, 2016. https://doi.org/10.1007/978-3-319-46520-3_3.","ista":"Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"volume":9938,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1607.00678","open_access":"1"}],"month":"09","intvolume":" 9938","abstract":[{"lang":"eng","text":"Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff. "}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:49:53Z","type":"conference","conference":{"end_date":"2016-10-20","location":"Chiba, Japan","start_date":"2016-10-17","name":"ATVA: Automated Technology for Verification and Analysis"},"status":"public","_id":"1326"},{"volume":7,"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"9ea0d7ce59a555a1cb8353d5559407cb","file_id":"4834","creator":"system","file_size":1432577,"date_updated":"2020-07-14T12:44:44Z","file_name":"IST-2016-661-v1+1_ncomms10915.pdf","date_created":"2018-12-12T10:10:44Z"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"03","intvolume":" 7","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Social dilemmas force players to balance between personal and collective gain. In many dilemmas, such as elected governments negotiating climate-change mitigation measures, the decisions are made not by individual players but by their representatives. However, the behaviour of representatives in social dilemmas has not been investigated experimentally. Here inspired by the negotiations for greenhouse-gas emissions reductions, we experimentally study a collective-risk social dilemma that involves representatives deciding on behalf of their fellow group members. Representatives can be re-elected or voted out after each consecutive collective-risk game. Selfish players are preferentially elected and are hence found most frequently in the "representatives" treatment. Across all treatments, we identify the selfish players as extortioners. As predicted by our mathematical model, their steadfast strategies enforce cooperation from fair players who finally compensate almost completely the deficit caused by the extortionate co-players. Everybody gains, but the extortionate representatives and their groups gain the most."}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:44Z","ddc":["519","530","599"],"date_updated":"2021-01-12T06:49:57Z","status":"public","pubrep_id":"661","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"1333","date_published":"2016-03-07T00:00:00Z","doi":"10.1038/ncomms10915","date_created":"2018-12-11T11:51:25Z","day":"07","publication":"Nature Communications","has_accepted_license":"1","year":"2016","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"acknowledgement":"We thank the students for participation; H.-J. Krambeck for writing the software for the game; H. Arndt, T. Bakker, L. Becks, H. Brendelberger, S. Dobler and T. Reusch for support; and the Max Planck Society for the Advancement of Science for funding.","title":"Humans choose representatives who enforce cooperation in social dilemmas through extortion","author":[{"last_name":"Milinski","full_name":"Milinski, Manfred","first_name":"Manfred"},{"orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"last_name":"Semmann","full_name":"Semmann, Dirk","first_name":"Dirk"},{"last_name":"Sommerfeld","full_name":"Sommerfeld, Ralf","first_name":"Ralf"},{"full_name":"Marotzke, Jochem","last_name":"Marotzke","first_name":"Jochem"}],"publist_id":"5935","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Milinski, Manfred, Christian Hilbe, Dirk Semmann, Ralf Sommerfeld, and Jochem Marotzke. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.” Nature Communications. Nature Publishing Group, 2016. https://doi.org/10.1038/ncomms10915.","ista":"Milinski M, Hilbe C, Semmann D, Sommerfeld R, Marotzke J. 2016. Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. 7, 10915.","mla":"Milinski, Manfred, et al. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.” Nature Communications, vol. 7, 10915, Nature Publishing Group, 2016, doi:10.1038/ncomms10915.","ieee":"M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, and J. Marotzke, “Humans choose representatives who enforce cooperation in social dilemmas through extortion,” Nature Communications, vol. 7. Nature Publishing Group, 2016.","short":"M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, J. Marotzke, Nature Communications 7 (2016).","apa":"Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., & Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms10915","ama":"Milinski M, Hilbe C, Semmann D, Sommerfeld R, Marotzke J. Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. 2016;7. doi:10.1038/ncomms10915"},"article_number":"10915"},{"page":"23 - 38","doi":"10.1007/978-3-662-53413-7_2","date_published":"2016-08-31T00:00:00Z","date_created":"2018-12-11T11:51:26Z","year":"2016","day":"31","publisher":"Springer","quality_controlled":"1","oa":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5932","title":"Quantitative monitor automata","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative monitor automata,” presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom, 2016, vol. 9837, pp. 23–38.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.","ama":"Chatterjee K, Henzinger TA, Otop J. Quantitative monitor automata. In: Vol 9837. Springer; 2016:23-38. doi:10.1007/978-3-662-53413-7_2","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53413-7_2","mla":"Chatterjee, Krishnendu, et al. Quantitative Monitor Automata. Vol. 9837, Springer, 2016, pp. 23–38, doi:10.1007/978-3-662-53413-7_2.","ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837, 23–38.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,” 9837:23–38. Springer, 2016. https://doi.org/10.1007/978-3-662-53413-7_2."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"volume":9837,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"https://arxiv.org/abs/1604.06764","open_access":"1"}],"month":"08","intvolume":" 9837","abstract":[{"text":"In this paper we review various automata-theoretic formalisms for expressing quantitative properties. We start with finite-state Boolean automata that express the traditional regular properties. We then consider weighted ω-automata that can measure the average density of events, which finite-state Boolean automata cannot. However, even weighted ω-automata cannot express basic performance properties like average response time. We finally consider two formalisms of weighted ω-automata with monitors, where the monitors are either (a) counters or (b) weighted automata themselves. We present a translation result to establish that these two formalisms are equivalent. Weighted ω-automata with monitors generalize weighted ω-automata, and can express average response time property. They present a natural, robust, and expressive framework for quantitative specifications, with important decidable properties.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-01-12T06:49:58Z","type":"conference","conference":{"name":"SAS: Static Analysis Symposium","start_date":"2016-09-08","location":"Edinburgh, United Kingdom","end_date":"2016-09-10"},"status":"public","_id":"1335"},{"oa":1,"publisher":"Springer","quality_controlled":"1","day":"01","year":"2016","date_created":"2018-12-11T11:51:28Z","doi":"10.1007/978-3-662-53354-3_6","date_published":"2016-09-01T00:00:00Z","page":"64 - 76","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Hansen, Kristoffer, et al. The Big Match in Small Space. Vol. 9928, Springer, 2016, pp. 64–76, doi:10.1007/978-3-662-53354-3_6.","apa":"Hansen, K., Ibsen-Jensen, R., & Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53354-3_6","ama":"Hansen K, Ibsen-Jensen R, Koucký M. The big match in small space. In: Vol 9928. Springer; 2016:64-76. doi:10.1007/978-3-662-53354-3_6","ieee":"K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.","short":"K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.","chicago":"Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,” 9928:64–76. Springer, 2016. https://doi.org/10.1007/978-3-662-53354-3_6.","ista":"Hansen K, Ibsen-Jensen R, Koucký M. 2016. The big match in small space. SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928, 64–76."},"title":"The big match in small space","author":[{"last_name":"Hansen","full_name":"Hansen, Kristoffer","first_name":"Kristoffer"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"full_name":"Koucký, Michal","last_name":"Koucký","first_name":"Michal"}],"publist_id":"5927","oa_version":"Preprint","abstract":[{"text":"We study repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games with the prototypical example being the Big Match of Gillete (1957). These games may not allow optimal strategies but they always have ε-optimal strategies. In this paper we design ε-optimal strategies for Player 1 in these games that use only O(log log T) space. Furthermore, we construct strategies for Player 1 that use space s(T), for an arbitrary small unbounded non-decreasing function s, and which guarantee an ε-optimal value for Player 1 in the limit superior sense. The previously known strategies use space Ω(log T) and it was known that no strategy can use constant space if it is ε-optimal even in the limit superior sense. We also give a complementary lower bound. Furthermore, we also show that no Markov strategy, even extended with finite memory, can ensure value greater than 0 in the Big Match, answering a question posed by Neyman [11].","lang":"eng"}],"intvolume":" 9928","month":"09","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.07634"}],"alternative_title":["LNCS"],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":9928,"_id":"1340","status":"public","conference":{"end_date":"2016-09-21","location":"Liverpool, United Kingdom","start_date":"2016-09-19","name":"SAGT: Symposium on Algorithmic Game Theory"},"type":"conference","date_updated":"2021-01-12T06:50:00Z","department":[{"_id":"KrCh"}]},{"_id":"1380","article_number":"23","type":"journal_article","status":"public","date_updated":"2021-01-12T06:50:17Z","citation":{"mla":"Chonev, Ventsislav K., et al. “On the Complexity of the Orbit Problem.” Journal of the ACM, vol. 63, no. 3, 23, ACM, 2016, doi:10.1145/2857050.","apa":"Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the complexity of the orbit problem. Journal of the ACM. ACM. https://doi.org/10.1145/2857050","ama":"Chonev VK, Ouaknine J, Worrell J. On the complexity of the orbit problem. Journal of the ACM. 2016;63(3). doi:10.1145/2857050","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the complexity of the orbit problem,” Journal of the ACM, vol. 63, no. 3. ACM, 2016.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity of the Orbit Problem.” Journal of the ACM. ACM, 2016. https://doi.org/10.1145/2857050.","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the complexity of the orbit problem. Journal of the ACM. 63(3), 23."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K","last_name":"Chonev","full_name":"Chonev, Ventsislav K"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"last_name":"Worrell","full_name":"Worrell, James","first_name":"James"}],"publist_id":"5831","title":"On the complexity of the orbit problem","department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem - determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NPRP.","lang":"eng"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.2981"}],"scopus_import":1,"publisher":"ACM","quality_controlled":"1","intvolume":" 63","month":"06","publication_status":"published","year":"2016","language":[{"iso":"eng"}],"publication":"Journal of the ACM","day":"01","date_created":"2018-12-11T11:51:41Z","date_published":"2016-06-01T00:00:00Z","issue":"3","doi":"10.1145/2857050","volume":63},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.03632"}],"oa":1,"quality_controlled":"1","publisher":"IEEE","scopus_import":1,"month":"07","abstract":[{"text":"The continuous evolution of a wide variety of systems, including continous-time Markov chains and linear hybrid automata, can be\r\ndescribed in terms of linear differential equations. In this paper we study the decision problem of whether the solution x(t) of a system of linear differential equations dx/dt = Ax reaches a target halfspace infinitely often. This recurrent reachability problem can\r\nequivalently be formulated as the following Infinite Zeros Problem: does a real-valued function f:R≥0 --> R satisfying a given linear\r\ndifferential equation have infinitely many zeros? Our main decidability result is that if the differential equation has order at most 7, then the Infinite Zeros Problem is decidable. On the other hand, we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision.","lang":"eng"}],"oa_version":"Preprint","page":"515 - 524","date_created":"2018-12-11T11:51:44Z","ec_funded":1,"date_published":"2016-07-05T00:00:00Z","doi":"10.1145/2933575.2934548","publication_status":"published","year":"2016","publication":"LICS '16","language":[{"iso":"eng"}],"day":"05","conference":{"name":"LICS: Logic in Computer Science","end_date":"2018-07-08","location":"New York, NY, USA","start_date":"2018-07-05"},"type":"conference","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"status":"public","_id":"1389","author":[{"first_name":"Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Chonev, Ventsislav K","last_name":"Chonev"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"publist_id":"5820","department":[{"_id":"KrCh"}],"title":"On recurrent reachability for continuous linear dynamical systems","date_updated":"2021-01-12T06:50:20Z","citation":{"ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” In LICS ’16, 515–24. IEEE, 2016. https://doi.org/10.1145/2933575.2934548.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in LICS ’16, New York, NY, USA, 2016, pp. 515–524.","ama":"Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: LICS ’16. IEEE; 2016:515-524. doi:10.1145/2933575.2934548","apa":"Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In LICS ’16 (pp. 515–524). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934548","mla":"Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” LICS ’16, IEEE, 2016, pp. 515–24, doi:10.1145/2933575.2934548."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"pubrep_id":"589","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"1426","file_date_updated":"2020-07-14T12:44:53Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2021-01-12T06:50:39Z","intvolume":" 3","month":"05","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"Brood parasites exploit their host in order to increase their own fitness. Typically, this results in an arms race between parasite trickery and host defence. Thus, it is puzzling to observe hosts that accept parasitism without any resistance. The ‘mafia’ hypothesis suggests that these hosts accept parasitism to avoid retaliation. Retaliation has been shown to evolve when the hosts condition their response to mafia parasites, who use depredation as a targeted response to rejection. However, it is unclear if acceptance would also emerge when ‘farming’ parasites are present in the population. Farming parasites use depredation to synchronize the timing with the host, destroying mature clutches to force the host to re-nest. Herein, we develop an evolutionary model to analyse the interaction between depredatory parasites and their hosts. We show that coevolutionary cycles between farmers and mafia can still induce host acceptance of brood parasites. However, this equilibrium is unstable and in the long-run the dynamics of this host–parasite interaction exhibits strong oscillations: when farmers are the majority, accepters conditional to mafia (the host will reject first and only accept after retaliation by the parasite) have a higher fitness than unconditional accepters (the host always accepts parasitism). This leads to an increase in mafia parasites’ fitness and in turn induce an optimal environment for accepter hosts.","lang":"eng"}],"issue":"5","volume":3,"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:44:53Z","file_size":937002,"creator":"system","date_created":"2018-12-12T10:14:49Z","file_name":"IST-2016-589-v1+1_160036.full.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"bf84211b31fe87451e738ba301d729c3","file_id":"5104"}],"publication_status":"published","article_number":"160036","title":"Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites","author":[{"last_name":"Chakra","full_name":"Chakra, Maria","first_name":"Maria"},{"last_name":"Hilbe","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"last_name":"Traulsen","full_name":"Traulsen, Arne","first_name":"Arne"}],"publist_id":"5776","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chakra, Maria, et al. “Coevolutionary Interactions between Farmers and Mafia Induce Host Acceptance of Avian Brood Parasites.” Royal Society Open Science, vol. 3, no. 5, 160036, Royal Society, The, 2016, doi:10.1098/rsos.160036.","ama":"Chakra M, Hilbe C, Traulsen A. Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. 2016;3(5). doi:10.1098/rsos.160036","apa":"Chakra, M., Hilbe, C., & Traulsen, A. (2016). Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. Royal Society, The. https://doi.org/10.1098/rsos.160036","short":"M. Chakra, C. Hilbe, A. Traulsen, Royal Society Open Science 3 (2016).","ieee":"M. Chakra, C. Hilbe, and A. Traulsen, “Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites,” Royal Society Open Science, vol. 3, no. 5. Royal Society, The, 2016.","chicago":"Chakra, Maria, Christian Hilbe, and Arne Traulsen. “Coevolutionary Interactions between Farmers and Mafia Induce Host Acceptance of Avian Brood Parasites.” Royal Society Open Science. Royal Society, The, 2016. https://doi.org/10.1098/rsos.160036.","ista":"Chakra M, Hilbe C, Traulsen A. 2016. Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. 3(5), 160036."},"oa":1,"publisher":"Royal Society, The","quality_controlled":"1","acknowledgement":"C.H. gratefully acknowledges funding by the Schrödinger scholarship of the Austrian Science Fund (FWF) J3475.","date_created":"2018-12-11T11:51:57Z","doi":"10.1098/rsos.160036","date_published":"2016-05-01T00:00:00Z","publication":"Royal Society Open Science","day":"01","year":"2016","has_accepted_license":"1"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Baek, Seung, et al. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.” Scientific Reports, vol. 6, 25676, Nature Publishing Group, 2016, doi:10.1038/srep25676.","short":"S. Baek, H. Jeong, C. Hilbe, M. Nowak, Scientific Reports 6 (2016).","ieee":"S. Baek, H. Jeong, C. Hilbe, and M. Nowak, “Comparing reactive and memory-one strategies of direct reciprocity,” Scientific Reports, vol. 6. Nature Publishing Group, 2016.","apa":"Baek, S., Jeong, H., Hilbe, C., & Nowak, M. (2016). Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep25676","ama":"Baek S, Jeong H, Hilbe C, Nowak M. Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. 2016;6. doi:10.1038/srep25676","chicago":"Baek, Seung, Hyeongchai Jeong, Christian Hilbe, and Martin Nowak. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.” Scientific Reports. Nature Publishing Group, 2016. https://doi.org/10.1038/srep25676.","ista":"Baek S, Jeong H, Hilbe C, Nowak M. 2016. Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. 6, 25676."},"title":"Comparing reactive and memory-one strategies of direct reciprocity","publist_id":"5784","author":[{"last_name":"Baek","full_name":"Baek, Seung","first_name":"Seung"},{"first_name":"Hyeongchai","last_name":"Jeong","full_name":"Jeong, Hyeongchai"},{"last_name":"Hilbe","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"article_number":"25676","day":"10","publication":"Scientific Reports","has_accepted_license":"1","year":"2016","date_published":"2016-05-10T00:00:00Z","doi":"10.1038/srep25676","date_created":"2018-12-11T11:51:56Z","acknowledgement":"C.H. acknowledges generous funding from the Schrödinger scholarship of the Austrian Science Fund (FWF), J3475.","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"ddc":["000"],"date_updated":"2021-01-12T06:50:38Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:53Z","_id":"1423","status":"public","pubrep_id":"590","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"creator":"system","date_updated":"2020-07-14T12:44:53Z","file_size":1349915,"date_created":"2018-12-12T10:18:08Z","file_name":"IST-2016-590-v1+1_srep25676.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"ee17c482370d2e1b3add393710d3c696","file_id":"5327"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":6,"oa_version":"Published Version","abstract":[{"text":"Direct reciprocity is a mechanism for the evolution of cooperation based on repeated interactions. When individuals meet repeatedly, they can use conditional strategies to enforce cooperative outcomes that would not be feasible in one-shot social dilemmas. Direct reciprocity requires that individuals keep track of their past interactions and find the right response. However, there are natural bounds on strategic complexity: Humans find it difficult to remember past interactions accurately, especially over long timespans. Given these limitations, it is natural to ask how complex strategies need to be for cooperation to evolve. Here, we study stochastic evolutionary game dynamics in finite populations to systematically compare the evolutionary performance of reactive strategies, which only respond to the co-player's previous move, and memory-one strategies, which take into account the own and the co-player's previous move. In both cases, we compare deterministic strategy and stochastic strategy spaces. For reactive strategies and small costs, we find that stochasticity benefits cooperation, because it allows for generous-tit-for-tat. For memory one strategies and small costs, we find that stochasticity does not increase the propensity for cooperation, because the deterministic rule of win-stay, lose-shift works best. For memory one strategies and large costs, however, stochasticity can augment cooperation.","lang":"eng"}],"month":"05","intvolume":" 6","scopus_import":1},{"_id":"1518","article_type":"original","type":"journal_article","pubrep_id":"561","status":"public","date_updated":"2022-05-24T09:16:22Z","ddc":["570"],"department":[{"_id":"KrCh"},{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:45:00Z","abstract":[{"lang":"eng","text":"The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proved difficult to exploit the information contained in the distribution of genealogies across the genome. We have previously shown that the generating function (GF) of genealogies can be used to analytically compute likelihoods of demographic models from configurations of mutations in short sequence blocks (Lohse et al. 2011). Although the GF has a simple, recursive form, the size of such likelihood calculations explodes quickly with the number of individuals and applications of this framework have so far been mainly limited to small samples (pairs and triplets) for which the GF can be written by hand. Here we investigate several strategies for exploiting the inherent symmetries of the coalescent. In particular, we show that the GF of genealogies can be decomposed into a set of equivalence classes that allows likelihood calculations from nontrivial samples. Using this strategy, we automated blockwise likelihood calculations for a general set of demographic scenarios in Mathematica. These histories may involve population size changes, continuous migration, discrete divergence, and admixture between multiple populations. To give a concrete example, we calculate the likelihood for a model of isolation with migration (IM), assuming two diploid samples without phase and outgroup information. We demonstrate the new inference scheme with an analysis of two individual butterfly genomes from the sister species Heliconius melpomene rosina and H. cydno."}],"pmid":1,"oa_version":"Preprint","scopus_import":"1","intvolume":" 202","month":"02","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2016-561-v1+1_Lohse_et_al_Genetics_2015.pdf","date_created":"2018-12-12T10:16:51Z","file_size":957466,"date_updated":"2020-07-14T12:45:00Z","creator":"system","checksum":"41c9b5d72e7fe4624dd22dfe622337d5","file_id":"5241","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"ec_funded":1,"volume":202,"issue":"2","project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"citation":{"ista":"Lohse K, Chmelik M, Martin S, Barton NH. 2016. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 202(2), 775–786.","chicago":"Lohse, Konrad, Martin Chmelik, Simon Martin, and Nicholas H Barton. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.115.183814.","ama":"Lohse K, Chmelik M, Martin S, Barton NH. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 2016;202(2):775-786. doi:10.1534/genetics.115.183814","apa":"Lohse, K., Chmelik, M., Martin, S., & Barton, N. H. (2016). Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.115.183814","short":"K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786.","ieee":"K. Lohse, M. Chmelik, S. Martin, and N. H. Barton, “Efficient strategies for calculating blockwise likelihoods under the coalescent,” Genetics, vol. 202, no. 2. Genetics Society of America, pp. 775–786, 2016.","mla":"Lohse, Konrad, et al. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.” Genetics, vol. 202, no. 2, Genetics Society of America, 2016, pp. 775–86, doi:10.1534/genetics.115.183814."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"pmid":["26715666"]},"author":[{"first_name":"Konrad","last_name":"Lohse","full_name":"Lohse, Konrad"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Martin, Simon","last_name":"Martin","first_name":"Simon"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"publist_id":"5658","title":"Efficient strategies for calculating blockwise likelihoods under the coalescent","acknowledgement":"We thank Lynsey Bunnefeld for discussions throughout the project and Joshua Schraiber and one anonymous reviewer\r\nfor constructive comments on an earlier version of this manuscript. This work was supported by funding from the\r\nUnited Kingdom Natural Environment Research Council (to K.L.) (NE/I020288/1) and a grant from the European\r\nResearch Council (250152) (to N.H.B.).","oa":1,"quality_controlled":"1","publisher":"Genetics Society of America","year":"2016","has_accepted_license":"1","publication":"Genetics","day":"01","page":"775 - 786","date_created":"2018-12-11T11:52:29Z","date_published":"2016-02-01T00:00:00Z","doi":"10.1534/genetics.115.183814"},{"date_updated":"2021-01-12T08:00:54Z","ddc":["004"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:35Z","_id":"478","type":"conference","conference":{"name":"ECAI: European Conference on Artificial Intelligence","end_date":"2016-09-02","location":"The Hague, Netherlands","start_date":"2016-08-29"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"status":"public","pubrep_id":"950","publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4658","checksum":"848043c812ace05e459579c923f3d3cf","creator":"system","date_updated":"2020-07-14T12:46:35Z","file_size":2116225,"date_created":"2018-12-12T10:07:59Z","file_name":"IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf"}],"language":[{"iso":"eng"}],"volume":285,"license":"https://creativecommons.org/licenses/by-nc/4.0/","abstract":[{"lang":"eng","text":"Magic: the Gathering is a game about magical combat for any number of players. Formally it is a zero-sum, imperfect information stochastic game that consists of a potentially unbounded number of steps. We consider the problem of deciding if a move is legal in a given single step of Magic. We show that the problem is (a) coNP-complete in general; and (b) in P if either of two small sets of cards are not used. Our lower bound holds even for single-player Magic games. The significant aspects of our results are as follows: First, in most real-life game problems, the task of deciding whether a given move is legal in a single step is trivial, and the computationally hard task is to find the best sequence of legal moves in the presence of multiple players. In contrast, quite uniquely our hardness result holds for single step and with only one-player. Second, we establish efficient algorithms for important special cases of Magic."}],"oa_version":"Published Version","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"scopus_import":1,"month":"01","intvolume":" 285","citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:10.3233/978-1-61499-672-9-1432","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432","short":"K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.","ista":"Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"}],"publist_id":"7342","title":"The complexity of deciding legality of a single step of magic: The gathering","has_accepted_license":"1","year":"2016","day":"01","page":"1432 - 1439","doi":"10.3233/978-1-61499-672-9-1432","date_published":"2016-01-01T00:00:00Z","date_created":"2018-12-11T11:46:41Z","publisher":"IOS Press","quality_controlled":"1","oa":1},{"date_updated":"2021-01-12T08:00:56Z","department":[{"_id":"KrCh"}],"_id":"480","conference":{"start_date":"2016-07-05","location":"New York, NY, USA","end_date":"2016-07-08","name":"LICS: Logic in Computer Science"},"type":"conference","status":"public","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":"05-08-July-2016","abstract":[{"text":"Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is 1. Previous results presented a semi-decision procedure for -approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06376"}],"alternative_title":["Proceedings Symposium on Logic in Computer Science"],"scopus_import":1,"month":"07","citation":{"ista":"Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE, 2016. https://doi.org/10.1145/2933575.2934513.","short":"K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.","ieee":"K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.","apa":"Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513","ama":"Chatterjee K, Doyen L. Perfect-information stochastic games with generalized mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:10.1145/2933575.2934513","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE, 2016, pp. 247–56, doi:10.1145/2933575.2934513."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7340","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"title":"Perfect-information stochastic games with generalized mean-payoff objectives","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"year":"2016","day":"05","page":"247 - 256","date_created":"2018-12-11T11:46:42Z","date_published":"2016-07-05T00:00:00Z","doi":"10.1145/2933575.2934513","oa":1,"quality_controlled":"1","publisher":"IEEE"},{"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2802"}],"month":"08","intvolume":" 82","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages provides a robust specification language to express properties in verification, and parity objectives are canonical forms to express them. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are undecidable even for special cases of parity objectives, we establish decidability (with optimal complexity) for POMDPs with all parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. We also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of POMDP examples."}],"oa_version":"Preprint","volume":82,"issue":"5","related_material":{"record":[{"status":"public","id":"2295","relation":"earlier_version"},{"id":"5400","status":"public","relation":"earlier_version"}]},"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"1477","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:24:38Z","quality_controlled":"1","publisher":"Elsevier","oa":1,"page":"878 - 911","doi":"10.1016/j.jcss.2016.02.009","date_published":"2016-08-01T00:00:00Z","date_created":"2018-12-11T11:52:15Z","year":"2016","day":"01","publication":"Journal of Computer and System Sciences","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publist_id":"5718","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol","full_name":"Tracol, Mathieu"}],"external_id":{"arxiv":["1309.2802"]},"title":"What is decidable about partially observable Markov decision processes with ω-regular objectives","citation":{"ista":"Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.","apa":"Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.02.009","ama":"Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 2016;82(5):878-911. doi:10.1016/j.jcss.2016.02.009","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.","short":"K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.","mla":"Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"year":"2016","publication":"Artificial Intelligence","day":"01","page":"26 - 48","date_created":"2018-12-11T11:52:33Z","date_published":"2016-05-01T00:00:00Z","doi":"10.1016/j.artint.2016.01.007","acknowledgement":"We thank Blai Bonet for helping us with RTDP-Bel. The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","oa":1,"publisher":"Elsevier","quality_controlled":"1","citation":{"ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234. Elsevier, pp. 26–48, 2016.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2016.01.007","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 2016;234:26-48. doi:10.1016/j.artint.2016.01.007","mla":"Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence, vol. 234, Elsevier, 2016, pp. 26–48, doi:10.1016/j.artint.2016.01.007."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["1411.3880"]},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"last_name":"Kanodia","full_name":"Kanodia, Ayush","first_name":"Ayush"}],"publist_id":"5642","title":"Optimal cost almost-sure reachability in POMDPs","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1820"},{"status":"public","id":"5425","relation":"earlier_version"}]},"volume":234,"abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1411.3880"}],"scopus_import":1,"intvolume":" 234","month":"05","date_updated":"2023-02-23T12:25:49Z","department":[{"_id":"KrCh"}],"_id":"1529","type":"journal_article","status":"public"},{"type":"technical_report","pubrep_id":"523","status":"public","_id":"5445","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"department":[{"_id":"KrCh"}],"title":"Quantitative interprocedural analysis","file_date_updated":"2020-07-14T12:46:58Z","date_updated":"2023-02-23T10:06:22Z","citation":{"apa":"Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1","ama":"Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis. IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1","ieee":"K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.","short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.","mla":"Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis. IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.","ista":"Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","month":"03","abstract":[{"lang":"eng","text":"We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs. "}],"oa_version":"Published Version","page":"33","date_created":"2018-12-12T11:39:22Z","doi":"10.15479/AT:IST-2016-523-v1-1","related_material":{"record":[{"status":"public","id":"1604","relation":"later_version"}]},"date_published":"2016-03-31T00:00:00Z","year":"2016","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"file_id":"5513","checksum":"cef516fa091925b5868813e355268fb4","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:52Z","file_name":"IST-2016-523-v1+1_main.pdf","date_updated":"2020-07-14T12:46:58Z","file_size":1012204,"creator":"system"}],"day":"31"},{"_id":"1166","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"status":"public","type":"conference","conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"Phoenix, AZ, USA","end_date":"2016-02-17","start_date":"2016-02-12"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.","ista":"Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.","mla":"Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp. 3225–32.","ama":"Chatterjee K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. Vol 2016. AAAI Press; 2016:3225-3232.","apa":"Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.","short":"K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232."},"date_updated":"2023-02-23T12:26:41Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps","publist_id":"6191","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"full_name":"Davies, Jessica","last_name":"Davies","first_name":"Jessica","id":"378E0060-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","abstract":[{"lang":"eng","text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIMEcomplete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved."}],"month":"12","intvolume":" 2016","publisher":"AAAI Press","quality_controlled":"1","day":"02","language":[{"iso":"eng"}],"publication":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","publication_status":"published","year":"2016","related_material":{"link":[{"url":"https://dl.acm.org/citation.cfm?id=3016355","relation":"table_of_contents"}],"record":[{"status":"public","id":"5443","relation":"earlier_version"}]},"date_published":"2016-12-02T00:00:00Z","volume":2016,"ec_funded":1,"date_created":"2018-12-11T11:50:30Z","page":"3225 - 3232"},{"pubrep_id":"648","status":"public","type":"technical_report","_id":"5449","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:58Z","title":"Amplification on undirected population structures: Comets beat stars","author":[{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["519"],"citation":{"ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.","mla":"Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1."},"date_updated":"2023-02-23T12:22:21Z","month":"11","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa_version":"Updated Version","abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population.\r\nThe fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure.\r\nAmplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade.\r\nIn this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.","lang":"eng"}],"date_created":"2018-12-12T11:39:24Z","related_material":{"record":[{"relation":"later_version","id":"512","status":"public"}]},"date_published":"2016-11-09T00:00:00Z","doi":"10.15479/AT:IST-2016-648-v1-1","page":"22","language":[{"iso":"eng"}],"day":"09","file":[{"date_updated":"2020-07-14T12:46:58Z","file_size":1264221,"creator":"system","date_created":"2018-12-12T11:54:07Z","file_name":"IST-2016-648-v1+1_tr.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5529","checksum":"8345a8c1e7d7f0cd92516d182b7fc59e"}],"publication_status":"published","year":"2016","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"title":"Arbitrarily strong amplifiers of natural selection","file_date_updated":"2020-07-14T12:46:59Z","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:27:07Z","citation":{"mla":"Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2017-749-v3-1.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p."},"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","status":"public","pubrep_id":"755","_id":"5453","page":"34","related_material":{"record":[{"id":"5452","status":"public","relation":"earlier_version"}]},"doi":"10.15479/AT:IST-2017-749-v3-1","date_published":"2016-12-30T00:00:00Z","date_created":"2018-12-12T11:39:25Z","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","year":"2016","publication_status":"published","file":[{"file_id":"5474","checksum":"83b0313dab3bff4bdb6ac38695026fda","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-749-v3+1_main.pdf","date_created":"2018-12-12T11:53:13Z","creator":"system","file_size":1015647,"date_updated":"2020-07-14T12:46:59Z"}],"day":"30","language":[{"iso":"eng"}],"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"12","oa_version":"Published Version"},{"oa_version":"Published Version","month":"12","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","language":[{"iso":"eng"}],"day":"30","file":[{"date_updated":"2020-07-14T12:46:59Z","file_size":1014732,"creator":"system","date_created":"2018-12-12T11:53:04Z","file_name":"IST-2016-728-v1+1_main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"7b8bb17c322c0556acba6ac169fa71c1","file_id":"5465"}],"year":"2016","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:24Z","doi":"10.15479/AT:IST-2016-728-v1-1","date_published":"2016-12-30T00:00:00Z","page":"34","_id":"5451","pubrep_id":"728","status":"public","type":"technical_report","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2016-728-v1-1.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p."},"date_updated":"2023-02-23T12:27:05Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","title":"Strong amplifiers of natural selection","author":[{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}]},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ista":"Hilbe C, Hagel K, Milinski M. 2016. Experimental game instructions, Public Library of Science, 10.1371/journal.pone.0163867.s008.","chicago":"Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Experimental Game Instructions.” Public Library of Science, 2016. https://doi.org/10.1371/journal.pone.0163867.s008.","ieee":"C. Hilbe, K. Hagel, and M. Milinski, “Experimental game instructions.” Public Library of Science, 2016.","short":"C. Hilbe, K. Hagel, M. Milinski, (2016).","apa":"Hilbe, C., Hagel, K., & Milinski, M. (2016). Experimental game instructions. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867.s008","ama":"Hilbe C, Hagel K, Milinski M. Experimental game instructions. 2016. doi:10.1371/journal.pone.0163867.s008","mla":"Hilbe, Christian, et al. Experimental Game Instructions. Public Library of Science, 2016, doi:10.1371/journal.pone.0163867.s008."},"date_updated":"2023-02-21T16:59:01Z","department":[{"_id":"KrCh"}],"title":"Experimental game instructions","author":[{"first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","last_name":"Hilbe"},{"first_name":"Kristin","last_name":"Hagel","full_name":"Hagel, Kristin"},{"full_name":"Milinski, Manfred","last_name":"Milinski","first_name":"Manfred"}],"article_processing_charge":"No","_id":"9867","status":"public","type":"research_data_reference","day":"04","year":"2016","doi":"10.1371/journal.pone.0163867.s008","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1322"}]},"date_created":"2021-08-10T08:42:00Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In the beginning of our experiment, subjects were asked to read a few pages on their computer screens that would explain the rules of the subsequent game. Here, we provide these instructions, translated from German."}],"month":"10","publisher":"Public Library of Science"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867.","chicago":"Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.” PLoS One. Public Library of Science, 2016. https://doi.org/10.1371/journal.pone.0163867.","ama":"Hilbe C, Hagel K, Milinski M. Asymmetric power boosts extortion in an economic experiment. PLoS One. 2016;11(10). doi:10.1371/journal.pone.0163867","apa":"Hilbe, C., Hagel, K., & Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867","ieee":"C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” PLoS One, vol. 11, no. 10. Public Library of Science, 2016.","short":"C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).","mla":"Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.” PLoS One, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:10.1371/journal.pone.0163867."},"title":"Asymmetric power boosts extortion in an economic experiment","publist_id":"5948","author":[{"orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hagel, Kristin","last_name":"Hagel","first_name":"Kristin"},{"last_name":"Milinski","full_name":"Milinski, Manfred","first_name":"Manfred"}],"article_number":"e0163867","day":"04","publication":"PLoS One","has_accepted_license":"1","year":"2016","date_published":"2016-10-04T00:00:00Z","doi":"10.1371/journal.pone.0163867","date_created":"2018-12-11T11:51:22Z","acknowledgement":"CH was funded by the Schrödinger program of the Austrian Science Fund (FWF) J3475. ","publisher":"Public Library of Science","quality_controlled":"1","oa":1,"ddc":["004","006"],"date_updated":"2023-02-23T14:11:27Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:44Z","_id":"1322","status":"public","pubrep_id":"716","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_id":"4668","checksum":"6b33e394003dfe8b4ca6be1858aaa8e3","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:08:08Z","file_name":"IST-2016-716-v1+1_journal.pone.0163867.PDF","creator":"system","date_updated":"2020-07-14T12:44:44Z","file_size":2077905}],"language":[{"iso":"eng"}],"publication_status":"published","volume":11,"issue":"10","related_material":{"record":[{"relation":"research_data","id":"9867","status":"public"},{"status":"public","id":"9868","relation":"research_data"}]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Direct reciprocity is a major mechanism for the evolution of cooperation. Several classical studies have suggested that humans should quickly learn to adopt reciprocal strategies to establish mutual cooperation in repeated interactions. On the other hand, the recently discovered theory of ZD strategies has found that subjects who use extortionate strategies are able to exploit and subdue cooperators. Although such extortioners have been predicted to succeed in any population of adaptive opponents, theoretical follow-up studies questioned whether extortion can evolve in reality. However, most of these studies presumed that individuals have similar strategic possibilities and comparable outside options, whereas asymmetries are ubiquitous in real world applications. Here we show with a model and an economic experiment that extortionate strategies readily emerge once subjects differ in their strategic power. Our experiment combines a repeated social dilemma with asymmetric partner choice. In our main treatment there is one randomly chosen group member who is unilaterally allowed to exchange one of the other group members after every ten rounds of the social dilemma. We find that this asymmetric replacement opportunity generally promotes cooperation, but often the resulting payoff distribution reflects the underlying power structure. Almost half of the subjects in a better strategic position turn into extortioners, who quickly proceed to exploit their peers. By adapting their cooperation probabilities consistent with ZD theory, extortioners force their co-players to cooperate without being similarly cooperative themselves. Comparison to non-extortionate players under the same conditions indicates a substantial net gain to extortion. Our results thus highlight how power asymmetries can endanger mutually beneficial interactions, and transform them into exploitative relationships. In particular, our results indicate that the extortionate strategies predicted from ZD theory could play a more prominent role in our daily interactions than previously thought."}],"month":"10","intvolume":" 11","scopus_import":1},{"_id":"9868","type":"research_data_reference","status":"public","citation":{"chicago":"Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Experimental Data.” Public Library of Science, 2016. https://doi.org/10.1371/journal.pone.0163867.s009.","ista":"Hilbe C, Hagel K, Milinski M. 2016. Experimental data, Public Library of Science, 10.1371/journal.pone.0163867.s009.","mla":"Hilbe, Christian, et al. Experimental Data. Public Library of Science, 2016, doi:10.1371/journal.pone.0163867.s009.","ieee":"C. Hilbe, K. Hagel, and M. Milinski, “Experimental data.” Public Library of Science, 2016.","short":"C. Hilbe, K. Hagel, M. Milinski, (2016).","ama":"Hilbe C, Hagel K, Milinski M. Experimental data. 2016. doi:10.1371/journal.pone.0163867.s009","apa":"Hilbe, C., Hagel, K., & Milinski, M. (2016). Experimental data. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867.s009"},"date_updated":"2023-02-21T16:59:01Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Hilbe","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X"},{"first_name":"Kristin","last_name":"Hagel","full_name":"Hagel, Kristin"},{"last_name":"Milinski","full_name":"Milinski, Manfred","first_name":"Manfred"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"title":"Experimental data","abstract":[{"lang":"eng","text":"The raw data file containing the experimental decisions of all our study subjects."}],"oa_version":"Published Version","publisher":"Public Library of Science","month":"10","year":"2016","day":"04","doi":"10.1371/journal.pone.0163867.s009","related_material":{"record":[{"relation":"used_in_publication","id":"1322","status":"public"}]},"date_published":"2016-10-04T00:00:00Z","date_created":"2021-08-10T08:45:00Z"},{"_id":"1397","type":"dissertation","status":"public","citation":{"ieee":"M. Chmelik, “Algorithms for partially observable markov decision processes,” Institute of Science and Technology Austria, 2016.","short":"M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, Institute of Science and Technology Austria, 2016.","apa":"Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.","ama":"Chmelik M. Algorithms for partially observable markov decision processes. 2016.","mla":"Chmelik, Martin. Algorithms for Partially Observable Markov Decision Processes. Institute of Science and Technology Austria, 2016.","ista":"Chmelik M. 2016. Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.","chicago":"Chmelik, Martin. “Algorithms for Partially Observable Markov Decision Processes.” Institute of Science and Technology Austria, 2016."},"date_updated":"2023-09-07T11:54:58Z","supervisor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"}],"publist_id":"5810","department":[{"_id":"KrCh"}],"title":"Algorithms for partially observable markov decision processes","abstract":[{"text":"We study partially observable Markov decision processes (POMDPs) with objectives used in verification and artificial intelligence. The qualitative analysis problem given a POMDP and an objective asks whether there is a strategy (policy) to ensure that the objective is satisfied almost surely (with probability 1), resp. with positive probability (with probability greater than 0). For POMDPs with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the payoff of an infinite path is the long-run average of the rewards, we consider two types of path constraints: (i) a quantitative limit-average constraint defines the set of paths where the payoff is at least a given threshold L1 = 1. Our main results for qualitative limit-average constraint under almost-sure winning are as follows: (i) the problem of deciding the existence of a finite-memory controller is EXPTIME-complete; and (ii) the problem of deciding the existence of an infinite-memory controller is undecidable. For quantitative limit-average constraints we show that the problem of deciding the existence of a finite-memory controller is undecidable. We present a prototype implementation of our EXPTIME algorithm. For POMDPs with w-regular conditions specified as parity objectives, while the qualitative analysis problems are known to be undecidable even for very special case of parity objectives, we establish decidability (with optimal complexity) of the qualitative analysis problems for POMDPs with parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. Based on our theoretical algorithms we also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of well-known POMDP examples for robotics applications. For POMDPs with a set of target states and an integer cost associated with every transition, we study the optimization objective that asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely. We show that for general integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double and exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms that extend existing algorithms for POMDPs with finite-horizon objectives. We show experimentally that it performs well in many examples of interest. We study more deeply the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a strategy to ensure that the target set is reached almost surely. While in general the problem EXPTIME-complete, in many practical cases strategies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. We first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. Decentralized POMDPs (DEC-POMDPs) extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. In this work we consider Goal DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the real-time dynamic programming approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. In the end we present a short summary of a few other results related to verification of MDPs and POMDPs.","lang":"eng"}],"oa_version":"None","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","month":"02","degree_awarded":"PhD","year":"2016","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"day":"01","page":"232","date_created":"2018-12-11T11:51:47Z","date_published":"2016-02-01T00:00:00Z"},{"file":[{"file_id":"4895","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf","date_created":"2018-12-12T10:11:39Z","creator":"system","file_size":501827,"date_updated":"2018-12-12T10:11:39Z"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":59,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1155"}]},"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results. "}],"month":"08","intvolume":" 59","alternative_title":["LIPIcs"],"scopus_import":1,"ddc":["004"],"date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"file_date_updated":"2018-12-12T10:11:39Z","_id":"1093","status":"public","pubrep_id":"794","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CONCUR: Concurrency Theory","start_date":"2016-08-23","end_date":"2016-08-26","location":"Quebec City; Canada"},"day":"01","has_accepted_license":"1","year":"2016","doi":"10.4230/LIPIcs.CONCUR.2016.20","date_published":"2016-08-01T00:00:00Z","date_created":"2018-12-11T11:50:06Z","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF) under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award), by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced Postdoc. Mobility Fellowship – grant number P300P2_161067.","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.20","mla":"Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20."},"title":"Linear distances between Markov chains","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","last_name":"Petrov"}],"publist_id":"6283","article_number":"20","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}]},{"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant (279307: Graph Games).","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","day":"01","year":"2016","has_accepted_license":"1","date_created":"2018-12-11T11:49:59Z","date_published":"2016-08-01T00:00:00Z","doi":"10.4230/LIPIcs.ESA.2016.28","article_number":"28","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.","mla":"Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57."},"title":"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs","publist_id":"6312","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W=Theta(log n). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries. The data-structure uses at all times O(n) space. Our second contribution is a space-time tradeoff data-structure for distance queries. For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing time that allows pair queries in O(n^{1-\\epsilon} alpha(n)) time, where alpha is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space. The input graph G is not considered in the space complexity. "}],"intvolume":" 57","month":"08","scopus_import":1,"alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"file":[{"date_updated":"2018-12-12T10:14:31Z","file_size":579225,"creator":"system","date_created":"2018-12-12T10:14:31Z","file_name":"IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5084"}],"publication_status":"published","ec_funded":1,"volume":57,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"821"}]},"_id":"1071","pubrep_id":"777","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ESA: European Symposium on Algorithms","start_date":"2016-08-22","end_date":"2016-08-24","location":"Aarhus, Denmark"},"type":"conference","ddc":["004","006"],"date_updated":"2023-09-07T12:01:58Z","file_date_updated":"2018-12-12T10:14:31Z","department":[{"_id":"KrCh"}]},{"scopus_import":1,"alternative_title":["POPL"],"main_file_link":[{"url":"http://arxiv.org/abs/1510.08517","open_access":"1"}],"month":"01","abstract":[{"text":"In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) 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); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism.","lang":"eng"}],"oa_version":"Preprint","related_material":{"record":[{"status":"public","id":"5993","relation":"later_version"}]},"volume":"20-22","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"type":"conference","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA","start_date":"2016-01-20"},"status":"public","_id":"1438","department":[{"_id":"KrCh"}],"date_updated":"2023-09-19T14:38:41Z","publisher":"ACM","quality_controlled":"1","oa":1,"acknowledgement":"Supported by the Natural Science Foundation of China (NSFC) under Grant No. 61532019 ","page":"327 - 342","date_published":"2016-01-11T00:00:00Z","doi":"10.1145/2837614.2837639","date_created":"2018-12-11T11:52:01Z","year":"2016","day":"11","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"publist_id":"5760","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny"},{"full_name":"Hasheminezhad, Rouzbeh","last_name":"Hasheminezhad","first_name":"Rouzbeh"}],"external_id":{"arxiv":["1510.08517"]},"title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","citation":{"apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:10.1145/2837614.2837639","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.","mla":"Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016, pp. 327–42, doi:10.1145/2837614.2837639.","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. https://doi.org/10.1145/2837614.2837639."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","ddc":["000"],"date_updated":"2024-02-21T13:48:42Z","status":"public","pubrep_id":"750","type":"technical_report","_id":"5452","related_material":{"record":[{"status":"public","id":"5453","relation":"later_version"},{"status":"public","id":"5559","relation":"popular_science"}]},"ec_funded":1,"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5460","checksum":"58e895f26c82f560c0f0989bf8b08599","creator":"system","date_updated":"2020-07-14T12:46:59Z","file_size":811558,"date_created":"2018-12-12T11:52:59Z","file_name":"IST-2017-728-v2+1_main.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","month":"12","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","title":"Arbitrarily strong amplifiers of natural selection","author":[{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1","mla":"Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1."},"project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_published":"2016-12-30T00:00:00Z","doi":"10.15479/AT:IST-2017-728-v2-1","date_created":"2018-12-12T11:39:25Z","page":"32","day":"30","has_accepted_license":"1","year":"2016","publisher":"IST Austria","oa":1},{"day":"11","year":"2016","date_published":"2016-01-11T00:00:00Z","doi":"10.1145/2837614.2837624","date_created":"2018-12-11T11:52:01Z","page":"733 - 747","quality_controlled":"1","publisher":"ACM","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: Vol 20-22. ACM; 2016:733-747. doi:10.1145/2837614.2837624","mla":"Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016, pp. 733–47, doi:10.1145/2837614.2837624.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624."},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","publist_id":"5761","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir","last_name":"Goharshady","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1510.07565"]},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"id":"5441","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5442"},{"id":"821","status":"public","relation":"dissertation_contains"},{"id":"6009","status":"public","relation":"later_version"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"volume":"20-22","ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.","lang":"eng"}],"month":"01","alternative_title":["POPL"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.07565"}],"date_updated":"2024-03-27T23:30:32Z","department":[{"_id":"KrCh"}],"_id":"1437","status":"public","type":"conference","conference":{"name":"POPL: Principles of Programming Languages","location":"St. Petersburg, FL, USA","end_date":"2016-01-22","start_date":"2016-01-20"}},{"page":"3 - 22","date_published":"2016-07-01T00:00:00Z","doi":"10.1007/978-3-319-41528-4_1","date_created":"2018-12-11T11:51:43Z","year":"2016","day":"01","publisher":"Springer","quality_controlled":"1","oa":1,"publist_id":"5824","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","full_name":"Fu, Hongfei"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir"}],"title":"Termination analysis of probabilistic programs through Positivstellensatz's","citation":{"chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer, 2016. https://doi.org/10.1007/978-3-319-41528-4_1.","ista":"Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779, 3–22.","mla":"Chatterjee, Krishnendu, et al. Termination Analysis of Probabilistic Programs through Positivstellensatz’s. Vol. 9779, Springer, 2016, pp. 3–22, doi:10.1007/978-3-319-41528-4_1.","apa":"Chatterjee, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1","ama":"Chatterjee K, Fu H, Goharshady AK. Termination analysis of probabilistic programs through Positivstellensatz’s. In: Vol 9779. Springer; 2016:3-22. doi:10.1007/978-3-319-41528-4_1","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"volume":9779,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1604.07169","open_access":"1"}],"month":"07","intvolume":" 9779","abstract":[{"lang":"eng","text":"We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and on the other hand is a counterpart of polynomial ranking-functions for proving termination of nonprobabilistic programs. The approach synthesizes polynomial ranking-supermartingales through Positivstellensatz's, yielding an efficient method which is not only sound, but also semi-complete over a large subclass of programs. We show experimental results to demonstrate that our approach can handle several classical programs with complex polynomial guards and assignments, and can synthesize efficient quadratic ranking-supermartingales when a linear one does not exist even for simple affine programs."}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:32Z","type":"conference","conference":{"location":"Toronto, Canada","end_date":"2016-07-23","start_date":"2016-07-17","name":"CAV: Computer Aided Verification"},"status":"public","_id":"1386"},{"department":[{"_id":"KrCh"}],"date_updated":"2022-02-25T12:33:32Z","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"San Diego, CA, United States","end_date":"2015-01-06","start_date":"2015-01-04"},"status":"public","_id":"10796","issue":"1","volume":2015,"ec_funded":1,"publication_identifier":{"isbn":["978-161197374-7"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","month":"01","intvolume":" 2015","abstract":[{"lang":"eng","text":"We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy)."}],"oa_version":"Preprint","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"}],"article_processing_charge":"No","external_id":{"arxiv":["1409.6690"]},"title":"The value 1 problem under finite-memory strategies for concurrent mean-payoff games","citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2015, no. 1, SIAM, 2015, pp. 1018–29, doi:10.1137/1.9781611973730.69.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.","ama":"Chatterjee K, Ibsen-Jensen R. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2015. SIAM; 2015:1018-1029. doi:10.1137/1.9781611973730.69","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM. https://doi.org/10.1137/1.9781611973730.69","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29. SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.","ista":"Chatterjee K, Ibsen-Jensen R. 2015. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2015, 1018–1029."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"1018-1029","doi":"10.1137/1.9781611973730.69","date_published":"2015-01-01T00:00:00Z","date_created":"2022-02-25T12:18:43Z","year":"2015","day":"01","publication":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","publisher":"SIAM","quality_controlled":"1","acknowledgement":"The research was partly supported by FWF Grant No P 23499-N23, FWF NFN Grant\r\nNo S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award."},{"_id":"1499","type":"conference","conference":{"end_date":"2015-09-04","location":"Madrid, Spain","start_date":"2015-09-01","name":"CONCUR: Concurrency Theory"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"498","date_updated":"2021-01-12T06:51:10Z","ddc":["000","003"],"file_date_updated":"2020-07-14T12:44:58Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"abstract":[{"text":"We consider weighted automata with both positive and negative integer weights on edges and\r\nstudy the problem of synchronization using adaptive strategies that may only observe whether\r\nthe current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"01","intvolume":" 42","publication_status":"published","file":[{"file_id":"4672","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2016-498-v1+1_32.pdf","date_created":"2018-12-12T10:08:12Z","file_size":623563,"date_updated":"2020-07-14T12:44:58Z","creator":"system"}],"language":[{"iso":"eng"}],"volume":42,"ec_funded":1,"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"citation":{"ista":"Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability of weighted synchronization under partial observability. CONCUR: Concurrency Theory, LIPIcs, vol. 42, 142–154.","chicago":"Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time Decidability of Weighted Synchronization under Partial Observability,” 42:142–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.","apa":"Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142","ama":"Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. doi:10.4230/LIPIcs.CONCUR.2015.142","ieee":"J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.","short":"J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.","mla":"Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Larsen, Kim","last_name":"Larsen","first_name":"Kim"},{"first_name":"Simon","last_name":"Laursen","full_name":"Laursen, Simon"},{"first_name":"Jiří","full_name":"Srba, Jiří","last_name":"Srba"}],"publist_id":"5680","title":"Polynomial time decidability of weighted synchronization under partial observability","acknowledgement":"The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement 601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM), the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), the Czech Science Foundation under grant agreement P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2015","day":"01","page":"142 - 154","doi":"10.4230/LIPIcs.CONCUR.2015.142","date_published":"2015-01-01T00:00:00Z","date_created":"2018-12-11T11:52:22Z"},{"type":"journal_article","status":"public","_id":"1559","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:51:36Z","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4697423/"}],"month":"12","intvolume":" 112","abstract":[{"text":"There are deep, yet largely unexplored, connections between computer science and biology. Both disciplines examine how information proliferates in time and space. Central results in computer science describe the complexity of algorithms that solve certain classes of problems. An algorithm is deemed efficient if it can solve a problem in polynomial time, which means the running time of the algorithm is a polynomial function of the length of the input. There are classes of harder problems for which the fastest possible algorithm requires exponential time. Another criterion is the space requirement of the algorithm. There is a crucial distinction between algorithms that can find a solution, verify a solution, or list several distinct solutions in given time and space. The complexity hierarchy that is generated in this way is the foundation of theoretical computer science. Precise complexity results can be notoriously difficult. The famous question whether polynomial time equals nondeterministic polynomial time (i.e., P = NP) is one of the hardest open problems in computer science and all of mathematics. Here, we consider simple processes of ecological and evolutionary spatial dynamics. The basic question is: What is the probability that a new invader (or a new mutant)will take over a resident population?We derive precise complexity results for a variety of scenarios. We therefore show that some fundamental questions in this area cannot be answered by simple equations (assuming that P is not equal to NP).","lang":"eng"}],"pmid":1,"oa_version":"Submitted Version","volume":112,"issue":"51","publication_status":"published","language":[{"iso":"eng"}],"publist_id":"5612","author":[{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"external_id":{"pmid":["26644569"]},"title":"Computational complexity of ecological and evolutionary spatial dynamics","citation":{"ista":"Ibsen-Jensen R, Chatterjee K, Nowak M. 2015. Computational complexity of ecological and evolutionary spatial dynamics. PNAS. 112(51), 15636–15641.","chicago":"Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511366112.","ieee":"R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51. National Academy of Sciences, pp. 15636–15641, 2015.","short":"R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.","ama":"Ibsen-Jensen R, Chatterjee K, Nowak M. Computational complexity of ecological and evolutionary spatial dynamics. PNAS. 2015;112(51):15636-15641. doi:10.1073/pnas.1511366112","apa":"Ibsen-Jensen, R., Chatterjee, K., & Nowak, M. (2015). Computational complexity of ecological and evolutionary spatial dynamics. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1511366112","mla":"Ibsen-Jensen, Rasmus, et al. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS, vol. 112, no. 51, National Academy of Sciences, 2015, pp. 15636–41, doi:10.1073/pnas.1511366112."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"National Academy of Sciences","oa":1,"page":"15636 - 15641","date_published":"2015-12-22T00:00:00Z","doi":"10.1073/pnas.1511366112","date_created":"2018-12-11T11:52:43Z","year":"2015","day":"22","publication":"PNAS"},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2021-01-12T06:51:50Z","status":"public","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2015-11-28","location":"Suva, Fiji","start_date":"2015-11-24"},"type":"conference","_id":"1594","ec_funded":1,"volume":9450,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 9450","month":"11","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of events along an execution. Such an extension is particularly useful for probabilistic systems that often cannot fulfil strict qualitative guarantees on the behaviour. It has been recently shown that controller synthesis for Markov decision processes and fLTL is decidable when all the bounds on frequencies are 1. As a step towards a complete quantitative solution, we show that the problem is decidable for the fragment fLTL\\GU, where U does not occur in the scope of G (but still F can). Our solution is based on a novel translation of such quantitative formulae into equivalent deterministic automata."}],"title":"Controller synthesis for MDPs and frequency LTL\\GU","author":[{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"full_name":"Krčál, Jan","last_name":"Krčál","first_name":"Jan"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"}],"publist_id":"5577","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"V. Forejt, J. Krčál, and J. Kretinsky, “Controller synthesis for MDPs and frequency LTL\\GU,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji, 2015, vol. 9450, pp. 162–177.","short":"V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.","apa":"Forejt, V., Krčál, J., & Kretinsky, J. (2015). Controller synthesis for MDPs and frequency LTL\\GU (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer. https://doi.org/10.1007/978-3-662-48899-7_12","ama":"Forejt V, Krčál J, Kretinsky J. Controller synthesis for MDPs and frequency LTL\\GU. In: Vol 9450. Springer; 2015:162-177. doi:10.1007/978-3-662-48899-7_12","mla":"Forejt, Vojtěch, et al. Controller Synthesis for MDPs and Frequency LTL\\GU. Vol. 9450, Springer, 2015, pp. 162–77, doi:10.1007/978-3-662-48899-7_12.","ista":"Forejt V, Krčál J, Kretinsky J. 2015. Controller synthesis for MDPs and frequency LTL\\GU. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 9450, 162–177.","chicago":"Forejt, Vojtěch, Jan Krčál, and Jan Kretinsky. “Controller Synthesis for MDPs and Frequency LTL\\GU,” 9450:162–77. Springer, 2015. https://doi.org/10.1007/978-3-662-48899-7_12."},"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"date_created":"2018-12-11T11:52:55Z","doi":"10.1007/978-3-662-48899-7_12","date_published":"2015-11-22T00:00:00Z","page":"162 - 177","day":"22","year":"2015","publisher":"Springer","quality_controlled":"1","acknowledgement":"This work is partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by the Czech Science Foundation under grant agreement P202/12/G061, by the EU 7th Framework Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the CDZ project 1023 (CAP), by the CAS/SAFEA International Partnership Program for Creative Research Teams, by the EPSRC grant EP/M023656/1, by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734, by the Austrian Science Fund (FWF) S11407-N23 (RiSE/SHiNE), and by the ERC Start Grant (279307: Graph Games).\r\n"}]