Compositional synthesis via a convex parameterization of assume-guarantee contracts

DOI10.1145/3365365.3382212MaRDI QIDQ5146379zbMATH OpenOpenAlexFDO

Authors Kasra Ghasemi, Sadra Sadraddini, Calin Belta

Publication date 25 January 2021

Published in Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.06494

zbMATH Keywords

assume-guarantee contractscompositional synthesislinear systemsviable setszonotopes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cited in

(7)

• On distributed symbolic control of interconnected systems under persistency specifications
• Assume-guarantee contracts for continuous-time systems
• scientific article; zbMATH DE number 4213463 (Why is no real title available?)
• Compositional safety rules for inter-triggering hybrid automata
• Compositional synthesis for linear systems via convex optimization of assume-guarantee contracts
• A contract negotiation scheme for safety verification of interconnected systems
• Decompositional reach-and-stay contract-based control of nonlinear systems with an application to glucose control

This page was built for publication: Compositional synthesis via a convex parameterization of assume-guarantee contracts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146379)