Abstract

In generating invariants for hybrid systems, a main source of intractability is that transition relations are first-order assertions over current-state variables and next-state variables, which doubles the number of system variables and introduces many more free variables. The more variables, the less tractability and, hence, solving the algebraic constraints on complete inductive conditions by a comprehensive Gröbner basis is very expensive. To address this issue, this paper presents a new, complete method, called the Citing Instances Method (CIM), which can eliminate the free variables and directly solve for the complete inductive conditions. An instance means the verification of a proposition after instantiating free variables to numbers. A lattice array is a key notion in this paper, which is essentially a finite set of instances. Verifying that a proposition holds over a Lattice Array suffices to prove that the proposition holds in general; this interesting feature inspires us to present CIM. On one hand, instead of computing a comprehensive Gröbner basis, CIM uses a Lattice Array to generate the constraints in parallel. On the other hand, we can make a clever use of the parallelism of CIM to start with some constraint equations which can be solved easily, in order to determine some parameters in an early state. These solved parameters benefit the solution of the rest of the constraint equations; this process is similar to the domino effect. Therefore, the constraint-solving tractability of the proposed method is strong. We show that some existing approaches are only special cases of our method. Moreover, it turns out CIM is more efficient than existing approaches under parallel circumstances. Some examples are presented to illustrate the practicality of our method.

Highlights

  • In the real world, there exist many systems exhibiting mixed discrete–continuous behavior, which cannot be described in a proper way by using either a discrete or continuous model.The notion of a hybrid automaton has been introduced for modeling such systems [1]

  • The main contributions of this paper are as follows: Firstly, we propose a complete method for constructing invariants of hybrid systems which can solve the complete inductive conditions rather than alternative incomplete inductive conditions

  • This implies that various inductive invariants and computational methods can be proposed for different classes of hybrid systems with some simplification or restriction

Read more

Summary

Introduction

There exist many systems exhibiting mixed discrete–continuous behavior, which cannot be described in a proper way by using either a discrete or continuous model. Any solution with respect to the constraints is an inductive invariant To address this issue, instead of computing a comprehensive Gröbner basis, this paper presents a new technique, called Citing Instances Method (CIM). By substituting real numbers for the variables in the complete inductive conditions, CIM can derive a set of constraints on the parameters, which can be solved more efficiently by the elimination of free variables. This idea is inspired by the Parallel Numerical Method, which was first presented in [16,17]. CIM involves less symbolic computation and that is why it requires fewer computational resources

Related Work
Preliminaries
Basic Lemmas
Characteristic Set
Hybrid System
Theory of CIM
Basic Lemma and Theorem
Generate the Constraint for Implication by CIM
Illustration of CIM
A Special Case
Experiment 1
Experiment 2
A Clever Use of CIM invariants were obtained
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call