[{"day":"10","language":[{}],"date_created":"2018-12-12T11:39:17Z","page":"31","dc":{"type":["info:eu-repo/semantics/technical_report","doc-type:other","text"],"source":["Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1"],"language":["eng"],"date":["2015"],"subject":["ddc:000"],"description":["We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."],"title":["Faster algorithms for quantitative verification in constant treewidth graphs","IST Austria Technical Report"],"identifier":["https://research-explorer.app.ist.ac.at/record/5430","https://research-explorer.app.ist.ac.at/download/5430/5482"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.15479/AT:IST-2015-319-v1-1","info:eu-repo/semantics/altIdentifier/issn/2664-1690"],"publisher":["IST Austria"],"creator":["Chatterjee, Krishnendu","Ibsen-Jensen, Rasmus","Pavlogiannis, Andreas"],"rights":["info:eu-repo/semantics/closedAccess"]},"dini_type":"doc-type:other","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng"}],"date_published":"2015-02-10T00:00:00Z","type":"technical_report","date_updated":"2020-01-17T09:46:32Z","accept":"1","department":[{"_id":"KrCh","tree":[{"_id":"ResearchGroups"},{"_id":"IST"}]}],"file":[{"file_name":"IST-2015-319-v1+1_long.pdf","creator":"system","relation":"main_file","date_updated":"2018-12-12T11:53:21Z","content_type":"application/pdf","file_size":1089651,"open_access":1,"access_level":"open_access","date_created":"2018-12-12T11:53:21Z","file_id":"5482"}],"status":"public","ddc":[],"_id":"5430","publication_status":"published","creator":{"login":"dernst","id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},"month":"02","file_date_updated":"2018-12-12T11:53:21Z","pubrep_id":"319","uri_base":"https://research-explorer.app.ist.ac.at","related_material":{"record":[{"id":"1607","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"5437"}]},"_version":41,"alternative_title":[],"oa_version":"Published Version","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). *Faster algorithms for quantitative verification in constant treewidth graphs*. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, *Faster algorithms for quantitative verification in constant treewidth graphs*. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. *Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs*. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1."},"publication_identifier":{"issn":[]},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}]}]