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]

Authors

François Laroussinie

This author has not been identified. Look up 'François Laroussinie' in Google

Ph. Schnoebelen

This author has not been identified. It may be one of the following persons: Look up 'Ph. Schnoebelen' in Google

Mathieu Turuani

This author has not been identified. Look up 'Mathieu Turuani' in Google