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

Author: Laroussinie F.   Schnoebelen P.   Turuani M.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.297, Iss.1, 2003-03, pp. : 297-315

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract