Table of Contents
Fetching ...

Information Flow Guided Synthesis with Unbounded Communication

Bernd Finkbeiner, Niklas Metzger, Yoram Moses

TL;DR

This work tackles the problem of synthesizing distributed reactive systems when information must flow unboundedly between components. It introduces a prefix-based, safety-aware information-flow framework that uses finite information classes to capture the essential information at each time step, enabling scalable compositional synthesis via HyperLTL-style assumptions and guarantees. The authors present a practical instantiation, FlowSy, which implements the approach and demonstrates superior performance over previous bounded-information methods on several benchmarks. The key contributions are the prefix distinguishability construction, the finite information-class mechanism, safety hyper implementations, and a compositional synthesis pipeline that yields local components with guaranteed information flow. The approach significantly expands the applicability of automated distributed synthesis to protocols with streaming, potentially infinite communication, and offers practical tooling for real-world designs.

Abstract

Information flow guided synthesis is a compositional approach to the automated construction of distributed systems where the assumptions between the components are captured as information-flow requirements. Information-flow requirements are hyperproperties that ensure that if a component needs to act on certain information that is only available in other components, then this information will be passed to the component. We present a new method for the automatic construction of information flow assumptions from specifications given as temporal safety properties. The new method is the first approach to handle situations where the required amount of information is unbounded. For example, we can analyze communication protocols that transmit a stream of messages in a potentially infinite loop. We show that component implementations can then, in principle, be constructed from the information flow requirements using a synthesis tool for hyperproperties. We additionally present a more practical synthesis technique that constructs the components using efficient methods for standard synthesis from trace properties. We have implemented the technique in the prototype tool FlowSy, which outperforms previous approaches to distributed synthesis on several benchmarks.

Information Flow Guided Synthesis with Unbounded Communication

TL;DR

This work tackles the problem of synthesizing distributed reactive systems when information must flow unboundedly between components. It introduces a prefix-based, safety-aware information-flow framework that uses finite information classes to capture the essential information at each time step, enabling scalable compositional synthesis via HyperLTL-style assumptions and guarantees. The authors present a practical instantiation, FlowSy, which implements the approach and demonstrates superior performance over previous bounded-information methods on several benchmarks. The key contributions are the prefix distinguishability construction, the finite information-class mechanism, safety hyper implementations, and a compositional synthesis pipeline that yields local components with guaranteed information flow. The approach significantly expands the applicability of automated distributed synthesis to protocols with streaming, potentially infinite communication, and offers practical tooling for real-world designs.

Abstract

Information flow guided synthesis is a compositional approach to the automated construction of distributed systems where the assumptions between the components are captured as information-flow requirements. Information-flow requirements are hyperproperties that ensure that if a component needs to act on certain information that is only available in other components, then this information will be passed to the component. We present a new method for the automatic construction of information flow assumptions from specifications given as temporal safety properties. The new method is the first approach to handle situations where the required amount of information is unbounded. For example, we can analyze communication protocols that transmit a stream of messages in a potentially infinite loop. We show that component implementations can then, in principle, be constructed from the information flow requirements using a synthesis tool for hyperproperties. We additionally present a more practical synthesis technique that constructs the components using efficient methods for standard synthesis from trace properties. We have implemented the technique in the prototype tool FlowSy, which outperforms previous approaches to distributed synthesis on several benchmarks.
Paper Structure (22 sections, 5 theorems, 11 equations, 3 figures, 1 table, 1 algorithm)

This paper contains 22 sections, 5 theorems, 11 equations, 3 figures, 1 table, 1 algorithm.

Key Result

theorem thmcountertheorem

For a component $p$ with specification $\varphi_p$, there exists a non-de-ter-mi-nis-tic finite automaton with a doubly exponential number of states in the length of $\varphi_p$ that recognizes the prefix distinguishability relation $\rho_{\varphi_p}$.

Figures (3)

  • Figure 1: The prefix distinguishability of the sequence transmission protocol as NFA in (a). The NFA representing the information class for output $\mathtt{b}_{out}$ is shown in (b), where (c) is a hyper implementation of the receiver on information classes.
  • Figure 2: The steps in the algorithm for compositional synthesis with prefix information flow assumptions.
  • Figure : Information Classes

Theorems & Definitions (22)

  • definition thmcounterdefinition: Trace distinguishability DBLP:conf/cav/FinkbeinerMM22
  • definition thmcounterdefinition: Trace information-flow assumption DBLP:conf/cav/FinkbeinerMM22
  • definition thmcounterdefinition: Prefix distinguishability
  • theorem thmcountertheorem
  • proof
  • definition thmcounterdefinition: Prefix information-flow assumptions
  • lemma thmcounterlemma
  • proof
  • definition thmcounterdefinition: Prefix information class
  • definition thmcounterdefinition: Information class specification
  • ...and 12 more