Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twenty-Ninth Annual IEEE Symposium on

Logic in Computer Science (LICS 2014)

Paper: The complexity of admissibility in Omega-regular games (at LICS 2014)

Authors: Romain Brenguier Jean-François Raskin Mathieu Sassolas

Abstract

No Abstract Available

BibTeX

  @InProceedings{BrenguierRaskinSass-Thecomplexityofadmi,
    author = 	 {Romain Brenguier and Jean-François Raskin and Mathieu Sassolas},
    title = 	 {The complexity of admissibility in Omega-regular games},
    booktitle =  {Proceedings of the Twenty-Ninth Annual IEEE Symposium on Logic in Computer Science (LICS 2014)},
    year =	 {2014},
    month =	 {July}, 
    pages =      {23:1--23:10},
    location =   {Vienna, Austria}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski