Algorithmic approach to abstracting linear systems by timed automata

Christoffer Sloth*, Rafael Wisniewski

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


This paper proposes an LMI-based algorithm for abstracting dynamical systems by timed automata, which enables automatic formal verification of linear systems. The proposed abstraction is based on partitioning the state space of the system using positive invariant sets, generated by Lyapunov functions. This partitioning ensures that the vector field of the dynamical system is transversal to all facets of the cells, which induces some desirable properties of the abstraction. The algorithm is based on identifying intersections of level sets of quadratic Lyapunov functions, and determining the minimum and maximum time that a trajectory of the system can stay in a set, defined as the set-difference of sub-level sets of Lyapunov functions. The proposed algorithm applies for linear systems and can therefore be efficiently implemented using LMI-based tools.

Original languageEnglish
Title of host publicationProceedings of the 18th IFAC World Congress
Publication date2011
EditionPART 1
ISBN (Print)9783902661937
Publication statusPublished - 2011
Externally publishedYes
Event18th IFAC World Congress - Milano, Italy
Duration: 28. Aug 20112. Sep 2011


Conference18th IFAC World Congress


Dive into the research topics of 'Algorithmic approach to abstracting linear systems by timed automata'. Together they form a unique fingerprint.

Cite this