Counting LTL

Authors:
Francois Laroussinie;Antoine Meyer;Eudes Petonnet
Affiliations:
-;-;-
Venue:
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Year:
2010

Citing 0
Cited 3

LTL can be more succinct

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
The complexity of reversal-bounded model-checking

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a quantitative extension for the linear-time temporal logic LTL allowing to specify the number of states satisfying certain sub-formulas along paths. We give decision procedures for the satisfiability and model checking of this new temporal logic and study the complexity of the corresponding problems. Furthermore we show that the problems become undecidable when more expressive constraints are considered.