Abstraction of continuous dynamical systems utilizing lyapunov functions

Christoffer Sloth*, Rafael Wisniewski

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

This paper considers the development of a method for abstracting continuous dynamical systems by timed automata. The method is based on partitioning the state space of dynamical systems with invariant sets, which form cells representing locations of the timed automata. To enable verification of the dynamical system based on the abstraction, conditions for obtaining sound, complete, and refinable abstractions are set up. It is proposed to partition the state space utilizing sub-level sets of Lyapunov functions, since they are positive invariant sets. The existence of sound abstractions for Morse-Smale systems and complete and refinable abstractions for linear systems are shown.

OriginalsprogEngelsk
Titel2010 49th IEEE Conference on Decision and Control, CDC 2010
Antal sider6
Publikationsdato2010
Sider3760-3765
Artikelnummer5717270
ISBN (Trykt)9781424477456
DOI
StatusUdgivet - 2010
Begivenhed2010 49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, GA, USA
Varighed: 15. dec. 201017. dec. 2010

Konference

Konference2010 49th IEEE Conference on Decision and Control, CDC 2010
Land/OmrådeUSA
ByAtlanta, GA
Periode15/12/201017/12/2010

Fingeraftryk

Dyk ned i forskningsemnerne om 'Abstraction of continuous dynamical systems utilizing lyapunov functions'. Sammen danner de et unikt fingeraftryk.

Citationsformater