[{"author":[{"last_name":"Anonymous","full_name":"Anonymous, 1","first_name":"1"},{"full_name":"Anonymous, 2","first_name":"2","last_name":"Anonymous"}],"date_created":"2018-12-12T11:39:18Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:53Z","oa":1,"file":[{"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T11:53:14Z","access_level":"open_access","file_id":"5475","relation":"main_file","file_size":378162,"checksum":"8542fd0b10aed7811cd41077b8ccb632","file_name":"IST-2015-326-v1+1_main.pdf","date_updated":"2020-07-14T12:46:53Z"},{"access_level":"closed","creator":"dernst","date_created":"2019-04-16T13:00:33Z","content_type":"text/plain","relation":"main_file","file_size":64,"file_id":"6317","checksum":"84c31c537bdaf7a91909f18d25d640ab","date_updated":"2020-07-14T12:46:53Z","file_name":"IST-2015-326-v1+2_authors.txt"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"status":"public","date_published":"2015-02-19T00:00:00Z","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"ddc":["000"],"date_updated":"2020-07-14T23:04:59Z","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"month":"02","oa_version":"Published Version","year":"2015","citation":{"chicago":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","ama":"Anonymous 1, Anonymous 2. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria; 2015.","ieee":"1 Anonymous and 2 Anonymous, <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria, 2015.","mla":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","apa":"Anonymous, 1, &#38; Anonymous, 2. (2015). <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015."},"_id":"5434","title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","type":"technical_report","page":"16","pubrep_id":"326","day":"19","publisher":"IST Austria"},{"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"75284adec80baabdfe71ff9ebbc27445","date_updated":"2020-07-14T12:46:53Z","file_name":"IST-2015-318-v2+1_main.pdf","content_type":"application/pdf","access_level":"open_access","creator":"system","date_created":"2018-12-12T11:54:03Z","file_id":"5525","relation":"main_file","file_size":717630}],"department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Komarkova, Zuzana","first_name":"Zuzana","last_name":"Komarkova"},{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"date_created":"2018-12-12T11:39:19Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:53Z","ddc":["004"],"has_accepted_license":"1","date_updated":"2025-09-29T11:00:42Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","language":[{"iso":"eng"}],"date_published":"2015-02-23T00:00:00Z","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."}],"month":"02","alternative_title":["IST Austria Technical Report"],"type":"technical_report","related_material":{"record":[{"status":"public","id":"5429","relation":"earlier_version"},{"status":"public","relation":"later_version","id":"466"},{"status":"public","id":"1657","relation":"later_version"}]},"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","doi":"10.15479/AT:IST-2015-318-v2-1","day":"23","publisher":"IST Austria","page":"51","pubrep_id":"327","oa_version":"Published Version","citation":{"ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","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, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>."},"_id":"5435","year":"2015"},{"alternative_title":["IST Austria Technical Report"],"month":"04","oa_version":"Published Version","_id":"5436","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2015). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>"},"year":"2015","type":"technical_report","related_material":{"record":[{"status":"public","id":"5415","relation":"earlier_version"},{"relation":"later_version","id":"467","status":"public"},{"id":"1656","relation":"later_version","status":"public"}]},"title":"Nested weighted automata","publisher":"IST Austria","day":"24","doi":"10.15479/AT:IST-2015-170-v2-2","pubrep_id":"331","page":"29","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"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","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"file_date_updated":"2020-07-14T12:46:54Z","date_created":"2018-12-12T11:39:19Z","publication_status":"published","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"3c402f47d3669c28d04d1af405a08e3f","date_updated":"2020-07-14T12:46:54Z","file_name":"IST-2015-170-v2+2_report.pdf","access_level":"open_access","creator":"system","date_created":"2018-12-12T11:54:19Z","content_type":"application/pdf","relation":"main_file","file_size":569991,"file_id":"5541"}],"status":"public","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"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"}],"date_published":"2015-04-24T00:00:00Z","ddc":["000"],"has_accepted_license":"1","date_updated":"2025-09-23T09:39:58Z"},{"date_updated":"2025-09-23T08:47:23Z","has_accepted_license":"1","ddc":["000"],"date_published":"2015-04-27T00:00:00Z","abstract":[{"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. ","lang":"eng"}],"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["2664-1690"]},"file":[{"file_name":"IST-2015-330-v2+1_main.pdf","date_updated":"2020-07-14T12:46:54Z","checksum":"f5917c20f84018b362d385c000a2e123","file_size":1072137,"relation":"main_file","file_id":"5473","date_created":"2018-12-12T11:53:12Z","creator":"system","access_level":"open_access","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file_date_updated":"2020-07-14T12:46:54Z","publication_status":"published","date_created":"2018-12-12T11:39:19Z","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"department":[{"_id":"KrCh"}],"page":"27","pubrep_id":"333","doi":"10.15479/AT:IST-2015-330-v2-1","day":"27","publisher":"IST Austria","title":"Faster algorithms for quantitative verification in constant treewidth graphs","related_material":{"record":[{"relation":"earlier_version","id":"5430","status":"public"},{"status":"public","relation":"later_version","id":"1607"}]},"type":"technical_report","year":"2015","citation":{"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, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">10.15479/AT:IST-2015-330-v2-1</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">https://doi.org/10.15479/AT:IST-2015-330-v2-1</a>","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">10.15479/AT:IST-2015-330-v2-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-330-v2-1\">https://doi.org/10.15479/AT:IST-2015-330-v2-1</a>."},"_id":"5437","oa_version":"Published Version","month":"04","alternative_title":["IST Austria Technical Report"]},{"file":[{"checksum":"40405907aa012acece1bc26cf0be554d","file_name":"IST-2015-335-v1+1_report.pdf","date_updated":"2020-07-14T12:46:55Z","content_type":"application/pdf","date_created":"2018-12-12T11:53:55Z","creator":"system","access_level":"open_access","file_id":"5517","relation":"main_file","file_size":589619}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","file_date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:39:20Z","author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"department":[{"_id":"ToHe"}],"date_updated":"2025-04-15T08:11:50Z","has_accepted_license":"1","ddc":["004","512","513"],"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. "}],"language":[{"iso":"eng"}],"date_published":"2015-05-18T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","month":"05","alternative_title":["IST Austria Technical Report"],"pubrep_id":"335","page":"20","doi":"10.15479/AT:IST-2015-335-v1-1","day":"18","publisher":"IST Austria","title":"The target discounted-sum problem","related_material":{"record":[{"status":"public","relation":"later_version","id":"1659"}]},"type":"technical_report","year":"2015","_id":"5439","citation":{"ama":"Boker U, Henzinger TA, Otop J. <i>The Target Discounted-Sum Problem</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>.","short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","ieee":"U. Boker, T. A. Henzinger, and J. Otop, <i>The target discounted-sum problem</i>. IST Austria, 2015.","apa":"Boker, U., Henzinger, T. A., &#38; Otop, J. (2015). <i>The target discounted-sum problem</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>","mla":"Boker, Udi, et al. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>.","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p."},"oa_version":"Published Version"},{"alternative_title":["IST Austria Technical Report"],"month":"06","year":"2015","_id":"5440","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">https://doi.org/10.15479/AT:IST-2015-323-v2-2</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">10.15479/AT:IST-2015-323-v2-2</a>","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">https://doi.org/10.15479/AT:IST-2015-323-v2-2</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">10.15479/AT:IST-2015-323-v2-2</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015."},"oa_version":"Published Version","pubrep_id":"338","page":"18","day":"16","publisher":"IST Austria","doi":"10.15479/AT:IST-2015-323-v2-2","related_material":{"record":[{"status":"public","id":"5421","relation":"earlier_version"},{"id":"5432","relation":"earlier_version","status":"public"}]},"title":"The complexity of evolutionary games on graphs","type":"technical_report","date_created":"2018-12-12T11:39:21Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:56Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"department":[{"_id":"KrCh"}],"file":[{"relation":"main_file","file_size":466161,"file_id":"5484","date_created":"2018-12-12T11:53:23Z","creator":"system","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2015-323-v2+2_main.pdf","date_updated":"2020-07-14T12:46:56Z","checksum":"66aace7d367032af97c15e35c9be9636"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"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"}],"date_published":"2015-06-16T00:00:00Z","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2023-02-23T12:26:10Z","has_accepted_license":"1","ddc":["005","576"]},{"_id":"5441","citation":{"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.","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., &#38; Pavlogiannis, A. (2015). <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">https://doi.org/10.15479/AT:IST-2015-340-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">10.15479/AT:IST-2015-340-v1-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria, 2015.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">10.15479/AT:IST-2015-340-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">https://doi.org/10.15479/AT:IST-2015-340-v1-1</a>."},"year":"2015","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-340-v1-1","day":"11","publisher":"IST Austria","page":"24","pubrep_id":"340","type":"technical_report","related_material":{"record":[{"relation":"earlier_version","id":"5442","status":"public"},{"relation":"later_version","id":"6009","status":"public"},{"status":"public","id":"1437","relation":"later_version"}]},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","alternative_title":["IST Austria Technical Report"],"month":"07","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 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."}],"date_published":"2015-07-11T00:00:00Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"status":"public","has_accepted_license":"1","date_updated":"2025-04-15T08:11:48Z","ddc":["000"],"publication_status":"published","file_date_updated":"2020-07-14T12:46:56Z","date_created":"2018-12-12T11:39:21Z","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir","full_name":"Goharshady, Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"df383dc62c94d7b2ea639aba088a76c6","file_name":"IST-2015-340-v1+1_main.pdf","date_updated":"2020-07-14T12:46:56Z","date_created":"2018-12-12T11:54:09Z","creator":"system","access_level":"open_access","content_type":"application/pdf","file_size":861396,"relation":"main_file","file_id":"5531"}],"oa":1},{"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."}],"scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2015-07-14T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","date_updated":"2025-04-15T08:11:49Z","has_accepted_license":"1","ddc":["000"],"file_date_updated":"2020-07-14T12:46:57Z","publication_status":"published","date_created":"2018-12-12T11:39:21Z","author":[{"last_name":"Anonymous","full_name":"Anonymous, 1","first_name":"1"},{"first_name":"2","full_name":"Anonymous, 2","last_name":"Anonymous"},{"full_name":"Anonymous, 3","first_name":"3","last_name":"Anonymous"},{"first_name":"4","full_name":"Anonymous, 4","last_name":"Anonymous"}],"file":[{"date_updated":"2020-07-14T12:46:57Z","file_name":"IST-2015-343-v2+1_main.pdf","checksum":"98fd936102f3e057fc321ef6d316001d","relation":"main_file","file_size":658747,"file_id":"5498","access_level":"open_access","date_created":"2018-12-12T11:53:37Z","creator":"system","content_type":"application/pdf"},{"file_name":"IST-2015-343-v2+2_anonymous.txt","date_updated":"2020-07-14T12:46:57Z","checksum":"b31d09b1241b59c75e1f42dadf09d258","relation":"main_file","file_size":139,"file_id":"6316","creator":"dernst","date_created":"2019-04-16T12:36:08Z","access_level":"closed","content_type":"text/plain"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"year":"2015","_id":"5442","citation":{"ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria; 2015.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. 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.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria, 2015.","mla":"Anonymous, 1, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015.","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.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, &#38; Anonymous, 4. (2015). <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria."},"oa_version":"Published Version","pubrep_id":"344","page":"22","publisher":"IST Austria","day":"14","related_material":{"record":[{"relation":"later_version","id":"5441","status":"public"},{"relation":"later_version","id":"6009","status":"public"},{"status":"public","id":"1437","relation":"later_version"}]},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","type":"technical_report","alternative_title":["IST Austria Technical Report"],"month":"07"},{"alternative_title":["IST Austria Technical Report"],"month":"11","year":"2015","_id":"5443","citation":{"ama":"Chatterjee K, Chmelik M, Davies J. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">10.15479/AT:IST-2015-325-v2-1</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">https://doi.org/10.15479/AT:IST-2015-325-v2-1</a>.","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, <i>A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs</i>. IST Austria, 2015.","apa":"Chatterjee, K., Chmelik, M., &#38; Davies, J. (2015). <i>A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">https://doi.org/10.15479/AT:IST-2015-325-v2-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">10.15479/AT:IST-2015-325-v2-1</a>.","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."},"oa_version":"Published Version","page":"23","pubrep_id":"362","doi":"10.15479/AT:IST-2015-325-v2-1","day":"06","publisher":"IST Austria","related_material":{"record":[{"relation":"later_version","id":"1166","status":"public"}]},"title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","type":"technical_report","date_created":"2018-12-12T11:39:22Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:57Z","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Davies","id":"378E0060-F248-11E8-B48F-1D18A9856A87","full_name":"Davies, Jessica","first_name":"Jessica"}],"department":[{"_id":"KrCh"}],"file":[{"checksum":"f0fa31ad8161ed655137e94012123ef9","date_updated":"2020-07-14T12:46:57Z","file_name":"IST-2015-325-v2+1_main.pdf","content_type":"application/pdf","access_level":"open_access","creator":"system","date_created":"2018-12-12T11:53:05Z","file_id":"5466","file_size":412379,"relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"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"}],"language":[{"iso":"eng"}],"date_published":"2015-11-06T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","date_updated":"2025-06-25T11:52:13Z","has_accepted_license":"1","ddc":["000"]},{"month":"12","alternative_title":["IST Austria Technical Report"],"type":"technical_report","title":"Reconstructing robust phylogenies of metastatic cancers","day":"30","doi":"10.15479/AT:IST-2015-399-v1-1","publisher":"IST Austria","pubrep_id":"399","page":"25","oa_version":"Published Version","_id":"5444","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.","ieee":"J. Reiter <i>et al.</i>, <i>Reconstructing robust phylogenies of metastatic cancers</i>. IST Austria, 2015.","apa":"Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). <i>Reconstructing robust phylogenies of metastatic cancers</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">https://doi.org/10.15479/AT:IST-2015-399-v1-1</a>","mla":"Reiter, Johannes, et al. <i>Reconstructing Robust Phylogenies of Metastatic Cancers</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">10.15479/AT:IST-2015-399-v1-1</a>.","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.","ama":"Reiter J, Makohon-Moore A, Gerold J, et al. <i>Reconstructing Robust Phylogenies of Metastatic Cancers</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">10.15479/AT:IST-2015-399-v1-1</a>","chicago":"Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. <i>Reconstructing Robust Phylogenies of Metastatic Cancers</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">https://doi.org/10.15479/AT:IST-2015-399-v1-1</a>."},"year":"2015","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":3533200,"relation":"main_file","file_id":"5485","access_level":"open_access","creator":"system","date_created":"2018-12-12T11:53:24Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:58Z","file_name":"IST-2015-399-v1+1_treeomics.pdf","checksum":"c47d33bdda06181753c0af36f16e7b5d"}],"department":[{"_id":"KrCh"}],"author":[{"full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","orcid":"0000-0002-0170-7353","last_name":"Reiter"},{"last_name":"Makohon-Moore","first_name":"Alvin","full_name":"Makohon-Moore, Alvin"},{"full_name":"Gerold, Jeffrey","first_name":"Jeffrey","last_name":"Gerold"},{"last_name":"Bozic","full_name":"Bozic, Ivana","first_name":"Ivana"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iacobuzio-Donahue","first_name":"Christine","full_name":"Iacobuzio-Donahue, Christine"},{"last_name":"Vogelstein","first_name":"Bert","full_name":"Vogelstein, Bert"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"date_created":"2018-12-12T11:39:22Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:58Z","ddc":["000","576"],"has_accepted_license":"1","date_updated":"2020-07-14T23:05:07Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","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"}],"date_published":"2015-12-30T00:00:00Z","language":[{"iso":"eng"}]},{"oa_version":"Published Version","_id":"5549","year":"2015","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","article_processing_charge":"No","month":"08","contributor":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky"}],"status":"public","date_published":"2015-08-13T00:00:00Z","abstract":[{"lang":"eng","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."}],"ddc":["004"],"license":"https://creativecommons.org/publicdomain/zero/1.0/","author":[{"last_name":"Fellner","full_name":"Fellner, Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/zip","date_created":"2018-12-12T13:02:31Z","creator":"system","access_level":"open_access","file_id":"5597","relation":"main_file","file_size":49557109,"checksum":"b8bcb43c0893023cda66c1b69c16ac62","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","date_updated":"2020-07-14T12:47:00Z"}],"citation":{"chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>.","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","mla":"Fellner, Andreas. <i>Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes</i>. Institute of Science and Technology Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","short":"A. Fellner, (2015)."},"type":"research_data","ec_funded":1,"related_material":{"record":[{"id":"1603","relation":"popular_science","status":"public"}]},"day":"13","doi":"10.15479/AT:ISTA:28","publisher":"Institute of Science and Technology Austria","publist_id":"5564","has_accepted_license":"1","date_updated":"2025-09-23T08:23:15Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"datarep_id":"28","date_created":"2018-12-12T12:31:29Z","file_date_updated":"2020-07-14T12:47:00Z","tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"}},{"date_updated":"2021-01-12T08:03:36Z","status":"public","publication_identifier":{"issn":["0304-3975"]},"abstract":[{"lang":"eng","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."}],"date_published":"2015-04-18T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       624","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"publication_status":"published","date_created":"2019-01-08T20:44:06Z","type":"journal_article","title":"From prima quadraginta octant to lattice sphere through primitive integer operations","day":"18","publisher":"Elsevier","doi":"10.1016/j.tcs.2015.11.018","page":"56-72","oa_version":"None","volume":624,"citation":{"apa":"Biswas, R., &#38; Bhowmick, P. (2015). From prima quadraginta octant to lattice sphere through primitive integer operations. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2015.11.018\">https://doi.org/10.1016/j.tcs.2015.11.018</a>","mla":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” <i>Theoretical Computer Science</i>, vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi:<a href=\"https://doi.org/10.1016/j.tcs.2015.11.018\">10.1016/j.tcs.2015.11.018</a>.","ista":"Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 624(4), 56–72.","ieee":"R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere through primitive integer operations,” <i>Theoretical Computer Science</i>, vol. 624, no. 4. Elsevier, pp. 56–72, 2015.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.","chicago":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” <i>Theoretical Computer Science</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.tcs.2015.11.018\">https://doi.org/10.1016/j.tcs.2015.11.018</a>.","ama":"Biswas R, Bhowmick P. From prima quadraginta octant to lattice sphere through primitive integer operations. <i>Theoretical Computer Science</i>. 2015;624(4):56-72. doi:<a href=\"https://doi.org/10.1016/j.tcs.2015.11.018\">10.1016/j.tcs.2015.11.018</a>"},"_id":"5804","issue":"4","year":"2015","month":"04","extern":"1","publication":"Theoretical Computer Science"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-01-08T20:44:52Z","publication_status":"published","author":[{"last_name":"Biswas","orcid":"0000-0002-5372-7890","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"date_updated":"2021-01-12T08:03:37Z","intvolume":"       605","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2015-11-09T00:00:00Z","publication_identifier":{"issn":["0304-3975"]},"status":"public","extern":"1","month":"11","publication":"Theoretical Computer Science","page":"146-163","publisher":"Elsevier","doi":"10.1016/j.tcs.2015.09.003","day":"09","title":"On different topological classes of spherical geodesic paths and circles inZ3","type":"journal_article","year":"2015","citation":{"mla":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” <i>Theoretical Computer Science</i>, vol. 605, no. 11, Elsevier, 2015, pp. 146–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2015.09.003\">10.1016/j.tcs.2015.09.003</a>.","apa":"Biswas, R., &#38; Bhowmick, P. (2015). On different topological classes of spherical geodesic paths and circles inZ3. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2015.09.003\">https://doi.org/10.1016/j.tcs.2015.09.003</a>","ista":"Biswas R, Bhowmick P. 2015. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.","ieee":"R. Biswas and P. Bhowmick, “On different topological classes of spherical geodesic paths and circles inZ3,” <i>Theoretical Computer Science</i>, vol. 605, no. 11. Elsevier, pp. 146–163, 2015.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” <i>Theoretical Computer Science</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.tcs.2015.09.003\">https://doi.org/10.1016/j.tcs.2015.09.003</a>.","ama":"Biswas R, Bhowmick P. On different topological classes of spherical geodesic paths and circles inZ3. <i>Theoretical Computer Science</i>. 2015;605(11):146-163. doi:<a href=\"https://doi.org/10.1016/j.tcs.2015.09.003\">10.1016/j.tcs.2015.09.003</a>"},"_id":"5807","issue":"11","volume":605,"oa_version":"None"},{"month":"05","extern":"1","publication":"The Visual Computer","title":"Layer the sphere","type":"journal_article","page":"787-797","doi":"10.1007/s00371-015-1101-3","publisher":"Springer Nature","day":"08","volume":31,"oa_version":"None","year":"2015","issue":"6-8","_id":"5808","citation":{"chicago":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” <i>The Visual Computer</i>. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/s00371-015-1101-3\">https://doi.org/10.1007/s00371-015-1101-3</a>.","ama":"Biswas R, Bhowmick P. Layer the sphere. <i>The Visual Computer</i>. 2015;31(6-8):787-797. doi:<a href=\"https://doi.org/10.1007/s00371-015-1101-3\">10.1007/s00371-015-1101-3</a>","mla":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” <i>The Visual Computer</i>, vol. 31, no. 6–8, Springer Nature, 2015, pp. 787–97, doi:<a href=\"https://doi.org/10.1007/s00371-015-1101-3\">10.1007/s00371-015-1101-3</a>.","apa":"Biswas, R., &#38; Bhowmick, P. (2015). Layer the sphere. <i>The Visual Computer</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00371-015-1101-3\">https://doi.org/10.1007/s00371-015-1101-3</a>","ista":"Biswas R, Bhowmick P. 2015. Layer the sphere. The Visual Computer. 31(6–8), 787–797.","ieee":"R. Biswas and P. Bhowmick, “Layer the sphere,” <i>The Visual Computer</i>, vol. 31, no. 6–8. Springer Nature, pp. 787–797, 2015.","short":"R. Biswas, P. Bhowmick, The Visual Computer 31 (2015) 787–797."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"date_created":"2019-01-08T20:45:05Z","publication_status":"published","date_updated":"2021-01-12T08:03:37Z","publication_identifier":{"issn":["0178-2789","1432-2315"]},"status":"public","intvolume":"        31","quality_controlled":"1","date_published":"2015-05-08T00:00:00Z","language":[{"iso":"eng"}]},{"publication_status":"published","date_created":"2018-12-11T11:47:23Z","author":[{"last_name":"Sainsbury","full_name":"Sainsbury, Sarah","first_name":"Sarah"},{"orcid":"0000-0003-0893-7036","last_name":"Bernecky","first_name":"Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","full_name":"Bernecky, Carrie A"},{"last_name":"Cramer","first_name":"Patrick","full_name":"Cramer, Patrick"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        16","date_published":"2015-03-26T00:00:00Z","language":[{"iso":"eng"}],"abstract":[{"text":"Transcription of eukaryotic protein-coding genes commences with the assembly of a conserved initiation complex, which consists of RNA polymerase II (Pol II) and the general transcription factors, at promoter DNA. After two decades of research, the structural basis of transcription initiation is emerging. Crystal structures of many components of the initiation complex have been resolved, and structural information on Pol II complexes with general transcription factors has recently been obtained. Although mechanistic details await elucidation, available data outline how Pol II cooperates with the general transcription factors to bind to and open promoter DNA, and how Pol II directs RNA synthesis and escapes from the promoter.","lang":"eng"}],"status":"public","date_updated":"2021-01-12T08:05:16Z","publication":"Nature Reviews Molecular Cell Biology","article_processing_charge":"No","extern":"1","month":"03","publist_id":"7206","year":"2015","issue":"3","_id":"594","citation":{"chicago":"Sainsbury, Sarah, Carrie Bernecky, and Patrick Cramer. “Structural Basis of Transcription Initiation by RNA Polymerase II.” <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nrm3952\">https://doi.org/10.1038/nrm3952</a>.","ama":"Sainsbury S, Bernecky C, Cramer P. Structural basis of transcription initiation by RNA polymerase II. <i>Nature Reviews Molecular Cell Biology</i>. 2015;16(3):129-143. doi:<a href=\"https://doi.org/10.1038/nrm3952\">10.1038/nrm3952</a>","mla":"Sainsbury, Sarah, et al. “Structural Basis of Transcription Initiation by RNA Polymerase II.” <i>Nature Reviews Molecular Cell Biology</i>, vol. 16, no. 3, Nature Publishing Group, 2015, pp. 129–43, doi:<a href=\"https://doi.org/10.1038/nrm3952\">10.1038/nrm3952</a>.","ista":"Sainsbury S, Bernecky C, Cramer P. 2015. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 16(3), 129–143.","apa":"Sainsbury, S., Bernecky, C., &#38; Cramer, P. (2015). Structural basis of transcription initiation by RNA polymerase II. <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrm3952\">https://doi.org/10.1038/nrm3952</a>","ieee":"S. Sainsbury, C. Bernecky, and P. Cramer, “Structural basis of transcription initiation by RNA polymerase II,” <i>Nature Reviews Molecular Cell Biology</i>, vol. 16, no. 3. Nature Publishing Group, pp. 129–143, 2015.","short":"S. Sainsbury, C. Bernecky, P. Cramer, Nature Reviews Molecular Cell Biology 16 (2015) 129–143."},"volume":16,"oa_version":"None","page":"129 - 143","publisher":"Nature Publishing Group","doi":"10.1038/nrm3952","day":"26","title":"Structural basis of transcription initiation by RNA polymerase II","type":"journal_article"},{"pmid":1,"month":"07","title":"Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity","year":"2015","issue":"27","_id":"6118","oa_version":"Published Version","file":[{"checksum":"3d2da5af8d72467e382a565abc2e003d","file_name":"2015_PNAS_Fenk.pdf","date_updated":"2020-07-14T12:47:20Z","creator":"kschuh","date_created":"2019-03-19T14:21:07Z","access_level":"open_access","content_type":"application/pdf","file_size":2822681,"relation":"main_file","file_id":"6119"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","author":[{"first_name":"Lorenz A.","full_name":"Fenk, Lorenz A.","last_name":"Fenk"},{"orcid":"0000-0001-8347-0443","last_name":"de Bono","first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"}],"ddc":["570"],"abstract":[{"lang":"eng","text":"Carbon dioxide (CO2) gradients are ubiquitous and provide animals with information about their environment, such as the potential presence of prey or predators. The nematode Caenorhabditis elegans avoids elevated CO2, and previous work identified three neuron pairs called “BAG,” “AFD,” and “ASE” that respond to CO2 stimuli. Using in vivo Ca2+ imaging and behavioral analysis, we show that C. elegans can detect CO2 independently of these sensory pathways. Many of the C. elegans sensory neurons we examined, including the AWC olfactory neurons, the ASJ and ASK gustatory neurons, and the ASH and ADL nociceptors, respond to a rise in CO2 with a rise in Ca2+. In contrast, glial sheath cells harboring the sensory endings of C. elegans’ major chemosensory neurons exhibit strong and sustained decreases in Ca2+ in response to high CO2. Some of these CO2 responses appear to be cell intrinsic. Worms therefore may couple detection of CO2 to that of other cues at the earliest stages of sensory processing. We show that C. elegans persistently suppresses oviposition at high CO2. Hermaphrodite-specific neurons (HSNs), the executive neurons driving egg-laying, are tonically inhibited when CO2 is elevated. CO2 modulates the egg-laying system partly through the AWC olfactory neurons: High CO2 tonically activates AWC by a cGMP-dependent mechanism, and AWC output inhibits the HSNs. Our work shows that CO2 is a more complex sensory cue for C. elegans than previously thought, both in terms of behavior and neural circuitry."}],"date_published":"2015-07-07T00:00:00Z","status":"public","extern":"1","publication":"Proceedings of the National Academy of Sciences","page":"E3525-E3534","publisher":"National Academy of Sciences","doi":"10.1073/pnas.1423808112","day":"07","type":"journal_article","citation":{"mla":"Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes in Neural Activity.” <i>Proceedings of the National Academy of Sciences</i>, vol. 112, no. 27, National Academy of Sciences, 2015, pp. E3525–34, doi:<a href=\"https://doi.org/10.1073/pnas.1423808112\">10.1073/pnas.1423808112</a>.","ista":"Fenk LA, de Bono M. 2015. Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. 112(27), E3525–E3534.","apa":"Fenk, L. A., &#38; de Bono, M. (2015). Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1423808112\">https://doi.org/10.1073/pnas.1423808112</a>","ieee":"L. A. Fenk and M. de Bono, “Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity,” <i>Proceedings of the National Academy of Sciences</i>, vol. 112, no. 27. National Academy of Sciences, pp. E3525–E3534, 2015.","short":"L.A. Fenk, M. de Bono, Proceedings of the National Academy of Sciences 112 (2015) E3525–E3534.","chicago":"Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes in Neural Activity.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1423808112\">https://doi.org/10.1073/pnas.1423808112</a>.","ama":"Fenk LA, de Bono M. Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. <i>Proceedings of the National Academy of Sciences</i>. 2015;112(27):E3525-E3534. doi:<a href=\"https://doi.org/10.1073/pnas.1423808112\">10.1073/pnas.1423808112</a>"},"volume":112,"file_date_updated":"2020-07-14T12:47:20Z","date_created":"2019-03-19T14:15:50Z","date_updated":"2021-01-12T08:06:12Z","has_accepted_license":"1","external_id":{"pmid":["26100886"]},"intvolume":"       112","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["0027-8424","1091-6490"]}},{"external_id":{"pmid":["25760081"]},"date_updated":"2021-01-12T08:06:13Z","has_accepted_license":"1","publication_identifier":{"issn":["2050-084X"]},"intvolume":"         4","language":[{"iso":"eng"}],"quality_controlled":"1","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)"},"article_number":"e04241","date_created":"2019-03-19T14:23:51Z","file_date_updated":"2020-07-14T12:47:20Z","type":"journal_article","publisher":"eLife Sciences Publications","doi":"10.7554/elife.04241","day":"11","volume":4,"citation":{"short":"P. Laurent, Z. Soltesz, G.M. Nelson, C. Chen, F. Arellano-Carbajal, E. Levy, M. de Bono, ELife 4 (2015).","ieee":"P. Laurent <i>et al.</i>, “Decoding a neural circuit controlling global animal state in C. elegans,” <i>eLife</i>, vol. 4. eLife Sciences Publications, 2015.","mla":"Laurent, Patrick, et al. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” <i>ELife</i>, vol. 4, e04241, eLife Sciences Publications, 2015, doi:<a href=\"https://doi.org/10.7554/elife.04241\">10.7554/elife.04241</a>.","apa":"Laurent, P., Soltesz, Z., Nelson, G. M., Chen, C., Arellano-Carbajal, F., Levy, E., &#38; de Bono, M. (2015). Decoding a neural circuit controlling global animal state in C. elegans. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.04241\">https://doi.org/10.7554/elife.04241</a>","ista":"Laurent P, Soltesz Z, Nelson GM, Chen C, Arellano-Carbajal F, Levy E, de Bono M. 2015. Decoding a neural circuit controlling global animal state in C. elegans. eLife. 4, e04241.","ama":"Laurent P, Soltesz Z, Nelson GM, et al. Decoding a neural circuit controlling global animal state in C. elegans. <i>eLife</i>. 2015;4. doi:<a href=\"https://doi.org/10.7554/elife.04241\">10.7554/elife.04241</a>","chicago":"Laurent, Patrick, Zoltan Soltesz, Geoffrey M Nelson, Changchun Chen, Fausto Arellano-Carbajal, Emmanuel Levy, and Mario de Bono. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” <i>ELife</i>. eLife Sciences Publications, 2015. <a href=\"https://doi.org/10.7554/elife.04241\">https://doi.org/10.7554/elife.04241</a>."},"extern":"1","publication":"eLife","ddc":["570"],"status":"public","date_published":"2015-03-11T00:00:00Z","abstract":[{"text":"Brains organize behavior and physiology to optimize the response to threats or opportunities. We dissect how 21% O2, an indicator of surface exposure, reprograms C. elegans' global state, inducing sustained locomotory arousal and altering expression of neuropeptides, metabolic enzymes, and other non-neural genes. The URX O2-sensing neurons drive arousal at 21% O2 by tonically activating the RMG interneurons. Stimulating RMG is sufficient to switch behavioral state. Ablating the ASH, ADL, or ASK sensory neurons connected to RMG by gap junctions does not disrupt arousal. However, disrupting cation currents in these neurons curtails RMG neurosecretion and arousal. RMG signals high O2 by peptidergic secretion. Neuropeptide reporters reveal neural circuit state, as neurosecretion stimulates neuropeptide expression. Neural imaging in unrestrained animals shows that URX and RMG encode O2 concentration rather than behavior, while the activity of downstream interneurons such as AVB and AIY reflect both O2 levels and the behavior being executed.","lang":"eng"}],"oa":1,"file":[{"date_updated":"2020-07-14T12:47:20Z","file_name":"2015_elife_Laurent.pdf","checksum":"cf641b7a363aecd0a101755d23dee7e0","relation":"main_file","file_size":6723528,"file_id":"6121","access_level":"open_access","creator":"kschuh","date_created":"2019-03-19T14:29:43Z","content_type":"application/pdf"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Laurent","full_name":"Laurent, Patrick","first_name":"Patrick"},{"last_name":"Soltesz","first_name":"Zoltan","full_name":"Soltesz, Zoltan"},{"last_name":"Nelson","first_name":"Geoffrey M","full_name":"Nelson, Geoffrey M"},{"first_name":"Changchun","full_name":"Chen, Changchun","last_name":"Chen"},{"last_name":"Arellano-Carbajal","first_name":"Fausto","full_name":"Arellano-Carbajal, Fausto"},{"last_name":"Levy","full_name":"Levy, Emmanuel","first_name":"Emmanuel"},{"last_name":"de Bono","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","first_name":"Mario"}],"publication_status":"published","title":"Decoding a neural circuit controlling global animal state in C. elegans","oa_version":"Published Version","year":"2015","_id":"6120","month":"03","pmid":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_created":"2019-05-31T09:38:50Z","author":[{"last_name":"Zhou","orcid":"0000-0002-1864-8951","full_name":"Zhou, Long","id":"3E751364-F248-11E8-B48F-1D18A9856A87","first_name":"Long"},{"last_name":"Hinerman","first_name":"J. M.","full_name":"Hinerman, J. M."},{"first_name":"M.","full_name":"Blaszczyk, M.","last_name":"Blaszczyk"},{"first_name":"J. L. C.","full_name":"Miller, J. L. C.","last_name":"Miller"},{"last_name":"Conrady","first_name":"D. G.","full_name":"Conrady, D. G."},{"last_name":"Barrow","full_name":"Barrow, A. D.","first_name":"A. D."},{"last_name":"Chirgadze","first_name":"D. Y.","full_name":"Chirgadze, D. Y."},{"first_name":"D.","full_name":"Bihan, D.","last_name":"Bihan"},{"last_name":"Farndale","full_name":"Farndale, R. W.","first_name":"R. W."},{"first_name":"A. B.","full_name":"Herr, A. B.","last_name":"Herr"}],"date_updated":"2021-01-12T08:07:47Z","external_id":{"pmid":["26552697"]},"intvolume":"       127","quality_controlled":"1","abstract":[{"lang":"eng","text":"The osteoclast-associated receptor (OSCAR) is a collagen-binding immune receptor with important roles in dendritic cell maturation and activation of inflammatory monocytes as well as in osteoclastogenesis. The crystal structure of the OSCAR ectodomain is presented, both free and in complex with a consensus triple-helical peptide (THP). The structures revealed a collagen-binding site in each immunoglobulin-like domain (D1 and D2). The THP binds near a predicted collagen-binding groove in D1, but a more extensive interaction with D2 is facilitated by the unusually wide D1-D2 interdomain angle in OSCAR. Direct binding assays, combined with site-directed mutagenesis, confirm that the primary collagen-binding site in OSCAR resides in D2, in marked contrast to the related collagen receptors, glycoprotein VI (GPVI) and leukocyte-associated immunoglobulin-like receptor-1 (LAIR-1). Monomeric OSCAR D1D2 binds to the consensus THP with a KD of 28 µM measured in solution, but shows a higher affinity (KD 1.5 μM) when binding to a solid-phase THP, most likely due to an avidity effect. These data suggest a 2-stage model for the interaction of OSCAR with a collagen fibril, with transient, low-affinity interactions initiated by the membrane-distal D1, followed by firm adhesion to the primary binding site in D2."}],"date_published":"2015-11-02T00:00:00Z","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0006-4971","1528-0020"]},"pmid":1,"extern":"1","month":"11","publication":"Blood","page":"529-537","doi":"10.1182/blood-2015-08-667055","day":"02","publisher":"American Society of Hematology","title":"Structural basis for collagen recognition by the immune receptor OSCAR","type":"journal_article","year":"2015","_id":"6507","citation":{"short":"L. Zhou, J.M. Hinerman, M. Blaszczyk, J.L.C. Miller, D.G. Conrady, A.D. Barrow, D.Y. Chirgadze, D. Bihan, R.W. Farndale, A.B. Herr, Blood 127 (2015) 529–537.","apa":"Zhou, L., Hinerman, J. M., Blaszczyk, M., Miller, J. L. C., Conrady, D. G., Barrow, A. D., … Herr, A. B. (2015). Structural basis for collagen recognition by the immune receptor OSCAR. <i>Blood</i>. American Society of Hematology. <a href=\"https://doi.org/10.1182/blood-2015-08-667055\">https://doi.org/10.1182/blood-2015-08-667055</a>","ista":"Zhou L, Hinerman JM, Blaszczyk M, Miller JLC, Conrady DG, Barrow AD, Chirgadze DY, Bihan D, Farndale RW, Herr AB. 2015. Structural basis for collagen recognition by the immune receptor OSCAR. Blood. 127(5), 529–537.","mla":"Zhou, Long, et al. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” <i>Blood</i>, vol. 127, no. 5, American Society of Hematology, 2015, pp. 529–37, doi:<a href=\"https://doi.org/10.1182/blood-2015-08-667055\">10.1182/blood-2015-08-667055</a>.","ieee":"L. Zhou <i>et al.</i>, “Structural basis for collagen recognition by the immune receptor OSCAR,” <i>Blood</i>, vol. 127, no. 5. American Society of Hematology, pp. 529–537, 2015.","ama":"Zhou L, Hinerman JM, Blaszczyk M, et al. Structural basis for collagen recognition by the immune receptor OSCAR. <i>Blood</i>. 2015;127(5):529-537. doi:<a href=\"https://doi.org/10.1182/blood-2015-08-667055\">10.1182/blood-2015-08-667055</a>","chicago":"Zhou, Long, J. M. Hinerman, M. Blaszczyk, J. L. C. Miller, D. G. Conrady, A. D. Barrow, D. Y. Chirgadze, D. Bihan, R. W. Farndale, and A. B. Herr. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” <i>Blood</i>. American Society of Hematology, 2015. <a href=\"https://doi.org/10.1182/blood-2015-08-667055\">https://doi.org/10.1182/blood-2015-08-667055</a>."},"issue":"5","volume":127,"oa_version":"None"},{"_id":"6736","issue":"9","citation":{"chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Scaling Exponent of List Decoders with Applications to Polar Codes.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/tit.2015.2453315\">https://doi.org/10.1109/tit.2015.2453315</a>.","ama":"Mondelli M, Hassani H, Urbanke R. Scaling exponent of list decoders with applications to polar codes. <i>IEEE Transactions on Information Theory</i>. 2015;61(9):4838-4851. doi:<a href=\"https://doi.org/10.1109/tit.2015.2453315\">10.1109/tit.2015.2453315</a>","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Scaling exponent of list decoders with applications to polar codes,” <i>IEEE Transactions on Information Theory</i>, vol. 61, no. 9. IEEE, pp. 4838–4851, 2015.","apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2015). Scaling exponent of list decoders with applications to polar codes. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2015.2453315\">https://doi.org/10.1109/tit.2015.2453315</a>","ista":"Mondelli M, Hassani H, Urbanke R. 2015. Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. 61(9), 4838–4851.","mla":"Mondelli, Marco, et al. “Scaling Exponent of List Decoders with Applications to Polar Codes.” <i>IEEE Transactions on Information Theory</i>, vol. 61, no. 9, IEEE, 2015, pp. 4838–51, doi:<a href=\"https://doi.org/10.1109/tit.2015.2453315\">10.1109/tit.2015.2453315</a>.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 61 (2015) 4838–4851."},"year":"2015","oa_version":"Preprint","volume":61,"publisher":"IEEE","doi":"10.1109/tit.2015.2453315","day":"01","page":"4838-4851","type":"journal_article","title":"Scaling exponent of list decoders with applications to polar codes","publication":"IEEE Transactions on Information Theory","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1304.5220"}],"extern":"1","month":"09","quality_controlled":"1","date_published":"2015-09-01T00:00:00Z","abstract":[{"text":"Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff between the block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under MAP decoding with list size L for any binary-input memoryless output-symmetric channel and for any class of linear codes such that their minimum distance is unbounded as the block length grows large. Then, it is shown that under MAP decoding, although the introduction of a list can significantly improve the involved constants, the scaling exponent itself, i.e., the speed at which capacity is approached, stays unaffected for any finite list size. In particular, this result applies to polar codes, since their minimum distance tends to infinity as the block length increases. A similar result is proved for genie-aided successive cancellation decoding when transmission takes place over the binary erasure channel, namely, the scaling exponent remains constant for any fixed number of helps from the genie. Note that since genie-aided successive cancellation decoding might be strictly worse than successive cancellation list decoding, the problem of establishing the scaling exponent of the latter remains open.","lang":"eng"}],"language":[{"iso":"eng"}],"intvolume":"        61","status":"public","date_updated":"2021-01-12T08:08:45Z","arxiv":1,"external_id":{"arxiv":["1304.5220"]},"date_created":"2019-07-31T06:50:34Z","publication_status":"published","author":[{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"},{"last_name":"Urbanke","first_name":"Rudiger","full_name":"Urbanke, Rudiger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1401.6060"}],"month":"02","publication":"IEEE Transactions on Information Theory","page":"783-800","day":"01","publisher":"IEEE","doi":"10.1109/tit.2014.2368555","title":"Achieving Marton’s region for broadcast channels using polar codes","type":"journal_article","year":"2015","citation":{"ama":"Mondelli M, Hassani H, Sason I, Urbanke R. Achieving Marton’s region for broadcast channels using polar codes. <i>IEEE Transactions on Information Theory</i>. 2015;61(2):783-800. doi:<a href=\"https://doi.org/10.1109/tit.2014.2368555\">10.1109/tit.2014.2368555</a>","chicago":"Mondelli, Marco, Hamed Hassani, Igal Sason, and Rudiger Urbanke. “Achieving Marton’s Region for Broadcast Channels Using Polar Codes.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/tit.2014.2368555\">https://doi.org/10.1109/tit.2014.2368555</a>.","short":"M. Mondelli, H. Hassani, I. Sason, R. Urbanke, IEEE Transactions on Information Theory 61 (2015) 783–800.","ieee":"M. Mondelli, H. Hassani, I. Sason, and R. Urbanke, “Achieving Marton’s region for broadcast channels using polar codes,” <i>IEEE Transactions on Information Theory</i>, vol. 61, no. 2. IEEE, pp. 783–800, 2015.","mla":"Mondelli, Marco, et al. “Achieving Marton’s Region for Broadcast Channels Using Polar Codes.” <i>IEEE Transactions on Information Theory</i>, vol. 61, no. 2, IEEE, 2015, pp. 783–800, doi:<a href=\"https://doi.org/10.1109/tit.2014.2368555\">10.1109/tit.2014.2368555</a>.","apa":"Mondelli, M., Hassani, H., Sason, I., &#38; Urbanke, R. (2015). Achieving Marton’s region for broadcast channels using polar codes. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2014.2368555\">https://doi.org/10.1109/tit.2014.2368555</a>","ista":"Mondelli M, Hassani H, Sason I, Urbanke R. 2015. Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. 61(2), 783–800."},"_id":"6737","issue":"2","volume":61,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","date_created":"2019-07-31T07:03:38Z","author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"first_name":"Hamed","full_name":"Hassani, Hamed","last_name":"Hassani"},{"first_name":"Igal","full_name":"Sason, Igal","last_name":"Sason"},{"full_name":"Urbanke, Rudiger","first_name":"Rudiger","last_name":"Urbanke"}],"date_updated":"2021-01-12T08:08:46Z","external_id":{"arxiv":["1401.6060"]},"arxiv":1,"intvolume":"        61","abstract":[{"text":"This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all classes of two-user DM-BCs whose capacity regions are known. To accomplish this task, we first construct polar codes for both the superposition as well as binning strategy. By combining these two schemes, we obtain Marton's region with private messages only. Finally, we show how to handle the case of common information. The proposed coding schemes possess the usual advantages of polar codes, i.e., they have low encoding and decoding complexity and a superpolynomial decay rate of the error probability. We follow the lead of Goela, Abbe, and Gastpar, who recently introduced polar codes emulating the superposition and binning schemes. To align the polar indices, for both schemes, their solution involves some degradedness constraints that are assumed to hold between the auxiliary random variables and channel outputs. To remove these constraints, we consider the transmission of k blocks and employ a chaining construction that guarantees the proper alignment of the polarized indices. The techniques described in this paper are quite general, and they can be adopted to many other multiterminal scenarios whenever there polar indices need to be aligned.","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","quality_controlled":"1","status":"public"}]