[{"page":"27","pubrep_id":"333","date_published":"2015-04-27T00:00:00Z","language":[{"iso":"eng"}],"_id":"5437","related_material":{"record":[{"status":"public","id":"5430","relation":"earlier_version"},{"id":"1607","relation":"later_version","status":"public"}]},"date_created":"2018-12-12T11:39:19Z","ddc":["000"],"status":"public","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","has_accepted_license":"1","department":[{"_id":"KrCh"}],"oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"month":"04","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.","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.","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.","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","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"},"date_updated":"2020-08-11T10:09:21Z","year":"2015","doi":"10.15479/AT:IST-2015-330-v2-1","file_date_updated":"2020-07-14T12:46:54Z","title":"Faster algorithms for quantitative verification in constant treewidth graphs","publication_status":"published","alternative_title":["IST Austria Technical Report"],"file":[{"file_id":"5473","file_name":"IST-2015-330-v2+1_main.pdf","date_created":"2018-12-12T11:53:12Z","checksum":"f5917c20f84018b362d385c000a2e123","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:54Z","file_size":1072137,"creator":"system","access_level":"open_access"}],"oa":1,"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"}],"publisher":"IST Austria","day":"27"},{"doi":"10.15479/AT:IST-2015-334-v1-1","year":"2015","date_updated":"2020-08-11T10:10:15Z","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, *Edit distance for pushdown automata*. IST Austria, 2015.","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.","mla":"Chatterjee, Krishnendu, et al. *Edit Distance for Pushdown Automata*. IST Austria, 2015, doi: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.","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"},"month":"05","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","department":[{"_id":"KrCh"}],"has_accepted_license":"1","day":"05","publisher":"IST Austria","abstract":[{"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. ","lang":"eng"}],"oa":1,"file":[{"date_created":"2018-12-12T11:53:56Z","file_name":"IST-2015-334-v1+1_report.pdf","file_id":"5518","access_level":"open_access","file_size":422573,"creator":"system","date_updated":"2020-07-14T12:46:55Z","content_type":"application/pdf","relation":"main_file","checksum":"8a5f2d77560e552af87eb1982437a43b"}],"title":"Edit distance for pushdown automata","publication_status":"published","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:55Z","_id":"5438","language":[{"iso":"eng"}],"date_published":"2015-05-05T00:00:00Z","pubrep_id":"334","page":"15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"status":"public","ddc":["004"],"date_created":"2018-12-12T11:39:20Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"1610"},{"id":"465","relation":"later_version","status":"public"}]}},{"publisher":"IST Austria","day":"18","abstract":[{"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. ","lang":"eng"}],"oa":1,"file":[{"access_level":"open_access","relation":"main_file","checksum":"40405907aa012acece1bc26cf0be554d","creator":"system","date_updated":"2020-07-14T12:46:55Z","file_size":589619,"content_type":"application/pdf","date_created":"2018-12-12T11:53:55Z","file_id":"5517","file_name":"IST-2015-335-v1+1_report.pdf"}],"title":"The target discounted-sum problem","publication_status":"published","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:55Z","year":"2015","doi":"10.15479/AT:IST-2015-335-v1-1","citation":{"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","ama":"Boker U, Henzinger TA, Otop J. *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.","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","mla":"Boker, Udi, et al. *The Target Discounted-Sum Problem*. IST Austria, 2015, doi:10.15479/AT:IST-2015-335-v1-1.","ieee":"U. Boker, T. A. Henzinger, and J. Otop, *The target discounted-sum problem*. IST Austria, 2015.","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."},"date_updated":"2020-08-11T10:09:25Z","publication_identifier":{"issn":["2664-1690"]},"month":"05","oa_version":"Published Version","department":[{"_id":"ToHe"}],"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"status":"public","ddc":["004","512","513"],"date_created":"2018-12-12T11:39:20Z","related_material":{"record":[{"status":"public","id":"1659","relation":"later_version"}]},"language":[{"iso":"eng"}],"_id":"5439","date_published":"2015-05-18T00:00:00Z","pubrep_id":"335","page":"20"},{"has_accepted_license":"1","oa_version":"Published Version","department":[{"_id":"KrCh"}],"month":"06","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2020-07-14T23:08:06Z","citation":{"mla":"Chatterjee, Krishnendu, et al. *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.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and 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","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","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"},"year":"2015","doi":"10.15479/AT:IST-2015-323-v2-2","file_date_updated":"2020-07-14T12:46:56Z","alternative_title":["IST Austria Technical Report"],"publication_status":"published","title":"The complexity of evolutionary games on graphs","file":[{"access_level":"open_access","relation":"main_file","checksum":"66aace7d367032af97c15e35c9be9636","file_size":466161,"creator":"system","date_updated":"2020-07-14T12:46:56Z","content_type":"application/pdf","date_created":"2018-12-12T11:53:23Z","file_id":"5484","file_name":"IST-2015-323-v2+2_main.pdf"}],"oa":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 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."}],"publisher":"IST Austria","day":"16","page":"18","pubrep_id":"338","date_published":"2015-06-16T00:00:00Z","_id":"5440","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"5421","relation":"earlier_version","status":"public"},{"status":"public","id":"5432","relation":"earlier_version"}]},"date_created":"2018-12-12T11:39:21Z","ddc":["005","576"],"status":"public","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report"},{"citation":{"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.","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.","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","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","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.","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.","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."},"date_updated":"2020-08-11T10:10:29Z","doi":"10.15479/AT:IST-2015-340-v1-1","year":"2015","has_accepted_license":"1","department":[{"_id":"KrCh"}],"oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"month":"07","file":[{"file_name":"IST-2015-340-v1+1_main.pdf","file_id":"5531","date_created":"2018-12-12T11:54:09Z","file_size":861396,"date_updated":"2020-07-14T12:46:56Z","creator":"system","content_type":"application/pdf","checksum":"df383dc62c94d7b2ea639aba088a76c6","relation":"main_file","access_level":"open_access"}],"oa":1,"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","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:56Z","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","alternative_title":["IST Austria Technical Report"],"publication_status":"published","language":[{"iso":"eng"}],"_id":"5441","page":"24","pubrep_id":"340","date_published":"2015-07-11T00:00:00Z","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","id":"1437","status":"public"},{"relation":"earlier_version","id":"5442","status":"public"},{"id":"6009","relation":"later_version","status":"public"}]},"date_created":"2018-12-12T11:39:21Z","status":"public","ddc":["000"],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"full_name":"Goharshady, Amir","first_name":"Amir","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"}]},{"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","publication_status":"published","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:57Z","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 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.","lang":"eng"}],"day":"14","publisher":"IST Austria","file":[{"date_created":"2018-12-12T11:53:37Z","file_id":"5498","file_name":"IST-2015-343-v2+1_main.pdf","access_level":"open_access","checksum":"98fd936102f3e057fc321ef6d316001d","relation":"main_file","date_updated":"2020-07-14T12:46:57Z","file_size":658747,"creator":"system","content_type":"application/pdf"},{"content_type":"text/plain","creator":"dernst","file_size":139,"date_updated":"2020-07-14T12:46:57Z","relation":"main_file","checksum":"b31d09b1241b59c75e1f42dadf09d258","access_level":"closed","file_name":"IST-2015-343-v2+2_anonymous.txt","file_id":"6316","date_created":"2019-04-16T12:36:08Z"}],"oa":1,"month":"07","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","oa_version":"Published Version","year":"2015","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.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. 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.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 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.","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.","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."},"date_updated":"2020-08-11T10:10:29Z","status":"public","ddc":["000"],"author":[{"full_name":"Anonymous, 1","first_name":"1","last_name":"Anonymous"},{"last_name":"Anonymous","first_name":"2","full_name":"Anonymous, 2"},{"last_name":"Anonymous","full_name":"Anonymous, 3","first_name":"3"},{"first_name":"4","full_name":"Anonymous, 4","last_name":"Anonymous"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1437"},{"status":"public","relation":"later_version","id":"5441"},{"status":"public","relation":"later_version","id":"6009"}]},"date_created":"2018-12-12T11:39:21Z","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-07-14T00:00:00Z","scopus_import":1,"page":"22","pubrep_id":"344","language":[{"iso":"eng"}],"_id":"5442"},{"publication_identifier":{"issn":["2664-1690"]},"month":"11","department":[{"_id":"KrCh"}],"oa_version":"Published Version","has_accepted_license":"1","doi":"10.15479/AT:IST-2015-325-v2-1","year":"2015","citation":{"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.","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.","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.","short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015."},"date_updated":"2020-07-14T23:05:06Z","publication_status":"published","title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:57Z","day":"06","publisher":"IST Austria","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"}],"oa":1,"file":[{"date_created":"2018-12-12T11:53:05Z","file_id":"5466","file_name":"IST-2015-325-v2+1_main.pdf","access_level":"open_access","relation":"main_file","checksum":"f0fa31ad8161ed655137e94012123ef9","creator":"system","file_size":412379,"date_updated":"2020-07-14T12:46:57Z","content_type":"application/pdf"}],"date_published":"2015-11-06T00:00:00Z","pubrep_id":"362","page":"23","_id":"5443","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"},{"id":"378E0060-F248-11E8-B48F-1D18A9856A87","last_name":"Davies","first_name":"Jessica","full_name":"Davies, Jessica"}],"ddc":["000"],"status":"public","date_created":"2018-12-12T11:39:22Z","related_material":{"record":[{"status":"public","id":"1166","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report"},{"pubrep_id":"399","page":"25","date_published":"2015-12-30T00:00:00Z","language":[{"iso":"eng"}],"_id":"5444","date_created":"2018-12-12T11:39:22Z","author":[{"orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","first_name":"Johannes","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"},{"first_name":"Ivana","full_name":"Bozic, Ivana","last_name":"Bozic"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Iacobuzio-Donahue","first_name":"Christine","full_name":"Iacobuzio-Donahue, Christine"},{"full_name":"Vogelstein, Bert","first_name":"Bert","last_name":"Vogelstein"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"status":"public","ddc":["000","576"],"type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"oa_version":"Published Version","has_accepted_license":"1","month":"12","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2020-07-14T23:05:07Z","citation":{"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","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.","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.","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","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.","mla":"Reiter, Johannes, et al. *Reconstructing Robust Phylogenies of Metastatic Cancers*. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1."},"doi":"10.15479/AT:IST-2015-399-v1-1","year":"2015","file_date_updated":"2020-07-14T12:46:58Z","title":"Reconstructing robust phylogenies of metastatic cancers","alternative_title":["IST Austria Technical Report"],"publication_status":"published","oa":1,"file":[{"access_level":"open_access","content_type":"application/pdf","file_size":3533200,"creator":"system","date_updated":"2020-07-14T12:46:58Z","checksum":"c47d33bdda06181753c0af36f16e7b5d","relation":"main_file","date_created":"2018-12-12T11:53:24Z","file_name":"IST-2015-399-v1+1_treeomics.pdf","file_id":"5485"}],"day":"30","publisher":"IST Austria","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"}]},{"month":"01","publication_identifier":{"issn":["2664-1690"]},"department":[{"_id":"ToHe"}],"oa_version":"Published Version","has_accepted_license":"1","year":"2014","doi":"10.15479/AT:IST-2014-148-v2-1","date_updated":"2020-08-11T10:09:40Z","citation":{"mla":"Daca, Przemyslaw, et al. *Compositional Specifications for IOCO Testing*. IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, *Compositional specifications for IOCO testing*. IST Austria, 2014.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. *Compositional Specifications for IOCO Testing*. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-148-v2-1.","apa":"Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). *Compositional specifications for IOCO testing*. IST Austria. https://doi.org/10.15479/AT:IST-2014-148-v2-1","ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. *Compositional Specifications for IOCO Testing*. IST Austria; 2014. doi:10.15479/AT:IST-2014-148-v2-1","ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p.","short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014."},"publication_status":"published","alternative_title":["IST Austria Technical Report"],"title":"Compositional specifications for IOCO testing","file_date_updated":"2020-07-14T12:46:46Z","publisher":"IST Austria","day":"28","abstract":[{"lang":"eng","text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.\r\nIn this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems."}],"oa":1,"file":[{"file_id":"5543","file_name":"IST-2014-148-v2+1_main_tr.pdf","date_created":"2018-12-12T11:54:21Z","checksum":"0e03aba625cc334141a3148432aa5760","relation":"main_file","file_size":534732,"date_updated":"2020-07-14T12:46:46Z","creator":"system","content_type":"application/pdf","access_level":"open_access"}],"date_published":"2014-01-28T00:00:00Z","pubrep_id":"152","page":"20","language":[{"iso":"eng"}],"_id":"5411","author":[{"last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Krenn","full_name":"Krenn, Willibald","first_name":"Willibald"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"ddc":["000"],"status":"public","date_created":"2018-12-12T11:39:11Z","related_material":{"record":[{"status":"public","id":"2167","relation":"later_version"}]},"type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"day":"29","publisher":"IST Austria","file":[{"file_name":"IST-2014-153-v1+1_main.pdf","file_id":"5500","date_created":"2018-12-12T11:53:39Z","creator":"system","file_size":423322,"date_updated":"2020-07-14T12:46:47Z","content_type":"application/pdf","relation":"main_file","checksum":"4d6cda4bebed970926403ad6ad8c745f","access_level":"open_access"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"title":"CEGAR for qualitative analysis of probabilistic systems","publication_status":"published","file_date_updated":"2020-07-14T12:46:47Z","year":"2014","doi":"10.15479/AT:IST-2014-153-v1-1","date_updated":"2020-07-14T23:04:53Z","citation":{"apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). *CEGAR for qualitative analysis of probabilistic systems*. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ama":"Chatterjee K, Daca P, Chmelik M. *CEGAR for Qualitative Analysis of Probabilistic Systems*. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v1-1","mla":"Chatterjee, Krishnendu, et al. *CEGAR for Qualitative Analysis of Probabilistic Systems*. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. *CEGAR for Qualitative Analysis of Probabilistic Systems*. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, *CEGAR for qualitative analysis of probabilistic systems*. IST Austria, 2014."},"publication_identifier":{"issn":["2664-1690"]},"month":"01","has_accepted_license":"1","oa_version":"Published Version","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","ddc":["000"],"status":"public","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"2063"},{"status":"public","relation":"later_version","id":"5414"},{"relation":"later_version","id":"5413","status":"public"}]},"date_created":"2018-12-12T11:39:11Z","language":[{"iso":"eng"}],"_id":"5412","date_published":"2014-01-29T00:00:00Z","page":"31","pubrep_id":"153"}]