Synthesis of Fault-Tolerant Distributed Systems

Dimitrova, Rayna; Finkbeiner, Bernd

doi:10.1007/978-3-642-04761-9_24

Cited by 17 publications

(11 citation statements)

References 12 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ϕ is equivalent to the LTL realizability problem of ϕ. With two universal quantifiers, one can express relations between traces in the execution tree, thus, one can express the LTL realizability problem with restricted information flow like incomplete information [35], distributed synthesis [27,40], and fault-tolerant synthesis [13,30].…”

Section: Definition 1 (Hyperltl Realizability)mentioning

confidence: 99%

Synthesis from hyperproperties

et al. 2019

Self Cite

View full text Add to dashboard Cite

We study the reactive synthesis problem for hyperproperties given as formulas of the temporal logic HyperLTL. Hyperproperties generalize trace properties, i.e., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain. Such properties cannot be expressed in standard linear or branching-time temporal logics like LTL, CTL, or CTL *. Furthermore, HyperLTL subsumes many classical extensions of the LTL realizability problem, including realizability under incomplete information, distributed synthesis, and fault-tolerant synthesis. We show that, while the synthesis problem is undecidable for full HyperLTL, it remains decidable for the ∃ * , ∃ * ∀ 1 , and the linear ∀ * fragments. Beyond these fragments, the synthesis problem immediately becomes undecidable. For universal HyperLTL, we present a semi-decision procedure that constructs implementations and counterexamples up to a given bound. We report encouraging experimental results obtained with a prototype implementation on example specifications with hyperproperties like symmetric responses, secrecy, and information flow.

show abstract

Section: Definition 1 (Hyperltl Realizability)mentioning

confidence: 99%

Synthesis from hyperproperties

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…The Byzantine Generals' Problem is often used as an illustration for the knowledge-based reasoning in epistemic logics, see [13] for an early formalization. Concerning the synthesis of fault-tolerant distributed systems, there is an approach to synthesize fault-tolerant systems in the special case of strongly connected system architectures [14]. …”

Section: Related Workmentioning

confidence: 99%

Detecting Unrealizable Specifications of Distributed Systems

Finkbeiner

Tentrup

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not every information is available in every component, and information transmitted from other components may arrive with a delay or not at all, especially in the presence of faults. The problem of checking the distributed realizability of a temporal specification is, in general, undecidable. Semi-algorithms for synthesis, such as bounded synthesis, are only useful in the positive case, where they construct an implementation for a realizable specification, but not in the negative case: if the specification is unrealizable, the search for the implementation never terminates. In this paper, we introduce counterexamples to distributed realizability and present a method for the detection of such counterexamples for specifications given in linear-time temporal logic (LTL). A counterexample consists of a set of paths, each representing a different sequence of inputs from the environment, such that, no matter how the components are implemented, the specification is violated on at least one of these paths. We present a method for finding such counterexamples both for the classic distributed realizability problem and for the distributed realizability problem with faulty nodes. Our method considers, incrementally, larger and larger sets of paths until a counterexample is found. While counterexamples for full LTL may consist of infinitely many paths, we give a semantic characterization such that the required number of paths can be bounded. For this fragment, we thus obtain a decision procedure. Experimental results, obtained with a QBF-based prototype implementation, show that our method finds simple errors very quickly, and even problems with high combinatorial complexity, like the Byzantine Generals' Problem, are tractable.

show abstract

“…The Byzantine Generals' Problem is often used as an illustration for knowledge-based reasoning in epistemic logics, see [HM84] for an early formalization. Concerning the synthesis of fault-tolerant distributed systems, there is an approach to synthesize fault-tolerant systems in the special case of strongly connected architectures [DF09]. A preliminary version of this paper appeared as [FT14].…”

Section: Introductionmentioning

confidence: 99%

Logics with rigidly guarded data tests

Puppis¹,

Colcombet²,

Ley³

2015

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. The notion of orbit finite data monoid was recently introduced by Bojańczyk as an algebraic object for defining recognizable languages of data words. Following Büchi's approach, we introduce a variant of monadic second-order logic with data equality tests that captures precisely the data languages recognizable by orbit finite data monoids. We also establish, following this time the approach of Schützenberger, McNaughton and Papert, that the first-order fragment of this logic defines exactly the data languages recognizable by aperiodic orbit finite data monoids. Finally, we consider another variant of the logic that can be interpreted over generic structures with data. The data languages defined in this variant are also recognized by unambiguous finite memory automata.

show abstract

Synthesis of Fault-Tolerant Distributed Systems

Cited by 17 publications

References 12 publications

Synthesis from hyperproperties

Synthesis from hyperproperties

Detecting Unrealizable Specifications of Distributed Systems

Logics with rigidly guarded data tests

Contact Info

Product

Resources

About