## Practical Model-Checking Using Games (1998)

Venue: | Lecture |

Citations: | 29 - 0 self |

### BibTeX

@INPROCEEDINGS{Stevens98practicalmodel-checking,

author = {Perdita Stevens and Colin Stirling},

title = {Practical Model-Checking Using Games},

booktitle = {Lecture},

year = {1998},

pages = {85--101},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We describe how model-checking games can be the foundation for efficient local model-checking of the modal mu-calculus on transition systems. Game-based algorithms generate winning strategies for a certain game, which can then be used interactively to help the user understand why the property is or is not true of the model. This kind of feedback has advantages over traditional techniques such as error traces. We give a proof technique for verifying such algorithms, and apply it to one which we have implemented in the Edinburgh Concurrency Workbench. We discuss its usability and performance. 1 Introduction The modal mu-calculus (see e.g. [9]) is an expressive logic which can be used to describe properties of systems modelled as labelled transition systems (LTSs). The problem of model-checking the mu-calculus on transition systems is that of deciding whether an LTS satisfies a formula. Many model-checking algorithms have been developed and implemented in tools. One such tool ...

### Citations

3203 | Communication and concurrency - Milner - 1989 |

299 | An automata-theoretic approach to branchingtime model checking
- Bernholtz, Vardi, et al.
- 1994
(Show Context)
Citation Context ...ame. This can be seen as a reformulation of tableau-based approaches such as [10]: a (history-free) winning strategy looks very much like a successful (canonical) tableau. The work is also related to =-=[2]-=- and methods in [3]. The history-free winning strategy, whose size is linear in the size of the problem, that is, in the product of the number of states of the model and the number of subformulae of t... |

103 |
Local model checking in the modal mu-calculus
- Stirling, Walker
- 1991
(Show Context)
Citation Context ... which the truth of a formula at a state is equivalent to the existence of a (historyfree) winning strategy for a certain game. This can be seen as a reformulation of tableau-based approaches such as =-=[10]-=-: a (history-free) winning strategy looks very much like a successful (canonical) tableau. The work is also related to [2] and methods in [3]. The history-free winning strategy, whose size is linear i... |

81 |
Model checking and boolean graphs
- Andersen
- 1994
(Show Context)
Citation Context ...th the model. On the theoretical side, we also find thinking in terms of games helpful: it seems to expose the structure and duality of the problem well. An alternative approach is via Boolean graphs =-=[1]-=- or equation systems [5]: indeed Mader has demonstrated the equivalence of Boolean equation systems and the modelchecking problem. We first briefly describe the basic model-checking game, and we intro... |

76 |
Local model checking games
- Stirling
- 1995
(Show Context)
Citation Context ...al introduction to the mu-calculus and its use: here we assume familiarity with it. We write oeZ: \Phi for "either Z: \Phi or Z: \Phi". A closed formula contains no free variables. Recently =-=Stirling ([8]-=-) has developed a theory of model-checking games in which the truth of a formula at a state is equivalent to the existence of a (historyfree) winning strategy for a certain game. This can be seen as a... |

69 | Modal and temporal logics for processes
- Stirling
- 1996
(Show Context)
Citation Context ...rifying such algorithms, and apply it to one which we have implemented in the Edinburgh Concurrency Workbench. We discuss its usability and performance. 1 Introduction The modal mu-calculus (see e.g. =-=[9]-=-) is an expressive logic which can be used to describe properties of systems modelled as labelled transition systems (LTSs). The problem of model-checking the mu-calculus on transition systems is that... |

64 |
On model-checking for fragments of -calculus
- Emerson, Jutla, et al.
- 1993
(Show Context)
Citation Context ...en as a reformulation of tableau-based approaches such as [10]: a (history-free) winning strategy looks very much like a successful (canonical) tableau. The work is also related to [2] and methods in =-=[3]-=-. The history-free winning strategy, whose size is linear in the size of the problem, that is, in the product of the number of states of the model and the number of subformulae of the formula, should ... |

57 | An improved algorithm for the evaluation of fixpoint expressions - Long, Browne, et al. - 1994 |

46 |
Verification of Modal Properties Using Boolean Equation Systems
- Mader
- 1997
(Show Context)
Citation Context ...oretical side, we also find thinking in terms of games helpful: it seems to expose the structure and duality of the problem well. An alternative approach is via Boolean graphs [1] or equation systems =-=[5]-=-: indeed Mader has demonstrated the equivalence of Boolean equation systems and the modelchecking problem. We first briefly describe the basic model-checking game, and we introduce open games which ar... |

6 |
The Edinburgh Concurrency Workbench user manual. http://www.dcs.ed.ac.uk/home/cwb
- Moller, Stevens
- 1996
(Show Context)
Citation Context ...tion systems is that of deciding whether an LTS satisfies a formula. Many model-checking algorithms have been developed and implemented in tools. One such tool is the Edinburgh Concurrency Workbench (=-=[7]-=-), in which users design modular systems using the Calculus of Communicating Systems (CCS). The semantics of a CCS process is given by an LTS, and for model-checking purposes we will think of the LTS ... |