From Partial to Global Assume-Guarantee Contracts: Compositional Realizability Analysis in FRET

Mavridou, Anastasia; Katis, Andreas; Giannakopoulou, Dimitra; Kooi, David; Pressburger, Thomas; Whalen, Michael W.

doi:10.1007/978-3-030-90870-6_27

Cited by 11 publications

(9 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A recent work on realizability checking of infinite-state specifications is the compositional realizability analysis presented in [9], which is a preprocessing step that can be applied to assumeguarantee contracts. It automatically partitions specifications into sets of non-interfering requirements so that checking whether a specification is realizable reduces to checking that each partition is realizable.…”

Section: Related Workmentioning

confidence: 99%

Realizability Checking of Contracts with Kind 2

Larraz¹,

Tinelli²

2022

Preprint

View full text Add to dashboard Cite

We present a new feature of the open-source model checker Kind 2 which checks whether a component contract is realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. When the contract is proven unrealizable, it provides a deadlocking computation and a set of conflicting guarantees. This new feature can be used to detect flaws in component specifications and to ensure the correctness of Kind 2's compositional proof arguments.

show abstract

Section: Related Workmentioning

confidence: 99%

Realizability Checking of Contracts with Kind 2

Larraz¹,

Tinelli²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Independent of [13], Mavridou et al introduce a compositional realizability analysis of formulas given in FRET [17] that is based on similar ideas as our LTL decomposition algorithm [25]. They only study the realizability of formulas but do not synthesize solutions.…”

Section: Introductionmentioning

confidence: 99%

“…Optimized assumption handling cannot easily be integrated into their approach. For a detailed comparison of both approaches, we refer to [25]. The first version [13] of our modular synthesis approach is already well-accepted in the synthesis community: our LTL decomposition algorithm has been integrated into the new version [31] of the synthesis tool ltlsynt [27].…”

Section: Introductionmentioning

confidence: 99%

Specification decomposition for reactive synthesis

Finkbeiner

Geier

Passing

2022

Innovations Syst Softw Eng

View full text Add to dashboard Cite

Reactive synthesis is the task of automatically deriving a correct implementation from a specification. It is a promising technique for the development of verified programs and hardware. Despite recent advances in terms of algorithms and tools, however, reactive synthesis is still not practical when the specified systems reach a certain bound in size and complexity. In this paper, we present a sound and complete modular synthesis algorithm that automatically decomposes the specification into smaller subspecifications. For them, independent synthesis tasks are performed, significantly reducing the complexity of the individual tasks. Our decomposition algorithm guarantees that the subspecifications are independent in the sense that completely separate synthesis tasks can be performed for them. Moreover, the composition of the resulting implementations is guaranteed to satisfy the original specification. Our algorithm is a preprocessing technique that can be applied to a wide range of synthesis tools. We evaluate our approach with state-of-the-art synthesis tools on established benchmarks: the runtime decreases significantly when synthesizing implementations modularly.

show abstract

“…In addition, contract-based design is advocated as a method for achieving correctness by design, provided that satisfactory implementations of the system can be found [23]. There are a number of theoretical frameworks that apply mainly to continuous or synchronous systems, especially for analysis and verification purposes [22,14,20]. They suffer computational limitations because, in the general case, they involve the symbolic solution of fixed-point equations, which restricts the expressiveness of the contracts [14].…”

Section: Introductionmentioning

confidence: 99%

“…There are a number of theoretical frameworks that apply mainly to continuous or synchronous systems, especially for analysis and verification purposes [22,14,20]. They suffer computational limitations because, in the general case, they involve the symbolic solution of fixed-point equations, which restricts the expressiveness of the contracts [14]. Furthermore, they are only applicable to systems with a static architecture, which excludes dynamic reconfigurable systems, such as autonomous systems.…”

Section: Introductionmentioning

confidence: 99%

Correct by Design Coordination of Autonomous Driving Systems

Bozga¹,

Sifakis²

2022

Preprint

View full text Add to dashboard Cite

The paper proposes a method for the correct by design coordination of autonomous driving systems (ADS ). It builds on previous results on collision avoidance policies and the modeling of ADS by combining descriptions of their static environment in the form of maps, and the dynamic behavior of their vehicles. An ADS is modeled as a dynamic system involving a set of vehicles coordinated by a Runtime that based on vehicle positions on a map and their kinetic attributes, computes free spaces for each vehicle. Vehicles are bounded to move within the corresponding allocated free spaces. We provide a correct by design safe control policy for an ADS if its vehicles and the Runtime respect corresponding assume-guarantee contracts. The result is established by showing that the composition of assumeguarantee contracts is an inductive invariant that entails ADS safety. We show that it is practically possible to define speed control policies for vehicles that comply with their contracts. Furthermore, we show that traffic rules can be specified in a linear-time temporal logic, as a class of formulas that constrain vehicle speeds. The main result is that, given a set of traffic rules, it is possible to derive free space policies of the Runtime such that the resulting system behavior is safe by design with respect to the rules.

show abstract

From Partial to Global Assume-Guarantee Contracts: Compositional Realizability Analysis in FRET

Cited by 11 publications

References 46 publications

Realizability Checking of Contracts with Kind 2

Realizability Checking of Contracts with Kind 2

Specification decomposition for reactive synthesis

Correct by Design Coordination of Autonomous Driving Systems

Contact Info

Product

Resources

About