Formal analysis of piecewise affine systems through formula-guided refinement

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00065966" target="_blank" >RIV/00216224:14330/13:00065966 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.automatica.2012.09.027" target="_blank" >http://dx.doi.org/10.1016/j.automatica.2012.09.027</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.automatica.2012.09.027" target="_blank" >10.1016/j.automatica.2012.09.027</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Formal analysis of piecewise affine systems through formula-guided refinement

Popis výsledku v původním jazyce

We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system with additive uncertainty satisfy a linear temporal logic (LTL) formula over a set of linear predicates in its state variables. Our approach is based on the construction and refinement of finite abstractions of infinite systems. We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific LTL formula and propose a method for the construction of such formula-equivalent abstractions. While provably correct, the overall method is conservative and expensive. A tool for PWA systems implementing the proposed procedure using polyhedral operations and analysis of finite graphs is made available. Examples illustrating the analysis of PWA models of gene networks are included. (C) 2012 Elsevier Ltd. All rights reserved.

Název v anglickém jazyce

Formal analysis of piecewise affine systems through formula-guided refinement

Popis výsledku anglicky

We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system with additive uncertainty satisfy a linear temporal logic (LTL) formula over a set of linear predicates in its state variables. Our approach is based on the construction and refinement of finite abstractions of infinite systems. We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific LTL formula and propose a method for the construction of such formula-equivalent abstractions. While provably correct, the overall method is conservative and expensive. A tool for PWA systems implementing the proposed procedure using polyhedral operations and analysis of finite graphs is made available. Examples illustrating the analysis of PWA models of gene networks are included. (C) 2012 Elsevier Ltd. All rights reserved.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Automatica

ISSN

0005-1098

e-ISSN

—

Svazek periodika

49

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

6

Strana od-do

261-266

Kód UT WoS článku

000313772600029

EID výsledku v databázi Scopus

—