Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2019 | Submitted
Book Section - Chapter Open

Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts

Abstract

This paper presents an assume-guarantee reasoning approach to the computation of robust invariant sets for network systems. Parameterized signal temporal logic (pSTL) is used to formally describe the behaviors of the subsystems, which we use as the template for the contract. We show that set invariance can be proved with a valid assume-guarantee contract by reasoning about individual subsystems. If a valid assume-guarantee contract with monotonic pSTL template is known, it can be further refined by value iteration. When such a contract is not known, an epigraph method is proposed to solve for a contract that is valid, -an approach that has linear complexity for a sparse network. A microgrid example is used to demonstrate the proposed method. The simulation result shows that together with control barrier functions, the states of all the subsystems can be bounded inside the individual robust invariant sets.

Additional Information

© 2019 AACC. This work is supported by the Battelle Memorial Institute, Pacific Northwest Division, Grant #424858.

Attached Files

Submitted - 1810.10636.pdf

Files

1810.10636.pdf
Files (1.2 MB)
Name Size Download all
md5:823a5282460dfbc46cbeaa9d2ffcc080
1.2 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023