Formal Analysis of Discrete-Time Piecewise Affine Systems

In this technical note, we study temporal logic properties of trajectories of discrete-time piecewise affine (PWA) systems. Specifically, given a PWA system and a linear temporal logic formula over regions in its state space, we attempt to find the largest region of initial states from which all tra...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2010-12, Vol.55 (12), p.2834-2840
Main Authors: Yordanov, B, Belta, C
Format: Article
Language:English
Subjects:
Abstraction
Analytical models
Applied sciences
Automatic control
Computational modeling
Computer science
control theory
systems
Computer systems performance. Reliability
Construction industry
Exact sciences and technology
formal analysis
Genes
genetic networks
Genetic programming
Integrated circuit modeling
Iterative methods
Mathematical analysis
Mathematical models
model checking
Networks
piecewise affine (PWA) systems
Software
Temporal logic
Trajectories
Trajectory
uncertain systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this technical note, we study temporal logic properties of trajectories of discrete-time piecewise affine (PWA) systems. Specifically, given a PWA system and a linear temporal logic formula over regions in its state space, we attempt to find the largest region of initial states from which all trajectories of the system satisfy the formula. Our method is based on the iterative computation and model checking of finite quotients. We illustrate our method by analyzing PWA models of two synthetic gene networks.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2010.2072530