Compositional Synthesis of Modular Systems

Finkbeiner, Bernd; Passing, Noemi

doi:10.1007/978-3-030-88885-5_20

Cited by 6 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using a weaker winning condition for synthesis, remorse-free dominance [7] avoids the explicit construction of assumptions and guarantees, resulting in implicit assumptions. A recent approach [13] uses behavioral guarantees in the form of certificates to guide the synthesis process. Certificates specify partial behaviour of each component and are iteratively synthesized.…”

Section: Related Workmentioning

confidence: 99%

“…If the assumptions are not sufficient, i.e., too weak to locally guarantee the specification, the assumption can be iteratively refined [29]. Another approach is weakening the acceptance condition to dominance [10] or certificates that specify partial behavior of the components in an iterative fashion [19]. In our previous work on information flow guided synthesis [17], we have introduced the concept of compositional synthesis with information-flow assumptions.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Information Flow Guided Synthesis

Finkbeiner

Niklas

Moses

2022

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Compositional synthesis relies on the discovery of assumptions, i.e., restrictions on the behavior of the remainder of the system that allow a component to realize its specification. In order to avoid losing valid solutions, these assumptions should be necessary conditions for realizability. However, because there are typically many different behaviors that realize the same specification, necessary behavioral restrictions often do not exist. In this paper, we introduce a new class of assumptions for compositional synthesis, which we call information flow assumptions. Such assumptions capture an essential aspect of distributed computing, because components often need to act upon information that is available only in other components. The presence of a certain flow of information is therefore often a necessary requirement, while the actual behavior that establishes the information flow is unconstrained. In contrast to behavioral assumptions, which are properties of individual computation traces, information flow assumptions are hyperproperties, i.e., properties of sets of traces. We present a method for the automatic derivation of information-flow assumptions from a temporal logic specification of the system. We then provide a technique for the automatic synthesis of component implementations based on information flow assumptions. This provides a new compositional approach to the synthesis of distributed systems. We report on encouraging first experiments with the approach, carried out with the BoSyHyper synthesis tool.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Information Flow Guided Synthesis

Finkbeiner

Niklas

Moses

2022

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Assume-guarantee synthesis algorithms [2,3,15,24] take dependencies between components into account. In this setting, specifications are not always satisfiable by one component alone.…”

Section: Introductionmentioning

confidence: 99%

Specification decomposition for reactive synthesis

Finkbeiner

Geier

Passing

2022

Innovations Syst Softw Eng

Self Cite

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

“…There, explicit assumptions on the environment are added to the specification. These assumptions can be LTL formulas restricting the possible input sequences (see, e.g., [7,5]) or environment strategies (see, e.g., [2,3,17,18]). The assumptions can also be conceptual such as assuming that the environment is rational (see, e.g., [23,26,6,8]).…”

Section: Introductionmentioning

confidence: 99%

Synthesizing Dominant Strategies for Liveness (Full Version)

Finkbeiner¹,

Passing²

2022

Preprint

View full text Add to dashboard Cite

Reactive synthesis automatically derives a strategy that satisfies a given specification. However, requiring a strategy to meet the specification in every situation is, in many cases, too hard of a requirement. Particularly in compositional synthesis of distributed systems, individual winning strategies for the processes often do not exist. Remorsefree dominance, a weaker notion than winning, accounts for such situations: dominant strategies are only required to be as good as any alternative strategy, i.e., they are allowed to violate the specification if no other strategy would have satisfied it in the same situation. The composition of dominant strategies is only guaranteed to be dominant for safety properties, though; preventing the use of dominance in compositional synthesis for liveness specifications. Yet, safety properties are often not expressive enough. In this paper, we thus introduce a new winning condition for strategies, called delay-dominance, that overcomes this weakness of remorsefree dominance: we show that it is compositional for both safety and liveness specifications, enabling a compositional synthesis algorithm based on delay-dominance for general specifications. Furthermore, we introduce an automaton construction for recognizing delay-dominant strategies and prove its soundness and completeness. The resulting automaton is of single-exponential size in the squared length of the specification and can immediately be used for safraless synthesis procedures. Thus, synthesis of delay-dominant strategies is, as synthesis of winning strategies, in 2EXPTIME.

show abstract

Compositional Synthesis of Modular Systems

Cited by 6 publications

References 19 publications

Information Flow Guided Synthesis

Information Flow Guided Synthesis

Specification decomposition for reactive synthesis

Synthesizing Dominant Strategies for Liveness (Full Version)

Contact Info

Product

Resources

About