On compositional symbolic controller synthesis inspired by small-gain theorems
Authors:
- 1 December 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6133-6138
Abstract
In this paper, we present a compositional method for the synthesis of controllers enforcing persistency specifications. This method is inspired by two classes of compositional techniques: small-gain theorems from the control literature; and assume-guarantee reasoning from the formal methods literature. We show that the method presented in this paper is strictly more general than a representative existing small-gain theorem.Keywords
This publication has 18 references indexed in Scilit:
- On the completeness of compositional reasoning methodsACM Transactions on Computational Logic, 2010
- Discrete-time Lyapunov-based small-gain theorem for parameterized interconnected ISS systemsIEEE Transactions on Automatic Control, 2003
- Foundations for Circular Compositional Reasoning2001
- A Set-Theoretic Framework for Assume-Guarantee Reasoning2001
- Input-to-state stability for discrete-time nonlinear systemsAutomatica, 2001
- Circular Compositional Reasoning about Liveness1999
- A nonlinear small gain theorem for the analysis of control systems with saturationIEEE Transactions on Automatic Control, 1996
- A Lyapunov formulation of the nonlinear small-gain theorem for interconnected ISS systemsAutomatica, 1996
- Conjoining specificationsACM Transactions on Programming Languages and Systems, 1995
- Small-gain theorem for ISS systems and applicationsMathematics of Control, Signals, and Systems, 1994