Decentralized control using compositional analysis techniques

Decentralized control strategies aim at achieving a global control target by means of distributed local controllers acting on individual subsystems of the overall plant. In this sense, decentralized control is a dual problem to compositional analysis where a global verification task is decomposed into several local tasks involving components of the overall system. In this paper we apply recently developed compositional reasoning techniques to decentralized control problems for linear systems. We assume the global plant and global specification to be both given as series of feedback interconnections. In this setting compositional and assume-guarantee reasoning schemes can be shown to be valid. Provided the local controllers are such that the locally controlled subsystems of the plant satisfy their respective sub-specifications the network of locally controlled plants is then guaranteed to satisfy the global specification.