GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces

Samuel, Stanly; D’Souza, Deepak; Komondoor, Raghavan

doi:10.1145/3468264.3473126

Cited by 6 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These procedures are commonly available in state-of-the-art SMT solvers like Z3 [10] and CVC4 [1]. The use of a standard solver is also the approach followed by the synthesis tool GenSys, recently published in [11], which was developed contemporary with our tool. As the experimental evaluation shows later, the use of standard solvers can improve the performance and increase the set of solved instances on the set of benchmarks used in the original work.…”

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

“…-The design and implementation of a realizability checking framework in FRET that tightly integrates the JKind [23] and Kind 2 [35] analysis tools; -a diagnosis feature for unrealizability that returns all minimal conflicts and their counterexamples in an easy-to-use, graphical user interface; -the extension of the simulator component in FRET, to be used for the simulation of conflicting requirements in unrealizable specifications; and -improvements of the algorithms in our in-house fork of the JKind model checker, following recent work from the Kind 2 and GenSys [48] tools.…”

Section: Introductionmentioning

confidence: 99%

Capture, Analyze, Diagnose: Realizability Checking Of Requirements in FRET

Katis

Mavridou

Giannakopoulou

et al. 2022

Computer Aided Verification

View full text Add to dashboard Cite

Requirements formalization has become increasingly popular in industrial settings as an effort to disambiguate designs and optimize development time and costs for critical system components. Formal requirements elicitation also enables the employment of analysis tools to prove important properties, such as consistency and realizability. In this paper, we present the realizability analysis framework that we developed as part of the Formal Requirements Elicitation Tool (FRET). Our framework prioritizes usability, and employs state-of-the-art analysis algorithms that support infinite theories. We demonstrate the workflow for realizability checking, showcase the diagnosis process that supports visualization of conflicts between requirements and simulation of counterexamples, and discuss results from industrial-level case studies.

show abstract

Localized Attractor Computations for Infinite-State Games

Schmuck,

Heim,

Dimitrova

et al. 2024

Computer Aided Verification

View full text Add to dashboard Cite

Infinite-state games are a commonly used model for the synthesis of reactive systems with unbounded data domains. Symbolic methods for solving such games need to be able to construct intricate arguments to establish the existence of winning strategies. Often, large problem instances require prohibitively complex arguments. Therefore, techniques that identify smaller and simpler sub-problems and exploit the respective results for the given game-solving task are highly desirable.In this paper, we propose the first such technique for infinite-state games. The main idea is to enhance symbolic game-solving with the results of localized attractor computations performed in sub-games. The crux of our approach lies in identifying useful sub-games by computing permissive winning strategy templates in finite abstractions of the infinite-state game. The experimental evaluation of our method demonstrates that it outperforms existing techniques and is applicable to infinite-state games beyond the state of the art.

show abstract

GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces

Cited by 6 publications

References 25 publications

Realizability Checking of Contracts with Kind 2

Realizability Checking of Contracts with Kind 2

Capture, Analyze, Diagnose: Realizability Checking Of Requirements in FRET

Localized Attractor Computations for Infinite-State Games

Contact Info

Product

Resources

About