Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
MC games are infinite duration two-player games played on graphs. Deciding the winner in MC games is equivalent to the the modal mu-calculus model checking. In this article we provide a linear time algorithm for a class of MC games. We show that, if all cycles in each strongly connected component of the game graph have at least one common vertex, the winner can be found in linear time. Our results hold also for parity games, which are equivalent to MC games.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
315--324
Opis fizyczny
bibliogr. 21 poz.
Twórcy
autor
autor
- Dept. of Computer and Information Sciences, P.O. Box 607, FIN-33014 University of Tampere, Tampere, Finland, tp@cs.uta.fi
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0004-0016