On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
ACM Transactions on Computational Logic (TOCL)
Weak Kripke structures and LTL
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Deeper connections between LTL and alternating automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
It is known that LTL formulae without the ‘next’ operator are invariant under the so-called stutter equivalence of words. In this paper we extend this principle to general LTL formulae with given nesting depths of both ‘next’ and ‘until’ operators. This allows us to prove the semantical strictness of three natural hierarchies of LTL formulae, which are parametrized either by the nesting depth of just one of the two operators, or by both of them. Further, we provide an effective characterization of languages definable by LTL formulae with a bounded nesting depth of the ‘next’ operator.