Orna Kupferman Bell Laboratories Shmuel Safra Tel Aviv University Moshe Y....  Home/Search
Context Related
| rice.edu/~vardi/papers...lics96r1.ps.gz From: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's, it was known that deterministic Buchi word automata are less expressive than nondeterministic Buchi word automata. The proof is easy and can be stated in a few lines. In the late 60's, Rabin proved that Buchi tree automata are less expressive than Rabin tree automata. This proof is much harder.... (Update)
Context of citations to this paper: More
.... Path(L) However, we may a priori hope that using nondeterminism in some clever way we can simplify the automaton for Path(L) In [6], Kupferman, Safra and Vardi investigated this question and showed a result that refutes such a hope in a special case of Buchi...
.... tree automata (this is beacause the latter coincides with the hierarchy of deterministic word automata [Wag79,Kam85] and is proven in [KSV96,DJW97,Niw97,NW98] by means of languages that can be recognized by loose tree automata) It follows that the expressiveness hierarchy in...
Cited by: More
Fair Equivalence Relations - Orna Kupferman And (Correct)
Tree Extension Algebras: Logics, Automata, and Query Languages - Benedikt, Libkin (Correct)
Relating Hierarchies of Word and Tree Automata - Niwinski, Walukiewicz (1998) (Correct)
Similar documents (at the sentence level):
38.9%: Relating Word and Tree Automata - Kupferman, Safra, Vardi (2004) (Correct)
Active bibliography (related documents): More All
0.2: Verification of Fair Transition Systems - Kupferman, Vardi (1996) (Correct)
0.1: Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
0.1: A Theory of Timed Automata - Alur, Dill (1994) (Correct)
Similar documents based on text: More All
0.4: Safraless Decision Procedures - Orna Kupferman Hebrew (Correct)
0.3: Weak Alternating Automata Are Not That Weak - Kupferman, Vardi (1997) (Correct)
0.3: Synthesizing Distributed Systems - Kupferman, Vardi (2001) (Correct)
Related documents from co-citation: More All
4: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
4: Weakly definable relations and special automata (context) - Rabin - 1970
3: The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
BibTeX entry: (Update)
O. Kupferman, S. Safra, and M.Y. Vardi. Relating word and tree automata. In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 322--333, DIMACS, June 1996. http://citeseer.ist.psu.edu/article/kupferman96relating.html More
@inproceedings{ kupferman96relating,
author = "Orna Kupferman and Shmuel Safra and Moshe Y. Vardi",
title = "Relating Word and Tree Automata",
booktitle = "Logic in Computer Science",
pages = "322-332",
year = "1996",
url = "citeseer.ist.psu.edu/article/kupferman96relating.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
725 Temporal and modal logic (context) - Emerson - 1990
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automatatheoretic approach to automatic program verificat.. (context) - Vardi, Wolper - 1986
374 Automata on infinite objects (context) - Thomas - 1990
267 Computer-Aided Verification of Coordinating Processesl (context) - Kurshan - 1994
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
176 a decision method in restricted second order arithmetic (context) - Buchi - 1962
162 Automatatheoretic techniques for modal logics of programs (context) - Vardi, Wolper - 1986
139 Reasoning about infinite computations - Vardi, Wolper - 1994
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996
127 An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
116 Synthesis of Communicating Processes from Temporal Logic Spe.. (context) - Wolper - 1982
100 mu-calculus and determinacy (context) - Emerson, Jutla - 1991
81 Generalized finite automata theory with an application to a .. (context) - Thatcher, Wright - 1968
71 Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
53 Testing and generating infinite sequences by a finite automa.. (context) - McNaughton - 1966
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985
26 Expressibility results for linear-time and branching-time lo.. (context) - Clarke, Draghicescu - 1988
25 Deciding branching time logic (context) - Emerson, Sistla - 1984
25 and temporal logics (context) - Emerson, tableaux - 1985
14 Mathematical Systems Theory (context) - Landweber, for et al. - 1969
9 How linear can branching-time be (context) - Grumberg, Kurshan - 1994
7 Complementing deterministic Buchi automata in polynomial tim.. (context) - Kurshan - 1987
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)
Synthesis with Incomplete Information - Kupferman, 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