Referenced Items are not available for this document.
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.
Published in:
Automatic Control, IEEE Transactions on
(Volume:55
,
Issue:
12
)
Date of Publication: Dec. 2010
- Page(s):
- 2834 - 2840
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 11685053
- Digital Object Identifier :
- 10.1109/TAC.2010.2072530
- Date of Publication :
- 02 September 2010
- Date of Current Version :
- 03 December 2010
- Issue Date :
- Dec. 2010
- Sponsored by :
- IEEE Control Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
