Encodings of Bounded Synthesis

Faymonville, Peter; Finkbeiner, Bernd; Rabe, Markus N.; Tentrup, Leander

doi:10.1007/978-3-662-54577-5_20

Cited by 63 publications

(86 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BoSy encodes a synchronous synthesis problem into a constraint-solving problem, using either SAT or QBF solvers. Although prior investigations suggest that QBF is more effective [Faymonville et al 2017b], our domain-specific OneHot-SAT encoding handily outperforms QBF, even though the size of the encoded constraint is larger. This, we believe, is because SAT solvers are more mature than QBF solvers.…”

Section: Discussionmentioning

confidence: 73%

“…In prior work on BoSy [Faymonville et al 2017b] the authors report that QBF outperforms SAT. Much to our surprise, we observed the reverse: the SAT encoding handily outperforms QBF, as shown in the experiment tables later in this section.…”

Section: Symbolic Constructionsmentioning

confidence: 99%

“…It uses Ordered Binary Decision Diagrams (OBDDs) [Bryant 1986] for symbolic manipulation. The transformed specification is then checked for realizability using the state-of-the-art symbolic synthesis tool BoSy [Faymonville et al 2017b]. We present case studies that synthesize a smart thermostat and an arbiter for a number of concurrent processes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Synthesis of coordination programs from linear temporal specifications

Bansal

Namjoshi

Sa’ar³

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

This paper presents a method for synthesizing a reactive program which coordinates the actions of a group of other reactive programs, so that the combined system satisfies a temporal specification of its desired long-term behavior. Traditionally, reactive synthesis has been applied to the construction of a stateful hardware circuit. This work is motivated by applications to other domains, such as the IoT (the Internet of Things) and robotics, where it is necessary to coordinate the actions of multiple sensors, devices, and robots. The mathematical model represents such entities as individual processes in Hoare's CSP model. Given a network of interacting entities, called an environment, and a temporal specification of long-term behavior, the synthesis method constructs a coordinator process (if one exists) that guides the actions of the environment entities so that the combined system is deadlock-free and satisfies the given specification. The main technical challenge is that a coordinator may have only partial knowledge of the environment state, due to non-determinism within the environment, and environment actions that are hidden from the coordinator. This is the first method to handle both sources of partial knowledge, and to do so for arbitrary linear temporal logic specifications. It is shown that the coordination synthesis problem is PSPACE-hard in the size of the environment. A prototype implementation is able to synthesize compact solutions for a number of coordination problems.

show abstract

Section: Discussionmentioning

confidence: 73%

Section: Symbolic Constructionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synthesis of coordination programs from linear temporal specifications

Bansal

Namjoshi

Sa’ar³

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…If no such implementation exists, it increments the bound and repeats the search process. Each instance of bounded search for an implementation can be encoded as a SAT (or QBF, or SMT) problem [4]. The algorithm is complete as a theoretical bound on the maximum size of the implementation exists.…”

Section: Introductionmentioning

confidence: 99%

Reactive synthesis with maximum realizability of linear temporal logic specifications

2019

View full text Add to dashboard Cite

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties of systems. In applications in which the specifications originate from various aspects of the system design, or consist of a large set of formulas, the overall system specification may be unrealizable. Driven by this fact, we develop an optimization variant of synthesis from LTL formulas, where the goal is to design a controller that satisfies a set of hard specifications and minimally violates a set of soft specifications. To that end, we introduce a value function that, by exploiting the LTL semantics, quantifies the level of violation of properties. Inspired by the idea of bounded synthesis, we fix a bound on the implementation size and search for an implementation that is optimal with respect to the said value function. We propose a novel maximum satisfiability encoding of the search for an optimal implementation (within the given bound on the implementation size). We iteratively increase the bound on the implementation size until a termination criterion, such as a threshold over the value function, is met.

show abstract

“…Solving quantified Boolean formulas (QBFs) is one of the core challenges in automated reasoning and is particularly important for applications in verification and synthesis. For example, program synthesis with syntax guidance [1,2] and the synthesis of reactive controllers from LTL specifications has been encoded in QBF [3,4]. Many of these problems require only formulas with one quantifier alternation (2QBF), which are the focus of this paper.…”

Section: Introductionmentioning

confidence: 99%

Understanding and Extending Incremental Determinization for 2QBF

Rabe

Tentrup

Rasmussen

et al. 2018

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Incremental determinization is a recently proposed algorithm for solving quantified Boolean formulas with one quantifier alternation. In this paper, we formalize incremental determinization as a set of inference rules to help understand the design space of similar algorithms. We then present additional inference rules that extend incremental determinization in two ways. The first extension integrates the popular CEGAR principle and the second extension allows us to analyze different cases in isolation. The experimental evaluation demonstrates that the extensions significantly improve the performance.

show abstract

Encodings of Bounded Synthesis

Cited by 63 publications

References 31 publications

Synthesis of coordination programs from linear temporal specifications

Synthesis of coordination programs from linear temporal specifications

Reactive synthesis with maximum realizability of linear temporal logic specifications

Understanding and Extending Incremental Determinization for 2QBF

Contact Info

Product

Resources

About