par Brenguier, Romain ;Raskin, Jean-François ;Sassolas, Mathieu
Référence Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, page (23)
Publication Publié, 2014
Publication dans des actes
Titre:
  • The complexity of admissibility in Omega-regular games
Auteur:Brenguier, Romain; Raskin, Jean-François; Sassolas, Mathieu
Informations sur la publication:Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, page (23)
Statut de publication:Publié, 2014
Sujet CREF:Informatique générale
Langue:Anglais
Identificateurs:http://doi.acm.org/10.1145/2603088.2603143

Documents en relation

DI-fusion