Skip to Main content Skip to Navigation
Conference papers

The Complexity of Admissibility in Omega-Regular Games

Abstract : no abstract
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01161868
Contributor : Mathieu Sassolas <>
Submitted on : Tuesday, June 9, 2015 - 11:57:09 AM
Last modification on : Friday, October 4, 2019 - 1:13:02 AM

Identifiers

  • 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. pp.23:1--23:10. ⟨hal-01161868⟩

Share

Metrics

Record views

99