Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.09244 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912375828905984 |
|---|---|
| author | Sofronie-Stokkermans, Viorica Marohn, Philipp |
| author_facet | Sofronie-Stokkermans, Viorica Marohn, Philipp |
| contents | In this paper we give an overview of results on the analysis of parametric linear hybrid automata, and of systems of similar linear hybrid automata: We present possibilities of describing systems with a parametric (i.e. not explicitly specified) number of similar components which can be connected to other systems, such that some parts in the description might be underspecified (i.e. parametric). We consider global safety properties for such systems, expressed by universally quantified formulae, using quantification over variables ranging over the component systems. We analyze possibilities of using methods for hierarchical reasoning and symbol elimination for determining relationships on (some of) the parameters used in the description of these systems under which the global safety properties are guaranteed to be inductive invariants. We discuss an implementation and illustrate its use on several examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_09244 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On verification and constraint generation for families of similar hybrid automata Sofronie-Stokkermans, Viorica Marohn, Philipp Logic in Computer Science In this paper we give an overview of results on the analysis of parametric linear hybrid automata, and of systems of similar linear hybrid automata: We present possibilities of describing systems with a parametric (i.e. not explicitly specified) number of similar components which can be connected to other systems, such that some parts in the description might be underspecified (i.e. parametric). We consider global safety properties for such systems, expressed by universally quantified formulae, using quantification over variables ranging over the component systems. We analyze possibilities of using methods for hierarchical reasoning and symbol elimination for determining relationships on (some of) the parameters used in the description of these systems under which the global safety properties are guaranteed to be inductive invariants. We discuss an implementation and illustrate its use on several examples. |
| title | On verification and constraint generation for families of similar hybrid automata |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2505.09244 |