Saved in:
| Main Authors: | , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.13583 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929353908027392 |
|---|---|
| author | Andriushchenko, Roman Bork, Alexander Budde, Carlos E. Češka, Milan Grover, Kush Hahn, Ernst Moritz Hartmanns, Arnd Israelsen, Bryant Jansen, Nils Jeppson, Joshua Junges, Sebastian Köhl, Maximilian A. Könighofer, Bettina Křetínský, Jan Meggendorfer, Tobias Parker, David Pranger, Stefan Quatmann, Tim Ruijters, Enno Taylor, Landon Volk, Matthias Weininger, Maximilian Zhang, Zhen |
| author_facet | Andriushchenko, Roman Bork, Alexander Budde, Carlos E. Češka, Milan Grover, Kush Hahn, Ernst Moritz Hartmanns, Arnd Israelsen, Bryant Jansen, Nils Jeppson, Joshua Junges, Sebastian Köhl, Maximilian A. Könighofer, Bettina Křetínský, Jan Meggendorfer, Tobias Parker, David Pranger, Stefan Quatmann, Tim Ruijters, Enno Taylor, Landon Volk, Matthias Weininger, Maximilian Zhang, Zhen |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_13583 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tools at the Frontiers of Quantitative Verification Andriushchenko, Roman Bork, Alexander Budde, Carlos E. Češka, Milan Grover, Kush Hahn, Ernst Moritz Hartmanns, Arnd Israelsen, Bryant Jansen, Nils Jeppson, Joshua Junges, Sebastian Köhl, Maximilian A. Könighofer, Bettina Křetínský, Jan Meggendorfer, Tobias Parker, David Pranger, Stefan Quatmann, Tim Ruijters, Enno Taylor, Landon Volk, Matthias Weininger, Maximilian Zhang, Zhen Logic in Computer Science 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. |
| title | Tools at the Frontiers of Quantitative Verification |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2405.13583 |