Computation of Feasible Assume-Guarantee Contracts: A Resilience-based Approach

2025-09-01

AI Summary

This paper addresses the verification of temporal logic specifications—such as safety and reachability—for interconnected discrete-time systems. We propose a resilience-driven assume-guarantee (A/G) contract computation framework. Our method models inter-subsystem couplings as structured disturbances and introduces a resilience metric to guide iterative contract refinement, maximizing the assumption set (e.g., within a spherical domain) while preserving correctness and monotonicity. The approach supports finite-horizon specifications for both linear systems and general finite-horizon specifications for nonlinear systems. We provide theoretical guarantees for two subsystems and extend the results to arbitrary multi-subsystem networks. Numerical experiments on linear systems and a case study on a nonlinear DC microgrid demonstrate satisfaction of temporal specifications and validate the framework’s effectiveness in compositional reasoning.

Technology Category

• Multiagent Systems: Agreement, Argumentation & Negotiation
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterization
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

We propose a resilience-based framework for computing feasible assume-guarantee contracts that ensure the satisfaction of temporal specifications in interconnected discrete-time systems. Interconnection effects are modeled as structured disturbances. We use a resilience metric, the maximum disturbance under which local specifications hold, to refine assumptions and guarantees across subsystems iteratively. For two subsystems, we demonstrate correctness, monotone refinement of guarantees, and that the resulting assumptions are maximal within ball-shaped sets. Additionally, we extend our approach to general networks of L subsystems using weighted combinations of interconnection effects. We instantiate the framework on linear systems by meeting finite-horizon safety, exact-time reachability, and finite-time reachability specifications, and on nonlinear systems by fulfilling general finite-horizon specifications. Our approach is demonstrated through numerical linear examples, and a nonlinear DC Microgrid case study, showcasing the impact of our framework in verifying temporal logic specifications with compositional reasoning.

Problem

• Computing feasible assume-guarantee contracts for interconnected systems
• Ensuring temporal specification satisfaction under structured disturbances
• Refining assumptions using resilience metrics across subsystem networks

Innovation

• Resilience-based framework for contract computation
• Iterative refinement using maximum disturbance metric
• Weighted combinations for general network extension