University of Twente Student Theses
On the Performance of Algorithms for Quantitative Verification
Hop, Ivan J. (2022) On the Performance of Algorithms for Quantitative Verification.
|
PDF
3MB |
| Abstract: | Quantitative verification is used to verify quantitative properties of a system. The expected response time and the probability of failure are examples of properties that we can verify. Various algorithms can calculate these properties. This thesis contains an in-depth analysis into the performance of these algorithms. We identified 3 groups of algorithms that have similar performance. These groups roughly match the technique used to store the state space. The groups used the techniques explicit and symbolic (BDD-based) as well as statistical model checking, which explores the state space on-the-fly. The paper contains an overview of the performance of algorithms against each other. We observed that algorithms that were faster on average, had fewer best times. We investigated correlations between the performance of algorithms and the number of states, transitions and branches in the model of the system. We observed that most explicit algorithms have a linear correlation to these characteristics. The other algorithms did not have a statistically significant correlation. |
| Item Type: | Essay (Master) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science MSc (60300) |
| Link to this item: | https://purl.utwente.nl/essays/93574 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page