The stuttering principle revisited |
| |
Authors: | Antonín Ku?era Jan Strej?ek |
| |
Affiliation: | (1) Faculty of Informatics, Masaryk University in Brno, Botanická 68a, 60200 Brno, Czech Republic |
| |
Abstract: | 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.This paper is a revised and extended version of 6]. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|