Computing semi-algebraic invariants for polynomial dynamical systems
In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAIs) for such PDSs. The main idea is encoding relevant dynamical properties as...
Uloženo v:
| Vydáno v: | Proceedings of the ninth ACM International Conference on Embedded Software s. 97 - 106 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY, USA
ACM
09.10.2011
IEEE |
| Edice: | ACM Conferences |
| Témata: |
Computing methodologies
> Symbolic and algebraic manipulation
> Symbolic and algebraic algorithms
> Algebraic algorithms
Software and its engineering
> Software creation and management
> Software verification and validation
> Formal software verification
|
| ISBN: | 1450307140, 9781450307147 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAIs) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one. |
|---|---|
| ISBN: | 1450307140 9781450307147 |
| DOI: | 10.1145/2038642.2038659 |

