D 2010

A Symbolic Approach to Controlling Piecewise Affine Systems

TŮMOVÁ, Jana, Boyan YORDANOV, Calin BELTA, Ivana ČERNÁ, Jiří BARNAT et. al.

Basic information

Original name

A Symbolic Approach to Controlling Piecewise Affine Systems

Name in Czech

Symbolický přístup k řízení po částech afinních systémů

Authors

TŮMOVÁ, Jana (203 Czech Republic, guarantor, belonging to the institution), Boyan YORDANOV (100 Bulgaria), Calin BELTA (840 United States of America), Ivana ČERNÁ (203 Czech Republic, belonging to the institution) and Jiří BARNAT (203 Czech Republic, belonging to the institution)

Edition

Neuveden, Proceedings of of the 49th IEEE Conference on Decision and Control (CDC), p. 4230-4235, 6 pp. 2010

Publisher

Omnipress for IEEE Control Systems Society

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

RIV identification code

RIV/00216224:14330/10:00045256

Organization unit

Faculty of Informatics

ISBN

978-1-4244-7744-9

ISSN

UT WoS

000295049104128

Keywords in English

Automata; Game Theory; Hybrid Systems

Tags

International impact, Reviewed
Změněno: 15/12/2011 12:10, prof. RNDr. Jiří Barnat, Ph.D.

Abstract

V originále

We present a computational framework for auto- matic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over an arbitrary set of linear predicates in its state variables. First, by defining partitions for its state and input spaces, we construct a finite abstraction of the PWA system in the form of a control transition system. Second, we develop an algorithm to generate a control strategy for the finite abstraction. While provably correct and robust to small perturbations in both state measurements and applied inputs, the overall procedure is conservative and expensive. The proposed algorithms have been implemented and are available for download. Illustrative examples are included.

Links

GA201/09/1389, research and development project
Name: Verifikace a analýza velmi velkých počítačových systémů
Investor: Czech Science Foundation, Verification and Analysis of Large-Scale Computer Systems
GP201/09/P497, research and development project
Name: Automatizovaná formální verifikace s využitím soudobého hardware
Investor: Czech Science Foundation, Automated formal verification using modern hardware
MSM0021622419, plan (intention)
Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
MUNI/A/0914/2009, interní kód MU
Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)
Investor: Masaryk University, Category A