Contract Composition for Dynamical Control Systems: Definition and Verification using Linear Programming

TL;DR

This paper introduces a modular contract-based framework for discrete-time dynamical control systems, enabling scalable design, analysis, and verification through linear programming and graph theory methods.

Contribution

It extends contract definitions to include input assumptions dependent on past outputs and supports arbitrary interconnection topologies for modular control system verification.

Findings

The framework supports modular design and verification of large-scale control systems.

Verification algorithms based on linear programming scale linearly with system size.

Numerical example demonstrates the approach's scalability and modularity.

Abstract

Designing large-scale control systems to satisfy complex specifications is hard in practice, as most formal methods are limited to systems of modest size. Contract theory has been proposed as a modular alternative to formal methods in control, in which specifications are defined by assumptions on the input to a component and guarantees on its output. However, current contract-based methods for control systems either prescribe guarantees on the state of the system, going against the spirit of contract theory, or can only support rudimentary compositions. In this paper, we present a contract-based modular framework for discrete-time dynamical control systems. We extend the definition of contracts by allowing the assumption on the input at a time $k$ to depend on outputs up to time $k-1$, which is essential when considering the feedback connection of an unregulated dynamical system and a controller. We also define contract composition for arbitrary interconnection topologies, under the pretence of well-posedness, and prove that this notion supports modular design, analysis and verification. This is done using graph theory methods, and specifically using the notions of topological ordering and backward-reachable nodes. Lastly, we use $k$-induction to present an algorithm for verifying vertical contracts, which are claims of the form "the conjugation of given component-level contracts is a stronger specification than a given contract on the integrated system". These algorithms are based on linear programming, and scale linearly with the number of components in the interconnected network. A numerical example is provided to demonstrate the scalability of the presented approach, as well as the modularity achieved by using it.