Compositional synthesis via a convex parameterization of assume-guarantee contracts

DOI10.1145/3365365.3382212OpenAlexW3006348814MaRDI QIDQ5146379

Calin Belta, Kasra Ghasemi, Sadra Sadraddini

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

linear systemszonotopescompositional synthesisassume-guarantee contractsviable sets

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)

Related Items (3)

Assume-guarantee contracts for continuous-time systems ⋮ Compositional safety rules for inter-triggering hybrid automata ⋮ On distributed symbolic control of interconnected systems under persistency specifications

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