Qualitative Theory of Two-Dimensional Polynomial Dynamical Systems

A qualitative theory of two-dimensional quadratic-polynomial integrable dynamical systems (DSs) is constructed on the basis of a discriminant criterion elaborated in the paper. This criterion enables one to pick up a single parameter that makes it possible to identify all feasible solution classes as well as the DS critical and singular points and solutions. The integrability of the considered DS family is established. Nine specific solution classes are identified. In each class, clear types of symmetry are determined and visualized and it is discussed how transformations between the solution classes create new types of symmetries. Visualization is performed as series of phase portraits revealing all possible catastrophic scenarios that result from the transition between the solution classes.

On the Nonlinear Observability of Polynomial Dynamical Systems

Controllability and observability are important system properties in control theory. These properties cannot be easily checked for general nonlinear systems. This paper addresses the local and global observability as well as the decomposition with respect to observability of polynomial dynamical systems embedded in a higher-dimensional state-space. These criteria are applied on some example system.

Implicit Semi-Algebraic Abstraction for Polynomial Dynamical Systems

Semi-algebraic abstraction is an approach to the safety verification problem for polynomial dynamical systems where the state space is partitioned according to the sign of a set of polynomials. Similarly to predicate abstraction for discrete systems, the number of abstract states is exponential in the number of polynomials. Hence, semi-algebraic abstraction is expensive to explicitly compute and then analyze (e.g., to prove a safety property or extract invariants).In this paper, we propose an implicit encoding of the semi-algebraic abstraction, which avoids the explicit enumeration of the abstract states: the safety verification problem for dynamical systems is reduced to a corresponding problem for infinite-state transition systems, allowing us to reuse existing model-checking tools based on Satisfiability Modulo Theory (SMT). The main challenge we solve is to express the semi-algebraic abstraction as a first-order logic formula that is linear in the number of predicates, instead of exponential, thus letting the model checker lazily explore the exponential number of abstract states with symbolic techniques. We implemented the approach and validated experimentally its potential to prove safety for polynomial dynamical systems.

On Some Symmetries of Quadratic Systems

We provide a general method for identifying real quadratic polynomial dynamical systems that can be transformed to symmetric ones by a bijective polynomial map of degree one, the so-called affine map. We mainly focus on symmetry groups generated by rotations, in other words, we treat equivariant and reversible equivariant systems. The description is given in terms of affine varieties in the space of parameters of the system. A general algebraic approach to find subfamilies of systems having certain symmetries in polynomial differential families depending on many parameters is proposed and computer algebra computations for the planar case are presented.

Symmetries in Phase Portrait

We construct polynomial dynamical systems x ′ = P ( x ) with symmetries present in the local phase portrait. This point of view on symmetry yields the approaches to ODEs construction being amenable to classical methods of the Spectral Analysis.