Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912978011422720 |
|---|---|
| author | Eichler, Paul Jacobs, Swen Weil-Kennedy, Chana |
| author_facet | Eichler, Paul Jacobs, Swen Weil-Kennedy, Chana |
| contents | We introduce a new framework for verifying systems with a parametric number of concurrently running processes. The systems we consider are well-structured with respect to a specific well-quasi order. This allows us to decide a wide range of verification problems, including control-state reachability, coverability, and target, in a fixed finite abstraction of the infinite state-space, called a 01-counter system. We show that several systems from the parameterized verification literature fall into this class, including reconfigurable broadcast networks (or systems with lossy broadcast), disjunctive systems, synchronizations and systems with a fixed number of shared finite-domain variables. Our framework provides a simple and unified explanation for the properties of these systems, which have so far been investigated separately. Additionally, it extends and improves on a range of the existing results, and gives rise to other systems with similar properties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_05954 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction Eichler, Paul Jacobs, Swen Weil-Kennedy, Chana Formal Languages and Automata Theory We introduce a new framework for verifying systems with a parametric number of concurrently running processes. The systems we consider are well-structured with respect to a specific well-quasi order. This allows us to decide a wide range of verification problems, including control-state reachability, coverability, and target, in a fixed finite abstraction of the infinite state-space, called a 01-counter system. We show that several systems from the parameterized verification literature fall into this class, including reconfigurable broadcast networks (or systems with lossy broadcast), disjunctive systems, synchronizations and systems with a fixed number of shared finite-domain variables. Our framework provides a simple and unified explanation for the properties of these systems, which have so far been investigated separately. Additionally, it extends and improves on a range of the existing results, and gives rise to other systems with similar properties. |
| title | Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2408.05954 |