Martin Lange  Home/Search
Context
Related
| dcs.ed.ac.uk/home/ma...esslli2001.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: dcs.ed.ac.uk/home/martin/lit (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: , Fit83, Rau79] and automata [Tho90, VW86b] are the well established ones. There also are games [GS53, McN93] which sometimes are regarded as either special automata or extended tableaux. Other methods, like resolution [Fis91] for instance will not receive any attention in the following because they do not seem to attract a lot of research interest. Since all these logics contain basic modal logic in some way, disjunction, conjunction, negation, and modalities are present. Furthermore, most... (Update)
Active bibliography (related documents): More All
1.0: Satisfiability and Completeness of PDL replayed - Lange, Stirling (2001) (Correct)
0.6: Logics for Mazurkiewicz Traces - Leucker (2002) (Correct)
0.4: Satisfiability and Completeness of Converse-PDL Replayed - Lange (2003) (Correct)
Similar documents based on text:
0.3: Focus Games for Satisfiability and Completeness of Temporal.. - Lange, Stirling (2001) (Correct)
0.1: Games for Modal and Temporal Logics - Lange (2002) (Correct)
BibTeX entry: (Update)
@misc{ lange-comparing,
author = "Martin Lange",
title = "Comparing Tableaux, Automata and Games for Modal and Temporal Logics (Extended
Abstract)",
url = "citeseer.ist.psu.edu/lange01comparing.html" }
Citations (may not include all citations):539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
374 Automata on infinite objects (context) - Thomas - 1990
258 A lattice-theoretical fixpoint theorem and its application (context) - Tarski - 1955
206 Results on the propositional mu-calculus (context) - Kozen - 1983
202 Modal and temporal logics (context) - Stirling - 1992
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
176 a decision method in restricted second order arithmetic (context) - Buchi - 1962
162 Automata-theoretic techniques for modal logic of programs (context) - Vardi, Wolper - 1986
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
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
122 Synthesis of synchronization skeletons for branching time te.. (context) - Clarke, Emerson - 1981
119 Using branching time temporal logic to synthesize synchroniz.. (context) - Emerson, Clarke - 1982
84 Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985
72 Tableau-based model checking in the propositional mu-calculu.. - Cleaveland - 1990
66 revisited: On branching versus linear time temporal logic (context) - Emerson, Halpern et al. - 1986
60 An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989
57 Propositional dynamic logic of looping and converse is eleme.. (context) - Streett - 1982
56 A resolution method for temporal logic - Fisher - 1991
47 Untersuchungen uber das Logische Schliessen (context) - Gentzen - 1935
47 Local model checking games (context) - Stirling - 1995
46 Infinite games played on finite graphs (context) - McNaughton - 1993
45 Deciding full branching time logic (context) - Emerson, Sistla - 1984
42 A completeness theorem in modal logic (context) - Kripke - 1959
22 On Padoa's method in the theory of definition (context) - Beth - 1953
21 Tableau methods for modal and temporal logics - Gore - 1999
19 Practical model checking using games - Stevens, Stirling - 1998
19 A practical decision method for propositional dynamic logic (context) - Pratt - 1978
15 Klassische und nichtklassische Aussagenlogik (context) - Rautenberg - 1979
13 tableaux and temporal logics (context) - Emerson - 1985
10 the Ehrenfeucht-Frasse game in theoretical computer science (context) - Thomas - 1993
10 An axiomatization of full computation tree logic (context) - Reynolds - 2000
9 Algebraic laws for indeterminism and concurrency (context) - Hennessy, Milner - 1985
9 Truth -- a verification platform for concurrent systems - Lange, Leucker et al. - 1999
8 Combining deduction and model checking into tableaux and alg.. - de Giacomo, Massacci
6 Proof Methods for Modal and Intutionistic Logics (context) - Fitting - 1983
5 Focus games for satisfiability and completeness of temporal .. - Lange, Stirling - 2001
3 Infinite games of perfect information (context) - Gale, Stewart - 1953
3 Branching-time temporal logic and tree automata - Kupferman, Grumberg - 1996
3 model checking: Should SPIN be extended (context) - Visser, Barringer - 2000
2 Model checking games for CTL (context) - Lange, Stirling - 2000
2 Complementation of Buchi automata revisited (context) - Thomas - 1999
1 Satisfiability and completeness of PDL replayed - Lange, Stirling - 2001
Documents on the same site (http://www.dcs.ed.ac.uk/home/martin/lit.htm): More
A Game Based Approach to CTL* Model Checking - Lange (2000) (Correct)
Model Checking Games for CTL* - Lange, Stirling (2000) (Correct)
Satisfiability and Completeness of PDL replayed - Lange, Stirling (2001) (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