Complete Abstractions of Dynamical Systems by Timed Automata

Christoffer Sloth, Rafael Wisniewski

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

13 Citationer (Scopus)

Abstrakt

This paper addresses the generation of complete abstractions of polynomial dynamical systems by timed automata. For the proposed abstraction, the state space is divided into cells by sublevel sets of functions. We identify a relation between these functions and their directional derivatives along the vector field, which allows the generation of a complete abstraction.

To compute the functions that define the subdivision of the state space in an algorithm, we formulate a sum of squares optimization problem. This optimization problem finds the best subdivisioning functions, with respect to the ability to approximate the dynamical system, in a subset of admissible subdivisioning functions.
OriginalsprogEngelsk
TidsskriftNonlinear Analysis: Hybrid Systems
Vol/bind7
Udgave nummer1
Sider (fra-til)80-100
ISSN1751-570X
DOI
StatusUdgivet - feb. 2013

Fingeraftryk Dyk ned i forskningsemnerne om 'Complete Abstractions of Dynamical Systems by Timed Automata'. Sammen danner de et unikt fingeraftryk.

Citationsformater