Faster algorithms for quantitative verification in bounded treewidth graphs



Chatterjee, Krishnendu, Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas
(2021) Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design.

Access the full-text of this item by clicking on the Open Access link.
Item Type: Article
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 28 May 2021 07:34
Last Modified: 14 Apr 2022 00:10
DOI: 10.1007/s10703-021-00373-5
Open Access URL: https://arxiv.org/pdf/1504.07384.pdf
URI: https://livrepository.liverpool.ac.uk/id/eprint/3124228