Faster algorithms for quantitative verification in bounded treewidth graphs

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design, 57(3):401-428, 2021. [doi]

@article{ChatterjeeIP21-0,
  title = {Faster algorithms for quantitative verification in bounded treewidth graphs},
  author = {Krishnendu Chatterjee and Rasmus Ibsen-Jensen and Andreas Pavlogiannis},
  year = {2021},
  doi = {10.1007/s10703-021-00373-5},
  url = {https://doi.org/10.1007/s10703-021-00373-5},
  researchr = {https://researchr.org/publication/ChatterjeeIP21-0},
  cites = {0},
  citedby = {0},
  journal = {Formal Methods in System Design},
  volume = {57},
  number = {3},
  pages = {401-428},
}