In this paper we study possibilities of using methods for hierarchical reasoning in local theory extensions for the analysis and verification of parametric hybrid systems, where the parameters can be either constants or functions. Our goal is to automatically provide guarantees that such systems satisfy certain safety or invariance conditions. We first analyze the possibility of automatically generating such guarantees in the form of constraints on parameters, then show that we can also synthesise so-called criticality functions, typically used for proving stability and/or safety of hybrid systems. We illustrate our methods on several examples
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
We show that for special types of extensions of a base theory, which we call {\em local}, efficient ...
We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot ...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
We study certain classes of verification problems for parametric reactive and hybrid systems, and id...
In this paper we show how hierarchical reasoning can be used to verify properties of complex system...
AbstractIn this paper we show how hierarchical reasoning can be used to verify properties of complex...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
We present a general framework which allows to identify complex theories important in verification f...
International audienceThe increase of complexity in modelling systems and the chances of success whe...
We show that many properties studied in mathematical analysis (e.g.\ monotonicity, boundedness, inve...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
We show that for special types of extensions of a base theory, which we call {\em local}, efficient ...
We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot ...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
We study certain classes of verification problems for parametric reactive and hybrid systems, and id...
In this paper we show how hierarchical reasoning can be used to verify properties of complex system...
AbstractIn this paper we show how hierarchical reasoning can be used to verify properties of complex...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
We present a general framework which allows to identify complex theories important in verification f...
International audienceThe increase of complexity in modelling systems and the chances of success whe...
We show that many properties studied in mathematical analysis (e.g.\ monotonicity, boundedness, inve...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
We show that for special types of extensions of a base theory, which we call {\em local}, efficient ...
We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot ...