The complexity of quantitative concurrent parity games

Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger. The complexity of quantitative concurrent parity games. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 678-687, ACM Press, 2006. [doi]

Abstract

Abstract is missing.