Compositional synthesis via a convex parameterization of assume-guarantee contracts

Ghasemi, Kasra; Sadraddini, Sadra; Belta, Călin

doi:10.1145/3365365.3382212

Cited by 24 publications

(22 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our self-safety and responsibility rules utilize this structure to provide sufficient conditions for global safety. In comparison, existing compositional frameworks, such as [5,9,14,17,19,22,23,25], that give sufficient conditions for global safety allow agents' dynamics to be coupled but do not allow for triggering actions. • We note that our approach can be extended to guarantee safety for settings in which individual systems may have communication delays or sensor noise by leveraging recent advances in invariant set computation [10,12,15,29] for systems with these imperfections.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Compositional safety rules for inter-triggering hybrid automata

Rutledge

Chou

Özay

2021

Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control

View full text Add to dashboard Cite

In this paper, we present a compositional condition for ensuring safety of a collection of interacting systems modeled by intertriggering hybrid automata (ITHA). ITHA is a modeling formalism for representing multi-agent systems in which each agent is governed by individual dynamics but can also interact with other agents through triggering actions. These triggering actions result in a jump/reset in the state of other agents according to a global resolution function. A sufficient condition for safety of the collection, inspired by responsibility-sensitive safety, is developed in two parts: self-safety relating to the individual dynamics, and responsibility relating to the triggering actions. The condition relies on having an over-approximation method for the resolution function. We further show how such over-approximations can be obtained and improved via communication. We use two examples, a job scheduling task on parallel processors and a highway driving example, throughout the paper to illustrate the concepts. Finally, we provide a comprehensive evaluation on how the proposed condition can be leveraged for several multi-agent control and supervision examples.

show abstract

Section: Discussionmentioning

confidence: 99%

“…On the other extreme, one can analyze agents individually, assuming all of the remaining agents act adversarially, in which case safety is hard to attain, if at all possible. Several frameworks have been developed between these two extremes to capture various notions of coordination, collaboration, or contracts [5,6,9,14,17,23,25,28].…”

Section: Introductionmentioning

confidence: 99%

Compositional safety rules for inter-triggering hybrid automata

Rutledge

Chou

Özay

2021

Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control

View full text Add to dashboard Cite

show abstract

“…Let t ∈ R + 0 and assume that w 2 (s) ≤ a(s, ε) for all s ∈ [0, t]. We have from ( 15) that for all s ∈ [0, t] where the last inequality comes from (16). Hence, Σ 1 |= C(ε).…”

Section: Bibo Stabilitymentioning

confidence: 99%

“…Let us emphasize that the main objective of the paper is to provide compositionality rules on how to go from the satisfaction of local contracts for the components to the satisfaction of a global contract for the whole interconnected system. The question on how to construct the local contracts from the global one is not investigated in this paper, but have been explored in other works in the literature for continuous-time in [41] and [6,Section 8.6], and for discrete-time [7,14,16] systems.…”

Section: Introductionmentioning

confidence: 99%

Assume-guarantee contracts for continuous-time systems

2021

View full text Add to dashboard Cite

Many techniques for verifying properties of continuous-time systems are limited to systems of moderate size. In this paper, we propose an approach based on assume-guarantee contracts and compositional reasoning for verifying properties of a broad class of continuous-time systems consisting of interconnected components. The notion of assume-guarantee contracts makes it possible to divide responsibilities among the system components: a contract specifies the property that a component must fulfill under some assumptions on the behavior of its environment (i.e. of the other components). We define weak and strong semantics of assume-guarantee contracts.c We then establish a certain number of results for compositional reasoning, which allow us to show that a global assume-guarantee contract of the whole system is satisfied when all components satisfy their own contracts. We show that the weak satisfaction of the contract is sufficient to deal with interconnections described by a directed acyclic graph, while strong satisfaction is needed to reason about general interconnections containing cycles. Specific results for systems described by differential inclusions and invariance assume-guarantee contracts are then developed. Finally, we show how the proposed assume-guarantee framework can recast different versions of the small-gain theorem as a particular case. Throughout the paper, the main results are illustrated using simple examples.

show abstract

“…In [118], the researchers prove that solving a long chain of circularity is difficult. Other works based on assume-guarantee reasoning involve an algorithm based on a prefix-closed set of traces [125], an algebraic theory [126], [127], an algorithm named AGMC [128], an assume-guarantee verification for SOFA component model [129], interconnected systems [130] and SSE reduction for time systems [131]- [133].…”

Section: Random Walkmentioning

confidence: 99%

Handling State Space Explosion in Component-Based Software Verification: A Review

et al. 2021

View full text Add to dashboard Cite

Component-based software development (CBSD) is an alternative approach to constructing software systems that offers numerous benefits, particularly in decreasing the complexity of system design. However, deploying components into a system is a challenging and error-prone task. Model-checking is one of the reliable methods to systematically analyze the correctness of a system. Its brute-force checking of the system's state space assists to significantly expand the level of confidence in the system. Nevertheless, model-checking is limited by a critical problem called state space explosion (SSE). To benefit from modelchecking, an appropriate method is required to reduce SSE. In the past two decades, a great number of SSE reduction methods have been proposed containing many similarities, dissimilarities, and unclear concepts in some cases. This research, firstly, plans to present a review of SSE handling methods and classify them based on their similarities, principle, and characteristics. Second, it investigates the methods for handling SSE problem in the verification process of CBSD and provides insight into the potential limitations, underlining the key challenges for future research efforts. INDEX TERMSComponent-based software development, Verification of software components, Modelchecking, State space explosion.

show abstract

Compositional synthesis via a convex parameterization of assume-guarantee contracts

Cited by 24 publications

References 50 publications

Compositional safety rules for inter-triggering hybrid automata

Compositional safety rules for inter-triggering hybrid automata

Assume-guarantee contracts for continuous-time systems

Handling State Space Explosion in Component-Based Software Verification: A Review

Contact Info

Product

Resources

About