Games and Model Checking for Guarded Logics (2000)
Cached
Download Links
- [www-mgi.informatik.rwth-aachen.de]
- [www.logic.rwth-aachen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF LPAR 2001, LECTURE NOTES IN COMPUTER SCIENCE NR. 2250 |
| Citations: | 9 - 4 self |
BibTeX
@INPROCEEDINGS{Berwanger00gamesand,
author = {Dietmar Berwanger and Erich Grädel},
title = {Games and Model Checking for Guarded Logics},
booktitle = {IN PROCEEDINGS OF LPAR 2001, LECTURE NOTES IN COMPUTER SCIENCE NR. 2250},
year = {2000},
pages = {70--84},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We investigate the model checking problems for guarded first-order and fixed point logics by reducing them to parity games. This approach is known to provide good results for the modal µ-calculus and is very closely related to automata-based methods. To obtain good results also for guarded logics, optimized constructions of games have to be provided. Further, we study the structure of parity games, isolate `easy' cases that admit efficient algorithmic solutions, and determine their relationship to specific fragments of guarded fixed point logics.
