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

In  IEEE Transactions on Automatic Control

Details

TypeArticle
URLpdf/tac10.pdf
Pages2834 -2840
Volume55
Number12
> Publications > Formal Analysis of Discrete-Time Piecewise Affine Systems