Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version)
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909725878124544 |
|---|---|
| author | Stramaglia, Anna Keiren, Jeroen J. A. Laveaux, Maurice Willemse, Tim A. C. |
| author_facet | Stramaglia, Anna Keiren, Jeroen J. A. Laveaux, Maurice Willemse, Tim A. C. |
| contents | Model checking is a technique to automatically assess whether a model of the behaviour of a system meets its requirements. Evidence explaining why the behaviour does (not) meet its requirements is essential for the user to understand the model checking result. Willemse and Wesselink showed that parameterised Boolean equation systems (PBESs), an intermediate format for $μ$-calculus model checking, can be extended with information to generate such evidence. Solving the resulting PBES is much slower than solving one without additional information, and sometimes even impossible. In this paper we develop a two-step approach to solving a PBES with additional information: we first solve its core and subsequently use the information obtained in this step to solve the PBES with additional information. We prove the correctness of our approach and we have implemented it, demonstrating that it efficiently generates evidence using both explicit and symbolic solving techniques. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15938 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version) Stramaglia, Anna Keiren, Jeroen J. A. Laveaux, Maurice Willemse, Tim A. C. Logic in Computer Science Model checking is a technique to automatically assess whether a model of the behaviour of a system meets its requirements. Evidence explaining why the behaviour does (not) meet its requirements is essential for the user to understand the model checking result. Willemse and Wesselink showed that parameterised Boolean equation systems (PBESs), an intermediate format for $μ$-calculus model checking, can be extended with information to generate such evidence. Solving the resulting PBES is much slower than solving one without additional information, and sometimes even impossible. In this paper we develop a two-step approach to solving a PBES with additional information: we first solve its core and subsequently use the information obtained in this step to solve the PBES with additional information. We prove the correctness of our approach and we have implemented it, demonstrating that it efficiently generates evidence using both explicit and symbolic solving techniques. |
| title | Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2501.15938 |