Using Symmetry Transformations in Equivariant Dynamical Systems for Their Safety Verification

Author(s):  
Hussein Sibai ◽  
Navid Mokhlesi ◽  
Sayan Mitra
Scholarpedia ◽  
2007 ◽  
Vol 2 (10) ◽  
pp. 2510 ◽  
Author(s):  
Jeff Moehlis ◽  
Edgar Knobloch

2006 ◽  
Vol 16 (03) ◽  
pp. 559-577 ◽  
Author(s):  
FERNANDO ANTONELI ◽  
IAN STEWART

Equivariant dynamical systems possess canonical flow-invariant subspaces, the fixed-point spaces of subgroups of the symmetry group. These subspaces classify possible types of symmetry-breaking. Coupled cell networks, determined by a symmetry groupoid, also possess canonical flow-invariant subspaces, the balanced polydiagonals. These subspaces classify possible types of synchrony-breaking, and correspond to balanced colorings of the cells. A class of dynamical systems that is common to both theories comprises networks that are symmetric under the action of a group Γ of permutations of the nodes ("cells"). We investigate connections between balanced polydiagonals and fixed-point spaces for such networks, showing that in general they can be different. In particular, we consider rings of ten and twelve cells with both nearest and next-nearest neighbor coupling, showing that exotic balanced polydiagonals — ones that are not fixed-point spaces — can occur for such networks. We also prove the "folk theorem" that in any Γ-equivariant dynamical system on Rk the only flow-invariant subspaces are the fixed-point spaces of subgroups of Γ.


Author(s):  
Sergio Mover ◽  
Alessandro Cimatti ◽  
Alberto Griggio ◽  
Ahmed Irfan ◽  
Stefano Tonetta

AbstractSemi-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.


Sign in / Sign up

Export Citation Format

Share Document