Damian Niwinski, Igor Walukiewicz  Home/Search
Context
Related
| i2.informatik.rwth..._mu_calculus.ps.gz mimuw.edu.pl/~igw/games.ps 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: i2.informatik.rwthaachen.d...lit (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a formula of the propositional ¯-calculus, we construct a tableau of the formula and define an infinite game of two players of which one wants to show that the formula is satisfiable, and the other seeks the opposite. The strategy for the first player can be further transformed into a model of the formula while the strategy for the second forms what we call a refutation of the formula. Using Martin's Determinacy Theorem, we prove that any formula has either a model or a refutation. This... (Update)
Similar documents (at the sentence level):
5.9%: A Complete Deductive System for the µ-Calculus - Walukiewicz (1993) (Correct)
Active bibliography (related documents): More All
0.7: Notes on the Propositional µ-calculus: Completeness and Related .. - Walukiewicz (1995) (Correct)
0.5: On the Synthesis of Strategies in Infinite Games - Thomas (1995) (Correct)
0.1: Fixed Point Characterization of Infinite Behavior of Finite.. - Niwinski (1996) (Correct)
Similar documents based on text: More All
0.3: A Gap Property of Deterministic Tree Languages - Niwinski, Walukiewicz (Correct)
0.2: Relating hierarchies of word and tree automata (Extended.. - Niwinski, Walukiewicz (Correct)
0.2: A Total AC-Compatible Reduction Ordering on Higher-Order Terms - Walukiewicz (Correct)
BibTeX entry: (Update)
@misc{ niwinski-games,
author = "Damian Niwinski and Igor Walukiewicz",
title = "Games for the µ-Calculus",
url = "citeseer.ist.psu.edu/57195.html" }
Citations (may not include all citations):374 Automata on infinite objects (context) - Thomas - 1990
206 Results on the propositional mu-calculus (context) - Kozen - 1983
195 Propositional dynamic logic of regular programs (context) - Fisher, Ladner - 1979
137 Local model checking in the modal mu-calculus (context) - Stirling, Walker - 1991
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
100 mu calculus and determinacy (context) - Allen, Jutla - 1991
58 Characterizing correctness properties of parallel programs u.. (context) - Emerson, Clark - 1980
51 Descriptive Set Theory (context) - Moschovakis - 1980
34 Borel determinacy (context) - Martin - 1975
31 An elementary proof of the completeness of the PDL (context) - Kozen, Parikh - 1981
16 automata and games (context) - Gurevich, Harrington - 1982
13 On simultaneously determinizing and complementing (context) - Emerson, Jutla - 1989
6 An automata theoretic procedure for the propositional mu-cal.. (context) - Street, Emerson - 1989
2 Games on infinite trees and automata with dead ends (context) - Muchnik - 1984
2 to appear in LNCS (context) - Stirling, teporal et al.
1 Fixpoint inductinon and proof of program semantics (context) - Park - 1970
1 CTL and ECTL as a fragments of the modal ¯-calculus (context) - Dam - 1992
1 Gentzen-type axiomatization for pal (context) - Walukiewicz - 1993
Documents on the same site (http://www-i2.informatik.rwth-aachen.de/leucker/Literatur/lit.html): More
Implementation of an Efficient Parallel BDD Package - Stornetta (1995) (Correct)
Composing the user interface with Haggis - Finne, Jones (1996) (Correct)
Model Checking and Other Games - Stirling (1996) (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