English

Tools at the Frontiers of Quantitative Verification

Logic in Computer Science 2024-05-24 v1

Abstract

The analysis of formal models that include quantitative aspects such as timing or probabilistic choices is performed by quantitative verification tools. Broad and mature tool support is available for computing basic properties such as expected rewards on basic models such as Markov chains. Previous editions of QComp, the comparison of tools for the analysis of quantitative formal models, focused on this setting. Many application scenarios, however, require more advanced property types such as LTL and parameter synthesis queries as well as advanced models like stochastic games and partially observable MDPs. For these, tool support is in its infancy today. This paper presents the outcomes of QComp 2023: a survey of the state of the art in quantitative verification tool support for advanced property types and models. With tools ranging from first research prototypes to well-supported integrations into established toolsets, this report highlights today's active areas and tomorrow's challenges in tool-focused research for quantitative verification.

Keywords

Cite

@article{arxiv.2405.13583,
  title  = {Tools at the Frontiers of Quantitative Verification},
  author = {Roman Andriushchenko and Alexander Bork and Carlos E. Budde and Milan Češka and Kush Grover and Ernst Moritz Hahn and Arnd Hartmanns and Bryant Israelsen and Nils Jansen and Joshua Jeppson and Sebastian Junges and Maximilian A. Köhl and Bettina Könighofer and Jan Křetínský and Tobias Meggendorfer and David Parker and Stefan Pranger and Tim Quatmann and Enno Ruijters and Landon Taylor and Matthias Volk and Maximilian Weininger and Zhen Zhang},
  journal= {arXiv preprint arXiv:2405.13583},
  year   = {2024}
}
R2 v1 2026-06-28T16:35:37.866Z