Uniform Distributed Synthesis

Finkbeiner, Bernd; Schewe, Sven

doi:10.1109/lics.2005.53

Cited by 118 publications

(167 citation statements)

References 4 publications

Supporting

Mentioning

160

Contrasting

Unclassified

Order By: Relevance

“…When the implementation is required to be distributed, the problem is known to be undecidable [8,9,10,11]. In bounded synthesis, one fixes a bound on the number of states of the implementation, and this allows algorithmic solutions to distributed synthesis [12].…”

Section: Related Workmentioning

confidence: 99%

Synthesizing Finite-State Protocols from Scenarios and Requirements

Alur

Martin

Raghothaman

et al. 2014

Hardware and Software: Verification and Testing

View full text Add to dashboard Cite

Abstract. Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite-state protocols using scenarios: we show that it is possible to automatically derive a distributed implementation from a set of scenarios augmented with a set of safety and liveness requirements, provided the given scenarios adequately cover all the states of the desired implementation. We first derive incomplete state machines from the given scenarios, and then synthesis corresponds to completing the transition relation of individual processes so that the global product meets the specified requirements. This completion problem, in general, has the same complexity, PSPACE, as the verification problem, but unlike the verification problem, is NPcomplete for a constant number of processes. We present two algorithms for solving the completion problem, one based on a heuristic search in the space of possible completions and one based on OBDD-based symbolic fixpoint computation. We evaluate the proposed methodology for protocol specification and the effectiveness of the synthesis algorithms using the classical alternating-bit protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Synthesizing Finite-State Protocols from Scenarios and Requirements

Alur

Martin

Raghothaman

et al. 2014

Hardware and Software: Verification and Testing

View full text Add to dashboard Cite

show abstract

“…An interesting side effect of using an automata-based synthesis algorithm is the possibility to extend the results for single-process synthesis directly to multi-process synthesis [12,6].…”

Section: Discussionmentioning

confidence: 99%

Synthesis for Probabilistic Environments

Schewe

2006

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this paper suggests the novel approach of open synthesis under the assumptions of an environment that chooses its actions randomized rather than nondeterministically. Assuming a randomized environment inspires alternative semantics both for linear-time and branching-time logics. For linear-time, natural acceptance criteria are almost-sure and observable acceptance, where it suffices if the probability measure of accepting paths is 1 and greater than 0, respectively. We distinguish 0-environments, which can freely assign probabilities to each environment action, from ε-environments, where the probabilities assigned by the environment are bound from below by some ε > 0. While the results in case of 0-environments are essentially the same as for nondeterministic environments, the languages occurring in case of ε-environments are topologically different from the results for nondeterministic and 0-environments (in case of LTL, recognizable by weak alternating automata vs. recognizable by deterministic automata). The complexity of open synthesis is, in both cases, EXPTIME and 2EXPTIME-complete for CTL and LTL specifications, respectively.

show abstract

“…Synthesizing single-process implementations is EXPTIME-complete for the µ-calculus [5,9], and 2EXPTIME-complete for linear-time temporal logic (LTL) and computation-tree logic (CTL*) [7,9,6]. Multi-process synthesis, the problem of finding implementations for the processes in a given distributed architecture, has been solved for pipelines [13], rings [10], and in general for all architectures without information forks (i.e., pairs of processes with incomparable information) [3].…”

Section: Introductionmentioning

confidence: 99%

Synthesis of Asynchronous Systems

Schewe

Finkbeiner

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. This paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of synthesizing a single-process implementation is the same for synchronous and asynchronous systems (2EXPTIME-complete for CTL* and EXPTIME-complete for the µ-calculus) if we assume a full scheduler (i.e., a scheduler that allows every possible scheduling), and exponentially more expensive for asynchronous systems without this assumption (3EXPTIME-complete for CTL* and 2EXPTIME-complete for the µ-calculus). While multi-process synthesis for synchronous distributed systems is possible for certain architectures (like pipelines and rings), we show that the synthesis of asynchronous distributed systems is decidable if and only if at most one process implementation is unknown.

show abstract

Uniform Distributed Synthesis

Cited by 118 publications

References 4 publications

Synthesizing Finite-State Protocols from Scenarios and Requirements

Synthesizing Finite-State Protocols from Scenarios and Requirements

Synthesis for Probabilistic Environments

Synthesis of Asynchronous Systems

Contact Info

Product

Resources

About