Laroussinie, François and Meyer, Antoine and Petonnet, Eudes - Counting CTL

lmcs:1058 - Logical Methods in Computer Science, February 15, 2013, Volume 9, Issue 1
Counting CTL

Authors: Laroussinie, François and Meyer, Antoine and Petonnet, Eudes

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.


Source : oai:arXiv.org:1211.4651
DOI : 10.2168/LMCS-9(1:3)2013
Volume: Volume 9, Issue 1
Published on: February 15, 2013
Submitted on: February 10, 2012
Keywords: Computer Science - Logic in Computer Science,F.4.1,D.2.4


Share

Consultation statistics

This page has been seen 60 times.
This article's PDF has been downloaded 62 times.