Algorithmic approach to abstracting linear systems by timed automata

Christoffer Sloth*, Rafael Wisniewski

*Kontaktforfatter for dette arbejde

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

Abstrakt

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.

OriginalsprogEngelsk
TitelProceedings of the 18th IFAC World Congress
Vol/bind18
Publikationsdato2011
UdgavePART 1
Sider4546-4551
ISBN (Trykt)9783902661937
DOI
StatusUdgivet - 2011
Udgivet eksterntJa
Begivenhed18th IFAC World Congress - Milano, Italien
Varighed: 28. aug. 20112. sep. 2011

Konference

Konference18th IFAC World Congress
Land/OmrådeItalien
ByMilano
Periode28/08/201102/09/2011

Fingeraftryk

Dyk ned i forskningsemnerne om 'Algorithmic approach to abstracting linear systems by timed automata'. Sammen danner de et unikt fingeraftryk.

Citationsformater