On the expressivity and complexity of quantitative branching-time temporal logics

François Laroussinie, Ph. Schnoebelen, Mathieu Turuani. On the expressivity and complexity of quantitative branching-time temporal logics. Theoretical Computer Science, 297(1-3):297-315, 2003. [doi]

Abstract

Abstract is missing.