On the synthesis of a reactive module

Pnueli, Amir; Rosner, Roni

doi:10.1145/75277.75293

Cited by 1,142 publications

(996 citation statements)

References 29 publications

Supporting

Mentioning

993

Contrasting

Unclassified

Order By: Relevance

“…For the latter consider an assignment of the probability 1 − 2 i · ε for staying on the path desired by the environment in the i-th step for some ε > 0 1 . Consequently, the LTL synthesis problem coincides for almost-sure and observable semantics with the LTL synthesis problem for classical semantics, which is 2EXPTIME-complete [15]. For almost-sure/observable CTL* semantics this implies that existential and universal path quantifiers coincide.…”

Section: ⊓ ⊔mentioning

confidence: 80%

“…The system reacts on each input by emitting an output symbol from a finite output-alphabet Σ. When the specifications are provided as temporal logics, the input-and output alphabet consist of the possible valuations of boolean input-and output-variables, respectively [15,10,11], which also serve as atomic propositions in the specification. A system is modeled as a finite transition-system, which defines a mapping m : Υ * → Σ from histories of input-signals to output-signals.…”

Section: Preliminariesmentioning

confidence: 99%

“…Theorem 4. [15,7] Given an LTL specification ϕ, we can construct a deterministic word automaton D ϕ that accepts exactly the models of ϕ. The number of states of D ϕ is doubly exponential in the length of ϕ.…”

Section: Temporal Logicsmentioning

confidence: 99%

“…This approach is not suitable for open systems, which interact with a predefined environment, since the synthesized system cannot restrict the behavior of its environment. Later works therefore concentrate on the synthesis of open systems from linear-time specifications [15,16,1]. These fundamental works on open synthesis required that the system satisfies its specification for all possible behaviors of the environment, i.e., an LTL formula ϕ is interpreted as the CTL* formula Aϕ.…”

Section: Introductionmentioning

confidence: 99%

“…These fundamental works on open synthesis required that the system satisfies its specification for all possible behaviors of the environment, i.e., an LTL formula ϕ is interpreted as the CTL* formula Aϕ. Pnueli and Rosner [15] demonstrated that the LTL synthesis problem is 2EXPTIME-complete in this setting. Kupferman and Vardi [10] extended open synthesis to branching-time specifications and incomplete information, and established EXPTIME and 2EXPTIME-completeness results for the CTL and CTL* synthesis problem, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Section: ⊓ ⊔mentioning

confidence: 80%

Section: Preliminariesmentioning

confidence: 99%

Section: Temporal Logicsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Synthesis for Probabilistic Environments

Schewe

2006

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

Introduction to Verification

Carnes¹,

Copps²

2011

Models and Analysis in Distributed Systems

View full text Add to dashboard Cite

Reasoning about Infinite Computations

Vardi

Wolper

1994

Information and Computation

659

519

View full text Add to dashboard Cite

We investigate extensions of temporal logic by connectives de ned by nite automata on in nite words. We consider three di erent logics, corresponding to three di erent types of acceptance conditions (nite, looping and repeating) for the automata. It turns out, however, that these logics all have the same expressive power and that their decision problems are all PSPACE-complete. We also investigate connectives de ned by alternating automata and show that they do not increase the expressive power of the logic or the complexity of the decision problem.

show abstract

On the synthesis of a reactive module

Cited by 1,142 publications

References 29 publications

Synthesis for Probabilistic Environments

Synthesis for Probabilistic Environments

Introduction to Verification

Reasoning about Infinite Computations

Contact Info

Product

Resources

About