On the synthesis of an asynchronous reactive module

Pnueli, Amir; Rosner, Roni

doi:10.1007/bfb0035790

Cited by 227 publications

(166 citation statements)

References 24 publications

Supporting

Mentioning

159

Contrasting

Order By: Relevance

“…Existing synthesis methods in the literature mostly focus on deriving the synchronization skeleton of a program from its specification (expressed in terms of temporal logic expressions or finite-state automata) [Emerson and Clarke 1982;Manna and Wolper 1984;Pnueli and Rosner 1989a;1989b;Attie …”

Section: Revising Real-time Unity Programs: Hardness Resultsmentioning

confidence: 99%

Revising UNITY Programs: Possibilities and Limitations

Ebnenasir

Kulkarni

Bonakdarpour

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We concentrate on automatic addition of untimed and real-time UNITY properties to programs by local redesign. The main focus of this paper is to identify instances where addition of UNITY properties can be achieved efficiently (in polynomial time) and where the problem of adding UNITY properties is difficult (NP-complete).Regarding addition of UNITY properties in polynomial time, we present a sound and complete algorithm that adds a single leads-to property (respectively, bounded-time leads-to property) and a conjunction of unless, stable, and invariant properties (respectively, bounded-time unless and stable) to an existing untimed (respectively, real-time) UNITY program. Since ensures can be expressed as a conjunction of a leads-to and unless, our algorithms can also be used to add one ensures property along with a conjunction of safety properties.Regarding hardness results, we show that (1) while one leads-to (respectively, ensures) property can be added in polynomial time, the problem of adding two such properties (or any combination of leads-to and ensures) is NP-complete, (2) if maximum non-determinism is desired then the problem of adding even a single leads-to property is NP-complete, and (3) the problem of providing maximum non-determinism while adding a single bounded-time leads-to property to a real-time program is NP-complete (in the size of the time-abstract bisimulation representation of the program) even if the original program satisfies the corresponding unbounded leads-to property.

show abstract

Section: Revising Real-time Unity Programs: Hardness Resultsmentioning

confidence: 99%

Revising UNITY Programs: Possibilities and Limitations

Ebnenasir

Kulkarni

Bonakdarpour

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In particular, the controller synthesis problem asks, given a model for a plant, to construct a model for a controller such that the behaviors resulting from the parallel composition of the two models respects a given specification (e.g., are included in an ω-regular set). Controllers can be synthesized as winning strategies in a game graph whose vertices represent the plant states, and whose players represent the plant and the controller [18,17]. Other applications of game graphs include realizability and compatibility checking, where the players represent parallel processes of a system, or its environment [1,11,6].…”

Section: Introductionmentioning

confidence: 99%

“…In [17], Pnueli and Rosner study the synthesis of reactive modules. In their framework, there is no game graph; instead, the environment and the objective are specified using an LTL formula.…”

Section: Introductionmentioning

confidence: 99%

Algorithms for Omega-Regular Games with Imperfect Information

Chatterjee¹,

Doyen²,

Henzinger³

et al. 2007

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective. The fixed point is computed in the lattice of antichains of state sets. This algorithm has the advantages of being directed by the objective and of avoiding an explicit subset construction on the game graph. Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Büchi objective. This set is of interest because in the absence of perfect information, randomized strategies are more powerful than deterministic ones. We show that our algorithms are optimal by proving matching lower bounds.

show abstract

“…The first solution for asynchronous synthesis with specifications in LTL, but without fairness conditions, is due to Pnueli and Rosner [12]. Anuchitanukul and Manna [1] later showed that fairness conditions can be included in a deductive approach; Vardi [14] provided an automata-based algorithm for the same problem.…”

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

On the synthesis of an asynchronous reactive module

Cited by 227 publications

References 24 publications

Revising UNITY Programs: Possibilities and Limitations

Revising UNITY Programs: Possibilities and Limitations

Algorithms for Omega-Regular Games with Imperfect Information

Synthesis of Asynchronous Systems

Contact Info

Product

Resources

About