Elsevier

Theoretical Computer Science

Volume 594, 23 August 2015, Pages 180-200
Theoretical Computer Science

Generating invariants for non-linear hybrid systems

https://doi.org/10.1016/j.tcs.2015.06.018Get rights and content
Under an Elsevier user license
open archive

Highlights

  • We handle non-linear hybrid systems extended with parameters.

  • We extract the generator basis of a vector space of non-trivial invariants.

  • The problem is reduced to the computation of associated eigenspaces or null spaces.

  • Sufficient conditions for the existence and the computation of invariant ideals.

Abstract

We describe powerful computational techniques, relying on linear algebraic methods, for generating ideals of non-linear invariants of algebraic hybrid systems. We show that the preconditions for discrete transitions and the Lie-derivatives for continuous evolution can be viewed as morphisms, and so can be suitably represented by matrices. We reduce the non-trivial invariant generation problem to the computation of the associated eigenspaces or nullspaces by encoding the consecution requirements as specific morphisms represented by such matrices. Our methods are the first to establish very general sufficient conditions that show the existence and allow the computation of invariant ideals. Our approach also embodies a strategy to estimate certain degree bounds, leading to the discovery of rich classes of inductive invariants. By reducing the problem to related linear algebraic manipulations we are able to address various deficiencies of other state-of-the-art invariant generation methods, including the efficient treatment of non-linear hybrid systems. Our approach avoids first-order quantifier eliminations, Gröbner basis computations or direct system resolutions, thereby circumventing difficulties met by other recent techniques.

Keywords

Formal methods
Inductive invariant generation
Hybrid systems
Linear algebra

Cited by (0)

1

FAPESP grant number 2011/08947-1 and FAPESP/BEPE grant number 2013/04734-9.