Colin Stirling  Home/Search
Context
Related
| dcs.ed.ac.uk/home/cps/mathfit.ps i2.informatik.rwth...rling__games.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: 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 6 3.1 Interactive games and bisimulations . . . . . . . . . . . . . . . 8 3.2 Modal logic and bisimulations . . . . . . . . . . . . . . . . . . . 13 3.3 Temporal properties and modal mu-calculus . . . . . . . . . . 15 3.4 Second-order propositional modal logic . . . . . . . . . . . . . . 21 4 Property Checking and Games 22 4.1 Subformulas and subsumption . . . . . . . . . . . . . . . . . . 24 4.2... (Update)
Similar documents (at the sentence level):
45.8%: Model Checking and Other Games - Stirling (1996) (Correct)
29.6%: Bisimulation, Modal Logic and Model Checking Games - Stirling (1999) (Correct)
12.3%: Modal and Temporal Logics for Processes - Stirling (1996) (Correct)
Active bibliography (related documents): More All
0.5: Games and Modal Mu-Calculus - Stirling (1996) (Correct)
0.2: The Joys of Bisimulation - Stirling (1998) (Correct)
0.2: Modal Logics and Mu-Calculi: An Introduction - Bradfield, Stirling (2001) (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)
@misc{ stirling-bisimulation,
author = "Colin Stirling",
title = "Bisimulation, Model Checking and Other Games",
url = "citeseer.ist.psu.edu/87376.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
502 Concurrency and automata on infinite sequences (context) - Park - 1981
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 automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
102 Bisimulation equivalence is decidable for all context-free p.. - Christensen, uttel et al. - 1995
78 the synthesis of strategies in infinite games - Thomas - 1995
74 Correspondence theory (context) - van Benthem - 1984
60 An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989
60 Modal and temporal logics for processes - Stirling - 1996
47 Local model checking games (context) - Stirling - 1995
46 Infinite games played on finite graphs (context) - McNaughton - 1993
38 the expressive completeness of the propositional mu-calculus.. - Janin, Walukiewicz - 1996
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
18 Verification of modal properties using boolean equation syst.. (context) - Mader - 1997
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
10 On polynomial-size programs winning finite-state games - Lescow - 1995
9 Games and modal mu-calculus - Stirling - 1996
9 and model checking of pushdown processes (context) - Burkart, Steffen - 1995
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 Model checking in the modal ¯-calculus by substitutions (context) - Karlokoti - 1996
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