[{"publication":"Cell","quality_controlled":"1","year":"2015","doi":"10.1016/j.cell.2015.09.037","date_published":"2015-10-22T00:00:00Z","intvolume":" 163","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","citation":{"chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” *Cell*. Cell Press, 2015. https://doi.org/10.1016/j.cell.2015.09.037.","ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. *Cell*. 2015;163(3):670-683. doi:10.1016/j.cell.2015.09.037","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. *Cell*. Cell Press. https://doi.org/10.1016/j.cell.2015.09.037","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” *Cell*, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:10.1016/j.cell.2015.09.037.","ieee":"W. Li *et al.*, “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” *Cell*, vol. 163, no. 3. Cell Press, pp. 670–683, 2015."},"abstract":[{"text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants.","lang":"eng"}],"author":[{"first_name":"Wenyang","last_name":"Li","full_name":"Li, Wenyang"},{"full_name":"Ma, Mengdi","last_name":"Ma","first_name":"Mengdi"},{"last_name":"Feng","first_name":"Ying","full_name":"Feng, Ying"},{"first_name":"Hongjiang","last_name":"Li","orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wang, Yichuan","first_name":"Yichuan","last_name":"Wang"},{"full_name":"Ma, Yutong","last_name":"Ma","first_name":"Yutong"},{"full_name":"Li, Mingzhe","first_name":"Mingzhe","last_name":"Li"},{"full_name":"An, Fengying","first_name":"Fengying","last_name":"An"},{"last_name":"Guo","first_name":"Hongwei","full_name":"Guo, Hongwei"}],"day":"22","page":"670 - 683","language":[{"iso":"eng"}],"month":"10","type":"journal_article","publist_id":"7285","date_created":"2018-12-11T11:47:00Z","publication_status":"published","date_updated":"2021-01-12T08:01:27Z","issue":"3","status":"public","oa_version":"None","publisher":"Cell Press","volume":163,"scopus_import":1,"_id":"532","department":[{"_id":"JiFr"}]},{"date_updated":"2021-01-12T08:02:15Z","publication_status":"published","ddc":["004"],"related_material":{"record":[{"id":"466","relation":"later_version","status":"public"},{"relation":"later_version","status":"public","id":"1657"},{"status":"public","relation":"later_version","id":"5435"}]},"date_created":"2018-12-12T11:39:17Z","_id":"5429","file":[{"date_created":"2018-12-12T11:54:11Z","creator":"system","date_updated":"2020-07-14T12:46:52Z","access_level":"open_access","file_size":689863,"relation":"main_file","file_id":"5533","file_name":"IST-2015-318-v1+1_main.pdf","content_type":"application/pdf","checksum":"e4869a584567c506349abda9c8ec7db3"}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:52Z","has_accepted_license":"1","publisher":"IST Austria","oa_version":"Published Version","status":"public","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2015-318-v1-1","date_published":"2015-01-12T00:00:00Z","pubrep_id":"318","year":"2015","page":"41","day":"12","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"month":"01","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. *Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. *Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes*. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). *Unifying two views on multiple mean-payoff objectives in Markov decision processes*. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, *Unifying two views on multiple mean-payoff objectives in Markov decision processes*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes*. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1."},"oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Zuzana","last_name":"Komarkova","full_name":"Komarkova, Zuzana"},{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been 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. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem 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.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem."}]},{"year":"2015","doi":"10.15479/AT:IST-2015-319-v1-1","date_published":"2015-02-10T00:00:00Z","pubrep_id":"319","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). *Faster algorithms for quantitative verification in constant treewidth graphs*. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, *Faster algorithms for quantitative verification in constant treewidth graphs*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1."},"title":"Faster algorithms for quantitative verification in constant treewidth graphs","oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"}],"abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"page":"31","day":"10","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"month":"02","publication_status":"published","date_created":"2018-12-12T11:39:17Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"1607"},{"relation":"later_version","status":"public","id":"5437"}]},"ddc":["000"],"date_updated":"2021-01-12T08:02:17Z","oa_version":"Published Version","publisher":"IST Austria","status":"public","publication_identifier":{"issn":["2664-1690"]},"department":[{"_id":"KrCh"}],"_id":"5430","file":[{"content_type":"application/pdf","file_name":"IST-2015-319-v1+1_long.pdf","file_id":"5482","access_level":"open_access","file_size":1089651,"relation":"main_file","checksum":"62c6ea01e342553dcafb88a070fb1ad5","date_created":"2018-12-12T11:53:21Z","date_updated":"2020-07-14T12:46:52Z","creator":"system"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:52Z"},{"date_created":"2018-12-12T11:39:17Z","ddc":["005","519"],"publication_status":"published","date_updated":"2021-01-12T08:02:13Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","oa_version":"Published Version","publisher":"IST Austria","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:53Z","file":[{"checksum":"bfb858262c30445b8e472c40069178a2","access_level":"open_access","file_size":661015,"relation":"main_file","file_name":"IST-2015-322-v1+1_safetygames.pdf","file_id":"5491","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:53:31Z"}],"_id":"5431","department":[{"_id":"KrCh"}],"year":"2015","pubrep_id":"322","date_published":"2015-02-19T00:00:00Z","doi":"10.15479/AT:IST-2015-322-v1-1","abstract":[{"text":"We consider finite-state concurrent stochastic games, played by k>=2 players 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. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are 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.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-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. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential.","lang":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Kristoffer","last_name":"Hansen","full_name":"Hansen, Kristoffer"}],"oa":1,"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. *The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives*. IST Austria; 2015. doi:10.15479/AT:IST-2015-322-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). *The patience of concurrent stochastic games with safety and reachability objectives*. IST Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. *The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.","mla":"Chatterjee, Krishnendu, et al. *The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives*. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, *The patience of concurrent stochastic games with safety and reachability objectives*. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015."},"title":"The patience of concurrent stochastic games with safety and reachability objectives","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"day":"19","page":"25"},{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5421"},{"id":"5440","status":"public","relation":"later_version"}]},"ddc":["005","576"],"date_created":"2018-12-12T11:39:18Z","publication_status":"published","date_updated":"2021-01-12T08:02:20Z","status":"public","publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","oa_version":"Published Version","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:53Z","department":[{"_id":"KrCh"}],"_id":"5432","file":[{"checksum":"546c1b291d545e7b24aaaf4199dac671","access_level":"open_access","file_size":576347,"relation":"main_file","file_id":"5519","content_type":"application/pdf","file_name":"IST-2015-323-v1+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:53:57Z"}],"year":"2015","pubrep_id":"323","doi":"10.15479/AT:IST-2015-323-v1-1","date_published":"2015-02-19T00:00:00Z","oa":1,"title":"The complexity of evolutionary games on graphs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. *The Complexity of Evolutionary Games on Graphs*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. *The Complexity of Evolutionary Games on Graphs*. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v1-1","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). *The complexity of evolutionary games on graphs*. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, *The complexity of evolutionary games on graphs*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *The Complexity of Evolutionary Games on Graphs*. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1."},"abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n"}],"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"alternative_title":["IST Austria Technical Report"],"day":"19","page":"29","month":"02","language":[{"iso":"eng"}],"type":"technical_report"},{"citation":{"ieee":"1 Anonymous and 2 Anonymous, *Optimal cost indefinite-horizon reachability in goal DEC-POMDPs*. IST Austria, 2015.","mla":"Anonymous, 1, and 2 Anonymous. *Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs*. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.","apa":"Anonymous, 1, & Anonymous, 2. (2015). *Optimal cost indefinite-horizon reachability in goal DEC-POMDPs*. IST Austria.","ama":"Anonymous 1, Anonymous 2. *Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs*. IST Austria; 2015.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","chicago":"Anonymous, 1, and 2 Anonymous. *Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs*. IST Austria, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","oa":1,"author":[{"full_name":"Anonymous, 1","last_name":"Anonymous","first_name":"1"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"}],"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 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 our approach presents promising results."}],"day":"19","page":"16","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"month":"02","year":"2015","date_published":"2015-02-19T00:00:00Z","pubrep_id":"326","publisher":"IST Austria","oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"status":"public","file":[{"checksum":"8542fd0b10aed7811cd41077b8ccb632","file_size":378162,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"IST-2015-326-v1+1_main.pdf","file_id":"5475","creator":"system","date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:53:14Z"},{"checksum":"84c31c537bdaf7a91909f18d25d640ab","file_size":64,"relation":"main_file","access_level":"closed","content_type":"text/plain","file_id":"6317","file_name":"IST-2015-326-v1+2_authors.txt","date_updated":"2020-07-14T12:46:53Z","creator":"dernst","date_created":"2019-04-16T13:00:33Z"}],"_id":"5434","file_date_updated":"2020-07-14T12:46:53Z","has_accepted_license":"1","publication_status":"published","ddc":["000"],"date_created":"2018-12-12T11:39:18Z","date_updated":"2020-07-14T23:04:59Z"},{"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been 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. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe 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. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem."}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Komarkova","first_name":"Zuzana","full_name":"Komarkova, Zuzana"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan"}],"oa":1,"citation":{"short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes*. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, *Unifying two views on multiple mean-payoff objectives in Markov decision processes*. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. *Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). *Unifying two views on multiple mean-payoff objectives in Markov decision processes*. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. *Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes*. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v2-1"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","month":"02","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"day":"23","page":"51","year":"2015","pubrep_id":"327","doi":"10.15479/AT:IST-2015-318-v2-1","date_published":"2015-02-23T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","publisher":"IST Austria","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:53Z","has_accepted_license":"1","_id":"5435","file":[{"date_created":"2018-12-12T11:54:03Z","date_updated":"2020-07-14T12:46:53Z","creator":"system","relation":"main_file","file_size":717630,"access_level":"open_access","file_name":"IST-2015-318-v2+1_main.pdf","content_type":"application/pdf","file_id":"5525","checksum":"75284adec80baabdfe71ff9ebbc27445"}],"department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"5429","relation":"earlier_version","status":"public"},{"status":"public","relation":"later_version","id":"466"},{"id":"1657","relation":"later_version","status":"public"}]},"date_created":"2018-12-12T11:39:19Z","ddc":["004"],"publication_status":"published","date_updated":"2021-01-12T08:02:15Z"},{"date_published":"2015-04-24T00:00:00Z","doi":"10.15479/AT:IST-2015-170-v2-2","pubrep_id":"331","year":"2015","type":"technical_report","language":[{"iso":"eng"}],"month":"04","day":"24","page":"29","alternative_title":["IST Austria Technical Report"],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"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, nor in any other know 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.\r\nIn 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 run-time 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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Nested weighted automata","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). *Nested weighted automata*. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2","ama":"Chatterjee K, Henzinger TA, Otop J. *Nested Weighted Automata*. IST Austria; 2015. doi:10.15479/AT:IST-2015-170-v2-2","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. *Nested Weighted Automata*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, *Nested weighted automata*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Nested Weighted Automata*. IST Austria, 2015, doi:10.15479/AT:IST-2015-170-v2-2.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015."},"oa":1,"date_updated":"2021-01-12T08:02:16Z","publication_status":"published","date_created":"2018-12-12T11:39:19Z","ddc":["000"],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5415"},{"id":"467","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"1656"}]},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"5436","file":[{"checksum":"3c402f47d3669c28d04d1af405a08e3f","relation":"main_file","file_size":569991,"access_level":"open_access","file_id":"5541","file_name":"IST-2015-170-v2+2_report.pdf","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:54Z","date_created":"2018-12-12T11:54:19Z"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:54Z","publisher":"IST Austria","oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"status":"public"},{"year":"2015","doi":"10.15479/AT:IST-2015-330-v2-1","date_published":"2015-04-27T00:00:00Z","pubrep_id":"333","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722"}],"abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. \r\nThe algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main theoretical results are as follows.\r\nFirst, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when the output is $\\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$ and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). *Faster algorithms for quantitative verification in constant treewidth graphs*. IST Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria; 2015. doi:10.15479/AT:IST-2015-330-v2-1","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, *Faster algorithms for quantitative verification in constant treewidth graphs*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1."},"title":"Faster algorithms for quantitative verification in constant treewidth graphs","oa":1,"type":"technical_report","language":[{"iso":"eng"}],"month":"04","page":"27","day":"27","alternative_title":["IST Austria Technical Report"],"publication_status":"published","ddc":["000"],"date_created":"2018-12-12T11:39:19Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5430"},{"relation":"later_version","status":"public","id":"1607"}]},"date_updated":"2021-01-12T08:02:17Z","publisher":"IST Austria","oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"status":"public","department":[{"_id":"KrCh"}],"_id":"5437","file":[{"relation":"main_file","file_size":1072137,"access_level":"open_access","file_name":"IST-2015-330-v2+1_main.pdf","file_id":"5473","content_type":"application/pdf","checksum":"f5917c20f84018b362d385c000a2e123","date_created":"2018-12-12T11:53:12Z","creator":"system","date_updated":"2020-07-14T12:46:54Z"}],"file_date_updated":"2020-07-14T12:46:54Z","has_accepted_license":"1"},{"pubrep_id":"334","doi":"10.15479/AT:IST-2015-334-v1-1","date_published":"2015-05-05T00:00:00Z","year":"2015","language":[{"iso":"eng"}],"month":"05","type":"technical_report","alternative_title":["IST Austria Technical Report"],"page":"15","day":"05","abstract":[{"lang":"eng","text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe 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 deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. "}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"oa":1,"title":"Edit distance for pushdown automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. *Edit Distance for Pushdown Automata*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). *Edit distance for pushdown automata*. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. *Edit Distance for Pushdown Automata*. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Edit Distance for Pushdown Automata*. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, *Edit distance for pushdown automata*. IST Austria, 2015."},"date_updated":"2021-01-12T08:02:18Z","date_created":"2018-12-12T11:39:20Z","ddc":["004"],"related_material":{"record":[{"status":"public","relation":"later_version","id":"465"},{"id":"1610","relation":"later_version","status":"public"}]},"publication_status":"published","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:55Z","department":[{"_id":"KrCh"}],"_id":"5438","file":[{"checksum":"8a5f2d77560e552af87eb1982437a43b","relation":"main_file","access_level":"open_access","file_size":422573,"file_name":"IST-2015-334-v1+1_report.pdf","content_type":"application/pdf","file_id":"5518","creator":"system","date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:53:56Z"}],"publication_identifier":{"issn":["2664-1690"]},"status":"public","oa_version":"Published Version","publisher":"IST Austria"},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"1659"}]},"date_created":"2018-12-12T11:39:20Z","ddc":["004","512","513"],"publication_status":"published","date_updated":"2021-01-12T08:02:19Z","status":"public","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:55Z","has_accepted_license":"1","_id":"5439","department":[{"_id":"ToHe"}],"file":[{"checksum":"40405907aa012acece1bc26cf0be554d","access_level":"open_access","relation":"main_file","file_size":589619,"content_type":"application/pdf","file_id":"5517","file_name":"IST-2015-335-v1+1_report.pdf","creator":"system","date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:53:55Z"}],"year":"2015","pubrep_id":"335","date_published":"2015-05-18T00:00:00Z","doi":"10.15479/AT:IST-2015-335-v1-1","abstract":[{"lang":"eng","text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata. "}],"author":[{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"oa":1,"citation":{"ieee":"U. Boker, T. A. Henzinger, and J. Otop, *The target discounted-sum problem*. IST Austria, 2015.","mla":"Boker, Udi, et al. *The Target Discounted-Sum Problem*. IST Austria, 2015, doi:10.15479/AT:IST-2015-335-v1-1.","short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","ama":"Boker U, Henzinger TA, Otop J. *The Target Discounted-Sum Problem*. IST Austria; 2015. doi:10.15479/AT:IST-2015-335-v1-1","apa":"Boker, U., Henzinger, T. A., & Otop, J. (2015). *The target discounted-sum problem*. IST Austria. https://doi.org/10.15479/AT:IST-2015-335-v1-1","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. *The Target Discounted-Sum Problem*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-335-v1-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The target discounted-sum problem","month":"05","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"page":"20","day":"18"},{"year":"2015","doi":"10.15479/AT:IST-2015-323-v2-2","date_published":"2015-06-16T00:00:00Z","pubrep_id":"338","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, *The complexity of evolutionary games on graphs*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *The Complexity of Evolutionary Games on Graphs*. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). *The complexity of evolutionary games on graphs*. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. *The Complexity of Evolutionary Games on Graphs*. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v2-2","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. *The Complexity of Evolutionary Games on Graphs*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The complexity of evolutionary games on graphs","oa":1,"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive.","lang":"eng"}],"day":"16","page":"18","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"month":"06","publication_status":"published","related_material":{"record":[{"id":"5421","status":"public","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5432"}]},"date_created":"2018-12-12T11:39:21Z","ddc":["005","576"],"date_updated":"2021-01-12T08:02:20Z","publisher":"IST Austria","oa_version":"Published Version","status":"public","publication_identifier":{"issn":["2664-1690"]},"_id":"5440","file":[{"date_created":"2018-12-12T11:53:23Z","date_updated":"2020-07-14T12:46:56Z","creator":"system","file_size":466161,"relation":"main_file","access_level":"open_access","file_name":"IST-2015-323-v2+2_main.pdf","file_id":"5484","content_type":"application/pdf","checksum":"66aace7d367032af97c15e35c9be9636"}],"department":[{"_id":"KrCh"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:56Z"},{"year":"2015","doi":"10.15479/AT:IST-2015-340-v1-1","date_published":"2015-07-11T00:00:00Z","pubrep_id":"340","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). *Algorithms for algebraic path properties in concurrent systems of constant treewidth components*. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, *Algorithms for algebraic path properties in concurrent systems of constant treewidth components*. IST Austria, 2015."},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Goharshady, Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir","orcid":"0000-0003-1702-6584"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"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"}],"day":"11","page":"24","alternative_title":["IST Austria Technical Report"],"type":"technical_report","month":"07","language":[{"iso":"eng"}],"publication_status":"published","ddc":["000"],"date_created":"2018-12-12T11:39:21Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1437"},{"id":"5442","relation":"earlier_version","status":"public"},{"status":"public","relation":"later_version","id":"6009"}]},"date_updated":"2021-01-12T08:05:39Z","publisher":"IST Austria","oa_version":"Published Version","status":"public","publication_identifier":{"issn":["2664-1690"]},"_id":"5441","department":[{"_id":"KrCh"}],"file":[{"file_size":861396,"access_level":"open_access","relation":"main_file","file_name":"IST-2015-340-v1+1_main.pdf","file_id":"5531","content_type":"application/pdf","checksum":"df383dc62c94d7b2ea639aba088a76c6","date_created":"2018-12-12T11:54:09Z","date_updated":"2020-07-14T12:46:56Z","creator":"system"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:56Z"},{"page":"22","day":"14","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"month":"07","citation":{"apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2015). *Algorithms for algebraic path properties in concurrent systems of constant treewidth components*. IST Austria.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 22p.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria; 2015.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria, 2015.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, *Algorithms for algebraic path properties in concurrent systems of constant treewidth components*. IST Austria, 2015.","mla":"Anonymous, 1, et al. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","oa":1,"author":[{"full_name":"Anonymous, 1","last_name":"Anonymous","first_name":"1"},{"last_name":"Anonymous","first_name":"2","full_name":"Anonymous, 2"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"},{"last_name":"Anonymous","first_name":"4","full_name":"Anonymous, 4"}],"abstract":[{"lang":"eng","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 properties that arise in program analysis.\r\nWe consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \\emph{one-time} preprocessing and for \\emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\n\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, \r\neach 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 that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving \r\nthe worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks."}],"date_published":"2015-07-14T00:00:00Z","pubrep_id":"344","year":"2015","scopus_import":1,"_id":"5442","file":[{"checksum":"98fd936102f3e057fc321ef6d316001d","file_name":"IST-2015-343-v2+1_main.pdf","file_id":"5498","content_type":"application/pdf","access_level":"open_access","file_size":658747,"relation":"main_file","date_updated":"2020-07-14T12:46:57Z","creator":"system","date_created":"2018-12-12T11:53:37Z"},{"checksum":"b31d09b1241b59c75e1f42dadf09d258","file_size":139,"access_level":"closed","relation":"main_file","file_name":"IST-2015-343-v2+2_anonymous.txt","file_id":"6316","content_type":"text/plain","date_updated":"2020-07-14T12:46:57Z","creator":"dernst","date_created":"2019-04-16T12:36:08Z"}],"file_date_updated":"2020-07-14T12:46:57Z","has_accepted_license":"1","oa_version":"Published Version","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"status":"public","date_updated":"2021-01-12T08:05:39Z","publication_status":"published","related_material":{"record":[{"id":"5441","relation":"later_version","status":"public"},{"status":"public","relation":"later_version","id":"1437"},{"relation":"later_version","status":"public","id":"6009"}]},"ddc":["000"],"date_created":"2018-12-12T11:39:21Z"},{"pubrep_id":"362","date_published":"2015-11-06T00:00:00Z","doi":"10.15479/AT:IST-2015-325-v2-1","year":"2015","month":"11","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"day":"06","page":"23","abstract":[{"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 EXPTIME-complete, 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.","lang":"eng"}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"id":"378E0060-F248-11E8-B48F-1D18A9856A87","full_name":"Davies, Jessica","last_name":"Davies","first_name":"Jessica"}],"oa":1,"citation":{"short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, *A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs*. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. *A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.","apa":"Chatterjee, K., Chmelik, M., & Davies, J. (2015). *A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs*. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1","ama":"Chatterjee K, Chmelik M, Davies J. *A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs*. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1","ista":"Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","date_updated":"2021-01-12T08:02:23Z","ddc":["000"],"related_material":{"record":[{"id":"1166","status":"public","relation":"later_version"}]},"date_created":"2018-12-12T11:39:22Z","publication_status":"published","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:57Z","_id":"5443","department":[{"_id":"KrCh"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:46:57Z","date_created":"2018-12-12T11:53:05Z","checksum":"f0fa31ad8161ed655137e94012123ef9","file_name":"IST-2015-325-v2+1_main.pdf","content_type":"application/pdf","file_id":"5466","file_size":412379,"access_level":"open_access","relation":"main_file"}],"publication_identifier":{"issn":["2664-1690"]},"status":"public","oa_version":"Published Version","publisher":"IST Austria"},{"pubrep_id":"399","date_published":"2015-12-30T00:00:00Z","doi":"10.15479/AT:IST-2015-399-v1-1","year":"2015","month":"12","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"day":"30","page":"25","abstract":[{"text":"A comprehensive understanding of the clonal evolution of cancer is critical for understanding neoplasia. Genome-wide sequencing data enables evolutionary studies at unprecedented depth. However, classical phylogenetic methods often struggle with noisy sequencing data of impure DNA samples and fail to detect subclones that have different evolutionary trajectories. We have developed a tool, called Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly available sequencing technologies. Using Bayesian inference and Integer Linear Programming, robust phylogenies consistent with the biological processes underlying cancer evolution were obtained for pancreatic, ovarian, and prostate cancers. Furthermore, Treeomics correctly identified sequencing artifacts such as those resulting from low statistical power; nearly 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumor heterogeneity among distinct samples. Importantly, we show that the evolutionary trees generated with Treeomics are mathematically optimal.","lang":"eng"}],"author":[{"full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","first_name":"Johannes","last_name":"Reiter"},{"full_name":"Makohon-Moore, Alvin","first_name":"Alvin","last_name":"Makohon-Moore"},{"full_name":"Gerold, Jeffrey","last_name":"Gerold","first_name":"Jeffrey"},{"full_name":"Bozic, Ivana","first_name":"Ivana","last_name":"Bozic"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Iacobuzio-Donahue, Christine","first_name":"Christine","last_name":"Iacobuzio-Donahue"},{"full_name":"Vogelstein, Bert","last_name":"Vogelstein","first_name":"Bert"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"oa":1,"citation":{"short":"J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.","mla":"Reiter, Johannes, et al. *Reconstructing Robust Phylogenies of Metastatic Cancers*. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.","ieee":"J. Reiter *et al.*, *Reconstructing robust phylogenies of metastatic cancers*. IST Austria, 2015.","chicago":"Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. *Reconstructing Robust Phylogenies of Metastatic Cancers*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.","apa":"Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). *Reconstructing robust phylogenies of metastatic cancers*. IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1","ama":"Reiter J, Makohon-Moore A, Gerold J, et al. *Reconstructing Robust Phylogenies of Metastatic Cancers*. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1","ista":"Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Reconstructing robust phylogenies of metastatic cancers","date_updated":"2020-07-14T23:05:07Z","ddc":["000","576"],"date_created":"2018-12-12T11:39:22Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:58Z","has_accepted_license":"1","file":[{"checksum":"c47d33bdda06181753c0af36f16e7b5d","content_type":"application/pdf","file_id":"5485","file_name":"IST-2015-399-v1+1_treeomics.pdf","file_size":3533200,"access_level":"open_access","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:58Z","date_created":"2018-12-12T11:53:24Z"}],"_id":"5444","department":[{"_id":"KrCh"}],"status":"public","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","publisher":"IST Austria"},{"file":[{"access_level":"open_access","file_size":49557109,"relation":"main_file","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","file_id":"5597","content_type":"application/zip","checksum":"b8bcb43c0893023cda66c1b69c16ac62","date_created":"2018-12-12T13:02:31Z","creator":"system","date_updated":"2020-07-14T12:47:00Z"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:00Z","has_accepted_license":"1","publisher":"IST Austria","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"contributor":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan"}],"datarep_id":"28","related_material":{"record":[{"relation":"popular_science","status":"public","id":"1603"}]},"date_created":"2018-12-12T12:31:29Z","ddc":["004"],"publist_id":"5564","type":"research_data","title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_published":"2015-08-13T00:00:00Z","_id":"5549","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"oa_version":"Published Version","status":"public","date_updated":"2021-01-12T08:02:36Z","month":"08","day":"13","author":[{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","full_name":"Fellner, Andreas","last_name":"Fellner","first_name":"Andreas"}],"abstract":[{"text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication.","lang":"eng"}],"citation":{"short":"A. Fellner, (2015).","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” IST Austria, 2015.","mla":"Fellner, Andreas. *Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes*. IST Austria, 2015, doi:10.15479/AT:ISTA:28.","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” IST Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, IST Austria, 10.15479/AT:ISTA:28.","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. IST Austria. https://doi.org/10.15479/AT:ISTA:28","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28"},"oa":1,"doi":"10.15479/AT:ISTA:28","license":"https://creativecommons.org/publicdomain/zero/1.0/","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"year":"2015"},{"date_created":"2019-01-08T20:44:06Z","publication_status":"published","date_updated":"2021-01-12T08:03:36Z","issue":"4","publication_identifier":{"issn":["0304-3975"]},"status":"public","publisher":"Elsevier","oa_version":"None","volume":624,"_id":"5804","publication":"Theoretical Computer Science","quality_controlled":"1","extern":"1","year":"2015","intvolume":" 624","doi":"10.1016/j.tcs.2015.11.018","date_published":"2015-04-18T00:00:00Z","citation":{"chicago":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” *Theoretical Computer Science*. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.11.018.","ista":"Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 624(4), 56–72.","apa":"Biswas, R., & Bhowmick, P. (2015). From prima quadraginta octant to lattice sphere through primitive integer operations. *Theoretical Computer Science*. Elsevier. https://doi.org/10.1016/j.tcs.2015.11.018","ama":"Biswas R, Bhowmick P. From prima quadraginta octant to lattice sphere through primitive integer operations. *Theoretical Computer Science*. 2015;624(4):56-72. doi:10.1016/j.tcs.2015.11.018","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.","mla":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” *Theoretical Computer Science*, vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi:10.1016/j.tcs.2015.11.018.","ieee":"R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere through primitive integer operations,” *Theoretical Computer Science*, vol. 624, no. 4. Elsevier, pp. 56–72, 2015."},"title":"From prima quadraginta octant to lattice sphere through primitive integer operations","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present here the first integer-based algorithm for constructing a well-defined lattice sphere specified by integer radius and integer center. The algorithm evolves from a unique correspondence between the lattice points comprising the sphere and the distribution of sum of three square numbers in integer intervals. We characterize these intervals to derive a useful set of recurrences, which, in turn, aids in efficient computation. Each point of the lattice sphere is determined by resorting to only a few primitive operations in the integer domain. The symmetry of its quadraginta octants provides an added advantage by confining the computation to its prima quadraginta octant. Detailed theoretical analysis and experimental results have been furnished to demonstrate its simplicity and elegance.","lang":"eng"}],"author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita","orcid":"0000-0002-5372-7890"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"page":"56-72","day":"18","language":[{"iso":"eng"}],"month":"04","type":"journal_article"},{"publication_status":"published","date_created":"2019-01-08T20:44:52Z","date_updated":"2021-01-12T08:03:37Z","oa_version":"None","publisher":"Elsevier","publication_identifier":{"issn":["0304-3975"]},"status":"public","issue":"11","_id":"5807","volume":605,"year":"2015","extern":"1","quality_controlled":"1","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2015.09.003","date_published":"2015-11-09T00:00:00Z","intvolume":" 605","author":[{"orcid":"0000-0002-5372-7890","last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"On different topological classes of spherical geodesic paths and circles inZ3","citation":{"ama":"Biswas R, Bhowmick P. On different topological classes of spherical geodesic paths and circles inZ3. *Theoretical Computer Science*. 2015;605(11):146-163. doi:10.1016/j.tcs.2015.09.003","apa":"Biswas, R., & Bhowmick, P. (2015). On different topological classes of spherical geodesic paths and circles inZ3. *Theoretical Computer Science*. Elsevier. https://doi.org/10.1016/j.tcs.2015.09.003","ista":"Biswas R, Bhowmick P. 2015. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” *Theoretical Computer Science*. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.09.003.","ieee":"R. Biswas and P. Bhowmick, “On different topological classes of spherical geodesic paths and circles inZ3,” *Theoretical Computer Science*, vol. 605, no. 11. Elsevier, pp. 146–163, 2015.","mla":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” *Theoretical Computer Science*, vol. 605, no. 11, Elsevier, 2015, pp. 146–63, doi:10.1016/j.tcs.2015.09.003.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163."},"type":"journal_article","month":"11","language":[{"iso":"eng"}],"page":"146-163","day":"09"},{"issue":"6-8","publication_identifier":{"issn":["0178-2789","1432-2315"]},"status":"public","publisher":"Springer Nature","oa_version":"None","_id":"5808","volume":31,"date_created":"2019-01-08T20:45:05Z","publication_status":"published","date_updated":"2021-01-12T08:03:37Z","author":[{"orcid":"0000-0002-5372-7890","last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"citation":{"short":"R. Biswas, P. Bhowmick, The Visual Computer 31 (2015) 787–797.","ieee":"R. Biswas and P. Bhowmick, “Layer the sphere,” *The Visual Computer*, vol. 31, no. 6–8. Springer Nature, pp. 787–797, 2015.","mla":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” *The Visual Computer*, vol. 31, no. 6–8, Springer Nature, 2015, pp. 787–97, doi:10.1007/s00371-015-1101-3.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” *The Visual Computer*. Springer Nature, 2015. https://doi.org/10.1007/s00371-015-1101-3.","ista":"Biswas R, Bhowmick P. 2015. Layer the sphere. The Visual Computer. 31(6–8), 787–797.","ama":"Biswas R, Bhowmick P. Layer the sphere. *The Visual Computer*. 2015;31(6-8):787-797. doi:10.1007/s00371-015-1101-3","apa":"Biswas, R., & Bhowmick, P. (2015). Layer the sphere. *The Visual Computer*. Springer Nature. https://doi.org/10.1007/s00371-015-1101-3"},"title":"Layer the sphere","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","language":[{"iso":"eng"}],"type":"journal_article","page":"787-797","day":"08","year":"2015","publication":"The Visual Computer","quality_controlled":"1","extern":"1","intvolume":" 31","doi":"10.1007/s00371-015-1101-3","date_published":"2015-05-08T00:00:00Z"}]