Faster algorithms for quantitative verification in bounded treewidth graphs

We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth =()) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in (2⋅) time and the associated decision problem in (⋅) time, improving the previous known (3⋅⋅log(⋅)) and (2⋅) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires (⋅log) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+ in time (⋅log(/)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time (⋅log(|⋅|))=(⋅log(⋅)), when the output is , as compared to the previously best known algorithm on general graphs with running time (2⋅log(⋅)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks