E.A. Emerson and J.Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30:1--24, 1985. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Advances in Finite Automata and Temporal Logic for System.. - Torre (1999) (Correct)
Oracle Circuits for Branching-Time Model Checking - Schnoebelen (2003) (1 citation) (Correct)
Dynamic Logic - Harel, Kozen, Tiuryn (1984) (356 citations) (Correct)
A Model Checker for Linear Time Temporal Logic - Fisher (1992) (4 citations) (Correct)
The Complexity of Temporal Logic Model Checking - Schnoebelen (2002) (2 citations) (Correct)
Branching-Time Logic Programming: The Language.. - Rondogiannis.. (1997) (Correct)
A Complete Deductive System for the µ-Calculus - Walukiewicz (1995) (Correct)
Focus Games for Satisfiability and Completeness of Temporal.. - Lange, Stirling (2001) (1 citation) (Correct)
Formal Design of Reliable Real Time Systems - Gregersen, al. (1995) (4 citations) (Correct)
The ForSpec Temporal Logic: A New Temporal.. - Armoni, Fix.. (2001) (4 citations) (Correct)
A Complete Deductive System for the µ-Calculus - Walukiewicz (1993) (1 citation) (Correct)
A Complete Axiomatization of a First-Order Temporal Logic.. - Penczek, Srebrny (1996) (Correct)
Temporal Logics of Computations - Introductory Course - Goranko (2000) (Correct)
Temporal Logics of Computations - Introductory Course - Goranko (2000) (Correct)
Model Checking for a Probabilistic Branching Time Logic With .. - Baier, Kwiatkowska (1998) (35 citations) (Correct)
Comparing Tableaux, Automata and Games for Modal and Temporal.. - Lange (2001) (Correct)
An n! Lower Bound On Formula Size - Adler, Immermann (1999) (8 citations) (Correct)
Why Are Modal Logics So Robustly Decidable? - Grädel (Correct)
Focus Games for Satisfiability and Completeness of Temporal Logic - Colin (2001) (1 citation) (Correct)
Model Checking Games for Branching Time Logics - Lange, Stirling (2000) (Correct)
The Management of Data, Events, and Information Presentation for.. - Hasan (1996) (Correct)
Model checking CTL+ and FCTL is hard - Laroussinie, Markey, Schnoebelen (2001) (1 citation) (Correct)
Branching vs. Linear Time: Final Showdown - Vardi (2001) (1 citation) (Correct)
A Survey of Temporal Extensions of Description Logics - Artale, Franconi (2000) (6 citations) (Correct)
Model checking CTL+ is hard - Laroussinie, Markey, Schnoebelen (2000) (Correct)
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
The Bulletin of Symbolic Logic - Volume Number June (Correct)
Temporal Approach to Causal - Knowledge Wojciech Penczek (Correct)
TEMPORAL LOGICS OF COMPUTATIONS - Introductory course - Goranko (2000) (Correct)
TEMPORAL LOGICS OF COMPUTATIONS - Introductory course - Goranko (2000) (Correct)
An Axiomatization of Prior's Ockhamist Logic of Historical.. - Reynolds (2003) (Correct)
The Complexity of Temporal Logic Model Checking - Schnoebelen (2003) (2 citations) (Correct)
CTL+ Is Exponentially More Succinct Than CTL - Wilke (1999) (1 citation) (Correct)
CTL+ Is Exponentially More Succinct Than CTL - Wilke (1999) (1 citation) (Correct)
Focus Games for Satisfiability and Completeness of Temporal.. - Martin Lange Colin (2001) (1 citation) (Correct)
BTL2 and expressive completeness for ECTL+ - Rabinovich, Schnoebelen (2000) (Correct)
Model Theoretic Syntax and Parsing: An Application to Temporal Logic - Palm (2001) (Correct)
The Logic of Distributed Protocols - Preliminary Report Richard (Correct)
Symbolic Model Checking of Non-Regular Properties - Lange (2004) (Correct)
Decidable Fragments of First-Order and Fixed-Point Logic - From.. - Grädel (2003) (Correct)
Model Theoretic Syntax and Parsing: An Application to Temporal Logic - Palm (2001) (Correct)
Search Techniques and Automata for Symbolic Model Checking - Bloem (2001) (Correct)
CTL+ is Complete for Double Exponential Time - Lange (2003) (Correct)
is Complete for Double Exponential Time Jan Johannsen and .. - Institut Ur Informatik (Correct)
A Local Approach to Modal Logic for Multi-Agent Systems - Penczek (2001) (Correct)
The Complexity of Reasoning about Knowledge and Time.. - Halpern, Vardi (1989) (75 citations) Self-citation (Halpern) (Correct)
The Complexity of Reasoning about Knowledge and Time. I. Lower .. - Halpern, Vardi (1989) (75 citations) Self-citation (Halpern) (Correct)
Ameliorating the State Space Explosion Problem - Namjoshi (1998) (3 citations) Self-citation (Emerson) (Correct)
Reasoning about Rings - Emerson, Namjoshi (1995) (31 citations) Self-citation (Emerson) (Correct)
Automated Temporal Reasoning about Reactive Systems - Emerson (1996) (38 citations) Self-citation (Emerson) (Correct)
First 50 documents Next 50
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