The Complexity of Admissibility in Omega-Regular Games

Abstract : no abstract
Type de document :
Communication dans un congrès
Proceedings of the joint meeting of the 23rd Annual Conference on Computer Science Logic (CSL) and the 29th Annual Symposium on Logic in Computer Science (LICS), 2014, Wien, Austria. ACM, pp.23:1--23:10, 2014
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01161868
Contributeur : Mathieu Sassolas <>
Soumis le : mardi 9 juin 2015 - 11:57:09
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28

Identifiants

  • HAL Id : hal-01161868, version 1

Collections

Citation

Romain Brenguier, Jean-François Raskin, Mathieu Sassolas. The Complexity of Admissibility in Omega-Regular Games. Proceedings of the joint meeting of the 23rd Annual Conference on Computer Science Logic (CSL) and the 29th Annual Symposium on Logic in Computer Science (LICS), 2014, Wien, Austria. ACM, pp.23:1--23:10, 2014. 〈hal-01161868〉

Partager

Métriques

Consultations de la notice

46