Moshe Y. Vardi, Pierre Wolper  Home/Search
Context Related
| rice.edu/~vardi/papers...focs83rj.ps.gz Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, 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 defined by alternating automata and show that they do not increase the... (Update)
Cited by: More
Fixed-Parameter Hierarchies inside PSPACE - Guoqiang Pan Department (Correct)
Deterministic Dynamic Monitors for Linear-Time Assertions - Armoni, Korchemny.. (2006) (Correct)
Automata-Theoretic Model Checking Revisited - Vardi (Correct)
Active bibliography (related documents): More All
1.0: Computation Paths Logic: An Expressive, yet Elementary.. - Harel, Singerman (1997) (Correct)
0.9: Dynamic Logic - Harel, Kozen, Tiuryn (1984) (Correct)
0.5: Markovian Analysis of Large Finite State Machines - Hachtel, Macii, Pardo, Somenzi (1996) (Correct)
Similar documents based on text: More All
0.6: Constructing Automata from Temporal Logic Formulas: A Tutorial - Wolper (Correct)
0.4: An Algorithmic Approach for Checking Closure Properties of .. - Peled, Wilke, Wolper (1995) (Correct)
0.3: The ForSpec Temporal Logic: A New Temporal.. - Armoni, Fix.. (2001) (Correct)
Related documents from co-citation: More All
52: An automata-theoretic approach to automatic program verification (context) - Vardi, Wolper - 1986
41: Checking that Finite State Concurrent Programs Satisfy their Linear Specificatio.. (context) - Lichtenstein, Pnueli - 1985
38: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
BibTeX entry: (Update)
M. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1--37, 1994. http://citeseer.ist.psu.edu/vardi94reasoning.html More
@article{ vardi94reasoning,
author = "Moshe Y. Vardi and Pierre Wolper",
title = "Reasoning About Infinite Computations",
journal = "Information and Computation",
volume = "115",
number = "1",
month = "15~",
pages = "1--37",
year = "1994",
url = "citeseer.ist.psu.edu/vardi94reasoning.html" }
Citations (may not include all citations):539 The Temporal Logic of Programs (context) - Pnueli - 1977
484 A Calculus of Communicating Systems (context) - Milner - 1980
434 An Automata-Theoretic Approach to Automatic Program Verifica.. (context) - Vardi, Wolper - 1986
374 Automata on Infinite Objects (context) - Thomas - 1990
362 Dynamic Logic - Harel - 1984
222 The Complexity of Propositional Linear Temporal Logic (context) - Sistla, Clarke - 1985
195 Propositional Dynamic Logic of Regular Programs (context) - Fischer, Ladner - 1979
190 Results on the Propositional -Calculus (context) - Kozen - 1983
177 Temporal Logic Can Be More Expressive (context) - Wolper - 1983
163 The Temporal Analysis of Fairness (context) - Gabbay, Pnueli et al. - 1980
162 Automata-Theoretic Techniques for Modal Logic of Programs (context) - Vardi, Wolper - 1986
157 Proving the Correctness of Multiprocess Programs (context) - Lamport - 1977
147 Real-time logics: complexity and expressiveness - Alur, Henzinger - 1990
128 Automatic verification of probabilistic concurrent finite-st.. (context) - Vardi - 1985
126 Semantical Considerations on Floyd-Hoare Logic - Pratt - 1976
116 Synthesis of Communicating Processes from Temporal Logic Spe.. (context) - Wolper - 1982
116 Synthesis of Communicating Processes from Temporal Logic spe.. (context) - Manna, Wolper - 1984
110 the Synthesis of a Reactive Module (context) - Pnueli, Rosner - 1989
103 The Glory of the Past (context) - Lichtenstein, Pnueli et al. - 1985
96 Finite Automata and their Decision Problems (context) - Rabin, Scott - 1959
81 The Complementation Problem for Buchi Automata with Applicat.. (context) - Sistla, Vardi et al. - 1987
71 A Really Abstract Concurrent Model and its Temporal Logic (context) - Barringer, Kuiper et al. - 1986
68 The Anchored Version of the Temporal Framework - Manna, Pnueli - 1989
66 A Temporal Fixpoint Calculus (context) - Vardi - 1988
59 Models of program logics (context) - Pratt - 1979
59 the relation of programs and computations to models of tempo.. (context) - Wolper - 1989
58 Characterizing Correctness Properties of Parallel Programs a.. (context) - Emerson, Clarke - 1981
57 Propositional Dynamic Logic of Looping and Converse is Eleme.. (context) - Streett - 1982
54 Space-bounded Reducibility among Combinatorial Problems (context) - Jones - 1975
53 Testing and Generating Infinite Sequences by a Finite Automa.. (context) - McNaughton - 1966
45 Deciding Full Branching Time Logic (context) - Emerson, Sistla - 1984
42 Finite Automata: Behavior and Synthesis (context) - Trakhtenbrot, Barzdin - 1973
34 Alternation (context) - Chandra, Kozen et al. - 1981
31 Lecture Notes in Computer Science (context) - Harel, Dynamic - 1979
29 Weak Monadic Second Order Theory of Successor is not Element.. (context) - Meyer - 1975
28 A Near-Optimal Method for Reasoning about Action (context) - Pratt - 1980
26 Weak Alternating Automata Give a Simple Explanation of Why M.. (context) - Muller, Saoudi et al. - 1988
25 Infinite Sequences and Finite Machines (context) - Muller - 1963
25 Application of Model-Theoretic Games to Discrete Linear Orde.. (context) - Ladner - 1977
24 Temporal Logic with Fixed Points (context) - Banieqbal, Barringer - 1989
20 Succinct Representation of Regular Languages by Boolean Auto.. (context) - Leiss - 1981
19 Yet Another Process Logic (context) - Vardi, Wolper - 1983
14 A Compositional Temporal Approach to a CSP-like Language (context) - Barringer, Kuiper et al. - 1985
9 Descriptively Complete Process Logic (context) - Nishimura - 1980
8 Propositional Dynamic Logic of Flowcharts (context) - Harel, Sherman - 1985
8 the Power of Bounded Concurrency III: Reasoning about Progra.. (context) - Harel, Rosner et al. - 1990
7 Non-elementary Word Problems in Automata and Logic (context) - Meyer, Stockmeyer - 1973
6 Using Graphs to Understand PDL (context) - Pratt - 1982
5 Process Logic: Expressiveness, Decidability, Completeness - Harel, Kozen et al. - 1982
5 Theoretical Issues in The Design and Analysis of Distributed.. (context) - Sistla - 1983
4 Temporal Logic in Specification (context) - Banieqbal, Barringer et al. - 1989
4 On Equations for Regular Languages, Finite Automata, and Seq.. (context) - Brzozowski, Leiss - 1980
4 Process logic with Regular Formulas (context) - Harel, Peleg - 1985
4 the Complexity of !-Automata (context) - Safra - 1988
3 Nondeterminism in Logics of Programs (context) - Harel, Pratt - 1978
2 Looping vs. Repeating in Dynamic Logic (context) - Harel, Sherman - 1982
2 Software Specification Languages Based on Regular Expression.. (context) - Shaw - 1979
2 Theories of Automata on !-Tapes: A Simplified Approach (context) - Choueka - 1974
1 Regular Sets (context) - Wagner - 1979
1 Decision Problems for !-Automata (context) - Landweber - 1969
1 Research in the Theory of !-Languages (context) - Staiger - 1987
1 The Propositional Dynamic Logic of Deterministic, Well-Struc.. (context) - Halpern, Reif - 1983
1 Accepting Conditions for Automata on !- Languages (context) - Moriya, Yamusaki - 1988
1 Alternating Automata on !-Words (context) - Miyano, Hayashi - 1984
1 A Classification of !-Regular Languages (context) - Kaminski - 1985
1 The Taming of the Converse: Reasoning about 2-way Computatio.. (context) - Vardi - 1985
1 Star-Free Regular Sets of !-Sequences (context) - Thomas - 1979
1 A Combinatorial Approach to the Theory of !-Automata (context) - Thomas - 1981
1 personal communication (context) - Streett
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)
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