Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions

Christoffer Sloth, Rafal Wisniewski

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

7 Citationer (Scopus)


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.
TidsskriftI E E E Conference on Decision and Control. Proceedings
Sider (fra-til)3760-3765
StatusUdgivet - 2010
Begivenhed49th IEEE Conference on Decision and Control - Atlanta, USA
Varighed: 15 dec. 201017 dec. 2010


Konference49th IEEE Conference on Decision and Control

Fingeraftryk Dyk ned i forskningsemnerne om 'Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions'. Sammen danner de et unikt fingeraftryk.