Moshe Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/papers/cade97.ps.gz cornell.edu/kozen/686/Vardi...cade97.ps 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: . We describe an automata-theoretic approach to the automated checking of truth and validity for temporal logics. The basic idea underlying this approach is that for any formula we can construct an alternating automaton that accepts precisely the models of the formula. For linear temporal logics the automaton runs on infinite words while for branching temporal logics the automaton runs on infinite trees. The simple combinatorial structures that emerge from the automata-theoretic approach... (Update)
Similar documents based on text: More All
0.2: Infinitary Logic and Inductive Definability over Finite.. - Dawar, Lindell (1995) (Correct)
0.2: An Automata-Theoretic Approach to Reasoning about.. - Kupferman, Vardi (2000) (Correct)
0.2: CTL^+ Is Exponentially More Succinct Than CTL - Wilke (1999) (Correct)
Related documents from co-citation: More All
2: An Automata-Theoretic Approach to Reasoning about Innite-State Systems - Kupferman, Vardi - 2000
2: Decidability of Model Checking with the Temporal Logic EF - Mayr
2: A model for recursive-parallel programs - Kouchnarenko, Schnoebelen - 1996
BibTeX entry: (Update)
M.Y. Vardi. Alternating automata: Checking truth and validity for temporal logics. In Proceedings of CADE'97, 1997. http://citeseer.ist.psu.edu/vardi97alternating.html More
@inproceedings{ vardi97alternating,
author = "Moshe Y. Vardi",
title = "Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics",
booktitle = "Proceedings of the 14th International Conference on Automated deduction",
volume = "1249",
month = "~13--17",
publisher = "Springer",
address = "Berlin",
editor = "William McCune",
isbn = "3-540-63104-6",
pages = "191--206",
year = "1997",
url = "citeseer.ist.psu.edu/vardi97alternating.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
379 The complexity of relational query languages (context) - Vardi - 1982
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
221 Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
162 Automata-theoretic 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
127 An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
120 Handbook of Theoretical Computer Science (context) - Emerson, modal - 1990
120 Handbook of theoretical computer science (context) - Emerson, modal - 1990
112 Memory efficient algorithms for the verification of temporal.. - Courcoubetis, Vardi et al. - 1992
106 A linear-time model-checking algorithm for the alternation-f.. - Cleaveland - 1993
103 The glory of the past (context) - Lichtenstein, Pnueli et al. - 1985
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993
100 mu-calculus and determinacy (context) - Emerson, Jutla - 1991
84 Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
75 Modalities for model checking: Branching time logic strikes .. (context) - Emerson, Lei - 1985
71 Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
66 Model checkingand modular verification - Grumberg, Long - 1994
59 the relation of programs andcomputations to models of tempor.. (context) - Wolper - 1989
58 Alternating automata on infinite trees (context) - Muller, Schupp - 1987
53 theorem proving: a manifesto (context) - Halpern, Vardi et al. - 1991
47 Avoiding the state explosion problem in temporal logic model.. (context) - Clarke, Grumberg - 1987
46 Journal of the Association for Computing Machinery (context) - Chandra, Kozen et al. - 1981
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
40 the weak monadic theory of the tree and its complexity (context) - Muller, Saoudi et al. - 1986
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
36 Weakly definable relations and special automata (context) - Rabin - 1970
30 Simulating alternating tree automata by nondeterministic aut.. (context) - Muller, Schupp - 1995
26 Weak alternating automata give a simple explanation of why m.. (context) - Muller, Saoudi et al. - 1988
25 Deciding branching time logic (context) - Emerson, Sistla - 1984
25 Protocol engineering (context) - Liu - 1989
25 Temporal model checking under generalized fairness constrain.. (context) - Emerson, Lei - 1985
25 and temporal logics (context) - Emerson, tableaux - 1985
24 Theoretical Computer Science (context) - Miyano, Hayashi et al. - 1984
20 the complexity of omega-automata (context) - Safra - 1988
18 Nontraditional applications of automata theory - Vardi - 1994
15 Complementation is more difficult with automata on infinite .. (context) - Michel - 1988
14 The propositional mu-calculus is elementary (context) - Streett, Emerson - 1984
14 Network protocols and tools to help produce them (context) - Rudin - 1987
13 Alternating automata and program verification - Vardi - 1996
6 Computer and System Sciences (context) - Choueka, automata et al. - 1974
5 regular languages and propositional temporal logic (context) - Peikert - 1985
5 Theoretical issues in the design and analysis of distributed.. (context) - Sistla - 1983
2 Weak alternating automata are not so weak (context) - Kupferman, Vardi - 1997
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