Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions

Christoffer Sloth, Rafal Wisniewski

Research output: Contribution to journalConference article in JournalResearchpeer-review

7 Citations (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.
Original languageEnglish
JournalI E E E Conference on Decision and Control. Proceedings
Pages (from-to)3760-3765
Publication statusPublished - 2010
Event49th IEEE Conference on Decision and Control - Atlanta, United States
Duration: 15 Dec 201017 Dec 2010


Conference49th IEEE Conference on Decision and Control
CountryUnited States

Fingerprint Dive into the research topics of 'Abstraction of Continuous Dynamical Systems Utilizing Lyapunov Functions'. Together they form a unique fingerprint.

Cite this