Counting CTL - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2013

Counting CTL

Résumé

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and arithmetic operations allowed in constraints, one obtains several distinct logics generalizing CTL. We provide a thorough analysis of their expressiveness and succinctness, and of the complexity of their model-checking and satisfiability problems (ranging from P-complete to undecidable). Finally, we present two alternative logics with similar features and provide a comparative study of the properties of both variants.

Dates et versions

hal-00790010 , version 1 (19-02-2013)

Identifiants

Citer

François Laroussinie, Antoine Meyer, Eudes Petonnet. Counting CTL. Logical Methods in Computer Science, 2013, 9 (1), pp.3.1-3.34. ⟨10.2168/LMCS-9(1:3)2013⟩. ⟨hal-00790010⟩
103 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More