Formal analysis of piecewise affine systems through formula-guided refinement

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

Formal analysis of piecewise affine systems through formula-guided refinement

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

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

Publication year

2013

Confidentiality

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

Name of the periodical

Automatica

ISSN

0005-1098

e-ISSN

—

Volume of the periodical

49

Issue of the periodical within the volume

1

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

6

Pages from-to

261-266

UT code for WoS article

000313772600029

EID of the result in the Scopus database

—