[{"citation":{"mla":"Chatterjee, Krishnendu, et al. *Edit Distance for Pushdown Automata*. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. *Edit Distance for Pushdown Automata*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.","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.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, *Edit distance for pushdown automata*. IST Austria, 2015.","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"},"type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"oa":1,"date_updated":"2021-01-12T08:02:18Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"465"},{"relation":"later_version","id":"1610","status":"public"}]},"page":"15","has_accepted_license":"1","month":"05","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Edit distance for pushdown automata","pubrep_id":"334","_id":"5438","date_published":"2015-05-05T00:00:00Z","file":[{"date_updated":"2020-07-14T12:46:55Z","checksum":"8a5f2d77560e552af87eb1982437a43b","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2015-334-v1+1_report.pdf","relation":"main_file","date_created":"2018-12-12T11:53:56Z","file_size":422573,"file_id":"5518","creator":"system"}],"department":[{"_id":"KrCh"}],"alternative_title":["IST Austria Technical Report"],"ddc":["004"],"oa_version":"Published Version","doi":"10.15479/AT:IST-2015-334-v1-1","publication_status":"published","language":[{"iso":"eng"}],"day":"05","date_created":"2018-12-12T11:39:20Z","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:55Z","abstract":[{"lang":"eng","text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. "}],"year":"2015","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}]},{"author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"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. "}],"year":"2015","day":"18","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:39:20Z","language":[{"iso":"eng"}],"ddc":["004","512","513"],"oa_version":"Published Version","doi":"10.15479/AT:IST-2015-335-v1-1","publication_status":"published","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"ToHe"}],"_id":"5439","date_published":"2015-05-18T00:00:00Z","file":[{"creator":"system","file_id":"5517","date_created":"2018-12-12T11:53:55Z","file_size":589619,"relation":"main_file","file_name":"IST-2015-335-v1+1_report.pdf","content_type":"application/pdf","access_level":"open_access","checksum":"40405907aa012acece1bc26cf0be554d","date_updated":"2020-07-14T12:46:55Z"}],"pubrep_id":"335","title":"The target discounted-sum problem","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","has_accepted_license":"1","date_updated":"2021-01-12T08:02:19Z","page":"20","related_material":{"record":[{"relation":"later_version","id":"1659","status":"public"}]},"type":"technical_report","oa":1,"publication_identifier":{"issn":["2664-1690"]},"citation":{"short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","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","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.","mla":"Boker, Udi, et al. *The Target Discounted-Sum Problem*. IST Austria, 2015, doi: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","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p."}},{"year":"2015","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"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"file_date_updated":"2020-07-14T12:46:56Z","date_created":"2018-12-12T11:39:21Z","publisher":"IST Austria","day":"16","publication_status":"published","doi":"10.15479/AT:IST-2015-323-v2-2","oa_version":"Published Version","ddc":["005","576"],"language":[{"iso":"eng"}],"_id":"5440","file":[{"date_updated":"2020-07-14T12:46:56Z","access_level":"open_access","checksum":"66aace7d367032af97c15e35c9be9636","content_type":"application/pdf","file_name":"IST-2015-323-v2+2_main.pdf","relation":"main_file","file_id":"5484","file_size":466161,"date_created":"2018-12-12T11:53:23Z","creator":"system"}],"date_published":"2015-06-16T00:00:00Z","department":[{"_id":"KrCh"}],"alternative_title":["IST Austria Technical Report"],"title":"The complexity of evolutionary games on graphs","pubrep_id":"338","month":"06","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","type":"technical_report","oa":1,"publication_identifier":{"issn":["2664-1690"]},"date_updated":"2021-01-12T08:02:20Z","page":"18","related_material":{"record":[{"status":"public","id":"5421","relation":"earlier_version"},{"relation":"earlier_version","id":"5432","status":"public"}]},"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.","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","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, *The complexity of evolutionary games on graphs*. IST Austria, 2015.","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"}},{"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.","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","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.","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.","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.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p."},"related_material":{"record":[{"status":"public","relation":"later_version","id":"1437"},{"status":"public","id":"5442","relation":"earlier_version"},{"status":"public","id":"6009","relation":"later_version"}]},"page":"24","date_updated":"2021-01-12T08:05:39Z","oa":1,"type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","month":"07","pubrep_id":"340","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"KrCh"}],"file":[{"date_updated":"2020-07-14T12:46:56Z","checksum":"df383dc62c94d7b2ea639aba088a76c6","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2015-340-v1+1_main.pdf","relation":"main_file","file_size":861396,"date_created":"2018-12-12T11:54:09Z","file_id":"5531","creator":"system"}],"_id":"5441","date_published":"2015-07-11T00:00:00Z","language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.15479/AT:IST-2015-340-v1-1","oa_version":"Published Version","publication_status":"published","day":"11","file_date_updated":"2020-07-14T12:46:56Z","date_created":"2018-12-12T11:39:21Z","publisher":"IST Austria","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.","lang":"eng"}],"year":"2015"},{"related_material":{"record":[{"status":"public","id":"5441","relation":"later_version"},{"relation":"later_version","id":"1437","status":"public"},{"relation":"later_version","id":"6009","status":"public"}]},"date_updated":"2021-01-12T08:05:39Z","page":"22","publication_identifier":{"issn":["2664-1690"]},"type":"technical_report","oa":1,"citation":{"ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 22p.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria; 2015.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria, 2015.","mla":"Anonymous, 1, et al. *Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components*. IST Austria, 2015.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2015). *Algorithms for algebraic path properties in concurrent systems of constant treewidth components*. IST Austria.","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.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015."},"pubrep_id":"344","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","month":"07","language":[{"iso":"eng"}],"oa_version":"Published Version","ddc":["000"],"publication_status":"published","alternative_title":["IST Austria Technical Report"],"_id":"5442","file":[{"file_id":"5498","date_created":"2018-12-12T11:53:37Z","file_size":658747,"creator":"system","file_name":"IST-2015-343-v2+1_main.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:57Z","checksum":"98fd936102f3e057fc321ef6d316001d","access_level":"open_access"},{"access_level":"closed","checksum":"b31d09b1241b59c75e1f42dadf09d258","date_updated":"2020-07-14T12:46:57Z","content_type":"text/plain","relation":"main_file","file_name":"IST-2015-343-v2+2_anonymous.txt","creator":"dernst","file_id":"6316","file_size":139,"date_created":"2019-04-16T12:36:08Z"}],"date_published":"2015-07-14T00:00:00Z","author":[{"last_name":"Anonymous","full_name":"Anonymous, 1","first_name":"1"},{"first_name":"2","full_name":"Anonymous, 2","last_name":"Anonymous"},{"last_name":"Anonymous","full_name":"Anonymous, 3","first_name":"3"},{"full_name":"Anonymous, 4","first_name":"4","last_name":"Anonymous"}],"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,"year":"2015","day":"14","date_created":"2018-12-12T11:39:21Z","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:57Z"}]