A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Quantitative Verification of Weighted Kripke Structures
[chapter]
2014
Lecture Notes in Computer Science
Extending formal verification techniques to handle quantitative aspects, both for the models and for the properties to be checked, has become a central research topic over the last twenty years. Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal logics constraining the total and/or average weight. We prove decidability when only accumulated weight is constrained, while allowing average-weight constraints alone already is undecidable.
doi:10.1007/978-3-319-11936-6_6
fatcat:fc3xuqmwrzhibpau7ijyjqxrry