Colin Stirling  Home/Search
Context Related
| i2.informatik.rwth...irling__mfit.ps.gz dcs.ed.ac.uk/home/cps/mfit.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) From: i2.informatik.rwthaachen.d...lit (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction 2 2 Process Calculi 2 3 Equivalences, Modal and Temporal Logics 5 3.1 Interactive games and bisimulations . . . . . . . . . . . . . . . 7 3.2 Modal logic and bisimulations . . . . . . . . . . . . . . . . . . . 9 3.3 Temporal properties and modal mu-calculus . . . . . . . . . . 10 3.4 Second-order propositional modal logic . . . . . . . . . . . . . . 15 3.5 Fixed point and second-order games . . . . . . . . . . . . . . . 16 4 Property Checking and Games 19 4.1... (Update)
Context of citations to this paper: More
.... used to generate examples (witnesses) and counterexamples for Ctl formulas [6,7] in tools like Smv [21] Recently, game based techniques [25] have been applied to verify modal calculus [16] formulas and to interactively generate diagnostics, in tools like the Edinburgh...
Cited by: More
Efficient Diagnostic Generation for Boolean Equation Systems - Mateescu (2000) (Correct)
Similar documents (at the sentence level): More
54.7%: Bisimulation, Model Checking and Other Games - Stirling (Correct)
17.9%: Bisimulation, Modal Logic and Model Checking Games - Stirling (1999) (Correct)
13.5%: Games and Modal Mu-Calculus - Stirling (1996) (Correct)
Active bibliography (related documents): More All
0.3: Boolean Games - Harrenstein, van der Hoek, Meyer.. (Correct)
0.2: Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
0.2: Weak Alternating Automata Are Not That Weak - Kupferman, Vardi (1997) (Correct)
Similar documents based on text: More All
0.1: O-Minimal Hybrid Systems - Gerardo Lafferriere, George J.. (1998) (Correct)
0.1: Subanalytic Stratifications and Bisimulations - Lafferriere, Pappas, Sastry (1998) (Correct)
0.1: Hybrid Systems With Finite Bisimulations - Lafferriere, PAPPAS, SASTRY (1998) (Correct)
BibTeX entry: (Update)
C. Stirling. Bisimulation, model checking and other games. In Notes for Matht instructional meeting on games and computation, Edinburgh, June 1997. http://citeseer.ist.psu.edu/stirling96model.html More
@unpublished{ stirling96model,
author = "Colin Stirling",
title = "Model Checking and Other Games",
year = "1996",
url = "citeseer.ist.psu.edu/stirling96model.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
357 Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985
206 Results on the propositional mu-calculus (context) - Kozen - 1983
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
130 Efficient model checking in fragments of the propositional m.. (context) - Emerson, Lei - 1986
127 An automatatheoretic approach to branching-time model checki.. - Bernholtz, Vardi et al. - 1994
102 Bisimulation equivalence is decidable for all context-free p.. - Christensen, uttel et al. - 1995
60 An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989
60 Modal and temporal logics for processes - Stirling - 1996
49 Model Theory (context) - Hodges - 1993
49 On monadic NP vs monadic co-NP (context) - Fagin, Stockmeyer et al. - 1995
47 Local model checking games (context) - Stirling - 1995
37 An improved algorithm for the evaluation of fixpoint express.. - Long, Browne et al. - 1994
36 Model checking and boolean graphs (context) - Andersen - 1994
34 Verifying temporal properties of processes (context) - Bradfield, Stirling - 1990
33 Local model checking for infinite state spaces (context) - Bradfield, Stirling - 1992
32 Decidability of bisimulation equivalence for normed pushdown.. - Stirling - 1996
23 The modal mu-calculus alternation hierarchy is strict (context) - Bradfield - 1996
20 On model checking for fragments of ¯-calculus (context) - Emerson, Jutla et al. - 1993
17 Lecture Notes in Computer Science (context) - Emerson - 1985
17 A compositional proof system for the modal mu-calculus (context) - Andersen, Stirling et al. - 1994
15 The complexity of stochastic games - Condon - 1992
13 A subexponential randomized algorithm for the simple stochas.. (context) - Ludwig - 1995
11 Bisimulation is decidable for basic parallel processes (context) - Christensen, Hirshfeld et al. - 1993
10 the Ehrenfeucht-Fra ss e game in theoretical computer scienc.. (context) - Thomas - 1993
9 and model checking of pushdown processes (context) - Burkart, Steffen - 1995
9 Games and modal mu-calculus - Stirling - 1996
6 Relational queries computable in polynomial time (context) - Immermann - 1986
5 On modal mu-calculus and B uchi tree automata (context) - Kaivola - 1995
4 Alternating automata (context) - Muller, Saoudi et al. - 1986
2 Lecture Notes in Computer Science (context) - Nielsen, Clausen - 1994
2 Model checking in the modal ¯-calculus by substitutions (context) - Karlokoti - 1996
1 Ehrenfeucht-Fra ss e game (context) - Bosse - 1992
1 the complexity of bound-variable queries (context) - Vardi - 1995
1 The complexity of mean payoff games (context) - Zwick, Paterson - 1995
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)
Descriptive Complexity and Finite Models - Immerman, Kolaitis, (Eds.) (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