O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Advances in Temporal Logic, pages 109--127. Kluwer Academic Publishers, January 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....(Denmark) Part of this work was done during a visit to LSV, ENS de Cachan (France) y This research was supported by NSF award CCR99 70925 and NSF award ITR SY 0121431. full observability (in terms of two player games of complete information) Tho02] and for partial observability [KG95,Rei84,KV97]. In parallel, there has been a growing importance of verification for real time systems, and this leads to the natural question of whether techniques developed in the untimed setting for the controller synthesis problem can be generalized to timed systems (see for example the papers ....

....[DM02] Undecidable [DM02] Undecidable [DM02] Of course, when we drop the hypothesis of full observability, the undecidable cases carry over under the weaker assumption of partial observability. While full and partial observability lead to the same decidable cases in the untimed framework [KV97], our results show that the situation is rather different in the timed setting. Indeed, if the resources of the controller are not fixed a priori, the problem becomes undecidable, even for deterministic specifications. This is in contrast to the complete observability setting, where the problem is ....

[Article contains additional citation context not shown here]

O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Proc. 2nd Int. Conf. Temporal Logic (ICTL'97), pages 91--106. Kluwer, 1997.

....and a finite state program can be synthesized from an infinite tree accepted by the automaton. The problems of realizability checking and synthesis from linear temporal logic are shown to be 2EXPTIME complete. Work on synthesis from branching temporal logics, based on alternating tree automata [20], show that the synthesis problems for CTL and CTL are EXPTIME and 2EXPTIME complete, respectively. In [27] synthesis of a distributed reactive system is considered. Given an architecture a set of processors and their interconnection scheme a solution to the synthesis problem yields ....

Kupferman, O., and M.Y. Vardi, "Synthesis with incomplete information", Proc. 2nd Int. Conf. on Temporal Logic (ICTL97), pp. 91--106, 1997.

....synthesize a correct system implementation from the requirements. Work on synthesis from MSC like languages appears in [23, 24, 2, 34, 10] and an algorithm for synthesizing statecharts from LSC s appears in [13] Moreover, a lot of work has been done on synthesis from temporal logic e.g. [9, 1, 29, 25]. The main difference is that in our work the play out algorithms search one super step ahead (or several super steps when satisfying existential charts) whereas synthesis algorithms do not have such restrictions; they can thus be proven to behave correctly under all circumstances. Apart from the ....

O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In 2nd International Conference on Temporal Logic, pages 91--106, Manchester, July 1997.

....Bacchus and Kabanza, 1998] A work that considers extended goals in non deterministic domains is described in [Kabanza et al. 1997] see Section 6 for a comparison. Extended goals make the planning problem close to that of automatic synthesis of controllers (see, e.g. Asarin et al. 1995; Kupferman and Vardi, 1997] However, most of the work in this area focuses on the theoretical foundations, without providing practical implementations. Moreover, it is based on rather different technical assumptions on actions and on the interaction with the environment. ....

O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Proc. of 2nd International Conference on Temporal Logic, 1997.

....presents a method where model checking with timed automata is used to verify that generated plans meet timing constraints. Our work shares some ideas with work on the automata based synthesis of controllers (see, e.g. Pnueli Rosner, 1989; Vardi, 1995; Asarin et al. 1995; Maler et al. 1995; Kupferman Vardi, 1997 ] However, most of the work in this area focuses on the theoretical foundations, without providing practical implementations. Moreover, it is based on rather di erent technical assumptions on actions and on the interaction with the environment. Several reactive planners (e.g. Beetz ....

O. Kupferman and M. Vardi. Synthesis with incomplete information. In Proc. of 2nd International Conference on Temporal Logic, pages 91-106, 1997.

....Bacchus and Kabanza, 1998] A work that considers extended goals in non deterministic domains is described in [Kabanza et al. 1997] see Section 6 for a comparison. Extended goals make the planning problem close to that of automatic synthesis of controllers (see, e.g. Asarin et al. 1995; Kupferman and Vardi, 1997] However, most of the work in this area focuses on the theoretical foundations, without providing practical implementations. Moreover, it is based on rather different technical assumptions on actions and on the interaction with the environment. ....

O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Proc. of 2nd International Conference on Temporal Logic, 1997.

.... and Control 17 tion, then there is also a nite state controller that satis es the speci cation [15, 14, 22] There has also been work on centralized controller design with partial observation, where again it can be shown that existence of a controller implies existence of a nite state controller [24, 19, 8, 26]. The problem of decentralized control has been studied by many researchers in the discrete event systems community, e.g. see [11, 4, 20, 25, 7, 1, 16, 27] 11] study the problem of decentralized control with respect to local speci cations, e.g. two supervisors S 1 and S 2 are synthesized ....

O. Kupferman and M. Vardi, \Synthesis with Incomplete Information", ICTL 1997.

....the problem of synthesizing a program that satis es a given speci cation. These synthesis algorithms are based on the decision procedure for testing temporal satis ability proposed by Emerson and Clarke [7] and Manna and Wolper [8] Previous work on synthesizing fault tolerant programs includes [9 12]. In [9, 12] the authors assume that the fault cannot a ect the internal state of a process; the fault can interact only through input and output signals. By way of contrast [11] and this paper permits a more general model of faults, where faults can a ect the all variables of a process. Also, ....

....of synthesizing a program that satis es a given speci cation. These synthesis algorithms are based on the decision procedure for testing temporal satis ability proposed by Emerson and Clarke [7] and Manna and Wolper [8] Previous work on synthesizing fault tolerant programs includes [9 12] In [9, 12], the authors assume that the fault cannot a ect the internal state of a process; the fault can interact only through input and output signals. By way of contrast [11] and this paper permits a more general model of faults, where faults can a ect the all variables of a process. Also, our low ....

O. Kupferman and M. Vardi. Synthesis with incomplete information. ICTL, 1997.

....path quantifier of branching time temporal logic is essential in specifying the future behavior of failed processes. This objection to PLTL also applies to [PR89, PR89b] as well as [WD90] which solves essentially the same problem as [PR89, PR89b] but in a somewhat more general setting. Finally, KV97] presents a synthesis algorithm for reactive modules and CTL CTL specifications. Similarly to [PR89, PR89b] reactive modules communicate with the environment via input and output signals. 9 Since the environment cannot modify the internal state of the module, KV97] is not directly ....

....general setting. Finally, KV97] presents a synthesis algorithm for reactive modules and CTL CTL specifications. Similarly to [PR89, PR89b] reactive modules communicate with the environment via input and output signals. 9 Since the environment cannot modify the internal state of the module, KV97] is not directly applicable to the synthesis problem addressed in this paper. Nevertheless, since it does deal with branching time temporal logic, it might be possible to adapt or generalize the approach to deal with faults. 9 There are also unreadable inputs signals that the module cannot ....

[Article contains additional citation context not shown here]

O. Kupferman and M. Vardi, "Synthesis with incomplete information," ICTL 97.

No context found.

O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Advances in Temporal Logic, pages 109--127. Kluwer Academic Publishers, January 2000.

....[4] A future goal is to extend the planning task from the task of finding a plan which leads to a set of states (the goal) to the task of synthesizing a plan which satisfies some specifications in some temporal logic. This makes the planning task very close to controller synthesis (see, e.g. [1, 20]) which considers both exogenous events and non deterministic actions. From the controller synthesis perspective, in this paper we synthesize memoryless plans. Due to its generality, however, the work in [1, 20] does not allow for concise solutions as state action tables, and it is to be ....

....logic. This makes the planning task very close to controller synthesis (see, e.g. 1, 20] which considers both exogenous events and non deterministic actions. From the controller synthesis perspective, in this paper we synthesize memoryless plans. Due to its generality, however, the work in [1, 20] does not allow for concise solutions as state action tables, and it is to be investigated how it can express and deal with strong cyclic plans. 19] proposes an approach to planning that has some similarities to the work on synthesis but abandons completeness for computational efficiency. Most ....

O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Proc. of 2nd International Conference on Temporal Logic, pages 91--106, 1997.

No context found.

KUPFERMAN, O. AND VARDI, M. 1997. Synthesis with incomplete information.

No context found.

O. Kupferman and M. Y. Vardi. Synthesis with incomplete information, pages 109--128. Kluwer, 2000.

No context found.

O. Kupferman and M. Vardi, "Synthesis with Incomplete Information", ICTL 1997.

No context found.

O. Kupferman and M. Vardi, "Synthesis with Incomplete Information", ICTL 1997.

No context found.

O. Kupferman and M. Vardi. Synthesis with incomplete information. ICTL, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC