Fair Synthesis for Asynchronous Distributed Systems

Gastin, Paul; Sznajder, Nathalie

doi:10.1145/2480759.2480761

Cited by 6 publications

(4 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If there are several processes, however, it is realistic to relax this condition, which leads us to an asynchronous setting in which the system has no influence on when the environment acts. Like in [21], where the asynchronous case for a fixed number of processes was considered, we only make the reasonable fairness assumption that the system is not blocked forever.…”

Section: Introductionmentioning

confidence: 99%

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words

Bérard¹,

Bollig²,

Lehaut³

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We study the synthesis problem for systems with a parameterized number of processes. As in the classical case due to Church, the system selects actions depending on the program run so far, with the aim of fulfilling a given specification. The difficulty is that, at the same time, the environment executes actions that the system cannot control. In contrast to the case of fixed, finite alphabets, here we consider the case of parameterized alphabets. An alphabet reflects the number of processes, which is static but unknown. The synthesis problem then asks whether there is a finite number of processes for which the system can satisfy the specification. This variant is already undecidable for very limited logics. Therefore, we consider a first-order logic without the order on word positions. We show that even in this restricted case synthesis is undecidable if both the system and the environment have access to all processes. On the other hand, we prove that the problem is decidable if the environment only has access to a bounded number of processes. In that case, there is even a cutoff meaning that it is enough to examine a bounded number of process architectures to solve the synthesis problem. Partly supported by ANR FREDDA (ANR-17-CE40-0013).

show abstract

Section: Introductionmentioning

confidence: 99%

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words

Bérard¹,

Bollig²,

Lehaut³

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The realizability problem for asynchronous systems and LTL specifications is undecidable for architectures with more than one process to be synthesized [15]. Later, Gastin et al showed decidability of a restricted specification language and certain types of architectures, i.e., well-connected [23] and acyclic [24] ones. Bounded synthesis [14,25] provides a flexible synthesis framework that can be used in both the asynchronous and the synchronous setting, based on a semi-decision procedure.…”

Section: Related Workmentioning

confidence: 99%

Distributed synthesis for parameterized temporal logics

Jacobs

Tentrup

Zimmermann

2018

Information and Computation

View full text Add to dashboard Cite

We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis, it is well-established that such parametric extensions do not increase worst-case complexities. For synchronous distributed systems, we show that, despite being more powerful, the realizability problem for PROMPT-LTL is not harder than its LTL counterpart. For asynchronous systems, we have to express scheduling assumptions and therefore consider an assume-guarantee synthesis problem. As asynchronous distributed synthesis is already undecidable for LTL, we give a semi-decision procedure for the PROMPT-LTL assume-guarantee synthesis problem based on bounded synthesis. Finally, we show that our results extend to the stronger logics PLTL and PLDL.

show abstract

“…Subsequently, [28] showed that pipelines are essentially the only decidable case. Some interesting extensions of Pnueli and Rosner's setting have been considered in [24,13,15].…”

Section: Related Workmentioning

confidence: 99%

Automated Synthesis of Distributed Controllers

Muscholl

2015

Automata, Languages, and Programming

View full text Add to dashboard Cite

Abstract. Synthesis is a particularly challenging problem for concurrent programs. At the same time it is a very promising approach, since concurrent programs are difficult to get right, or to analyze with traditional verification techniques. This paper gives an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring. ContextModern computing systems are increasingly distributed and heterogeneous. Software needs to be able to exploit these advances, providing means for applications to be more performant. Traditional concurrent programming paradigms, as in Java, are based on threads, shared-memory, and locking mechanisms that guard access to common data. More recent paradigms like the reactive programming model of Erlang [4] and Scala [35,36] replace shared memory by asynchronous message passing, where sending a message is non-blocking.In all these concurrent frameworks, writing reliable software is a serious challenge. Programmers tend to think about code mostly in a sequential way, and it is hard to grasp all possible schedulings of events in a concurrent execution. For similar reasons, verification and analysis of concurrent programs is a difficult task. Testing, which is still the main method for error detection in software, has low coverage for concurrent programs. The reason is that bugs in such programs are difficult to reproduce: they may happen under very specific thread schedules and the likelihood of taking such corner-case schedules is very low. Automated verification, such as model-checking and other traditional exploration techniques, can handle very limited instances of concurrent programs, mostly because of the very large number of possible states and of possible interleavings of executions.Formal analysis of programs requires as a pre-requisite a clean mathematical model for programs. Verification of sequential programs starts usually with an abstraction step -reducing the value domains of variables to finite domains, viewing conditional branching as non-determinism, etc. Another major simplification consists in disallowing recursion. This leads to a very robust computational model, namely finite-state automata and regular languages. Regular languages of words (and trees) are particularly well understood notions. The deep connections between logic and automata revealed by the foundational work of Büchi, Rabin, and others, are the main ingredients in automata-based verification.

show abstract

Fair Synthesis for Asynchronous Distributed Systems

Cited by 6 publications

References 40 publications

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words

Distributed synthesis for parameterized temporal logics

Automated Synthesis of Distributed Controllers

Contact Info

Product

Resources

About