Orna Kupferman, Moshe Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/papers/ictl97.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should... (Update)
Similar documents based on text: More All
0.5: Weak Alternating Automata Are Not That Weak - Kupferman, Vardi (1997) (Correct)
0.5: Vacuity Detection in Temporal Model Checking - Kupferman, Vardi (1999) (Correct)
0.4: Modular Model Checking - Kupferman, Vardi (1998) (Correct)
Related documents from co-citation: More All
6: the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
5: Temporal and modal logic (context) - Emerson - 1990
4: Universal plans of reactive robots in unpredictable environments - Schoppers - 1987
BibTeX entry: (Update)
O. Kupferman and M. Vardi, "Synthesis with incomplete information," ICTL 97. http://citeseer.ist.psu.edu/kupferman97synthesis.html More
@misc{ kupferman-synthesis,
author = "O. Kupferman and M. Vardi",
title = "Synthesis with incomplete information",
text = "O. Kupferman and M. Vardi, Synthesis with incomplete information, ICTL
97.",
url = "citeseer.ist.psu.edu/kupferman97synthesis.html" }
Citations (may not include all citations):198 Trace theory for automatic hierarchical verification of spee.. (context) - Dill - 1989
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
162 Automata-theoretic techniques for modal logics of programs (context) - Vardi, Wolper - 1986
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
120 Handbook of theoretical computer science (context) - Emerson, modal - 1990
114 The temporal semantics of concurrent programs (context) - Pnueli - 1981
110 the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
94 A deductive approach to program synthesis (context) - Manna, Waldinger - 1980
58 Alternating automata on infinite trees (context) - Muller, Schupp - 1987
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
52 Modeling and control of logical discrete event systems (context) - Kumar, Garg - 1995
49 Solving sequential conditions by finite-state strategies (context) - Buchi, HG - 1969
45 Deciding full branching time logics (context) - Emerson, Sistla - 1984
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
36 Weakly definable relations and special automata (context) - Rabin - 1970
30 Supervisory control of nondeterministic systems under partia.. - Kumar, Shayman - 1995
26 Using branching time logic to synthesize synchronization ske.. (context) - Emerson, Clarke - 1982
26 Realizable and unrealizable concurrent program specification.. (context) - Abadi, Lamport et al. - 1989
21 Distributed reactive systems are hard to synthesize (context) - Pnueli, Rosner - 1990
16 An automata-theoretic approach to fair realizability and syn.. - Vardi - 1995
11 Modular Synthesis of Reactive Systems (context) - Rosner - 1992
6 Synthesis and verification of discrete controllers for robot.. (context) - Antoniotti - 1995
4 Simulating aternating tree automata by nondeterministic auto.. (context) - Muller, Schupp - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
A New Heuristic for Bad Cycle Detection Using BDDs - Hardin, Kurshan, Shukla, Vardi (1997) (Correct)
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