The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
| Authors | |
|---|---|
| Year of publication | 2002 |
| Type | Article in Proceedings |
| Conference | Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02) |
| MU Faculty or unit | |
| Citation | |
| Field | Computer hardware and software |
| Keywords | verification; concurrency; weak bisimilarity; infinite-state systems |
| Description | 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 the `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. As another interesting corollary we obtain an alternative characterization of LTL languages, which are exactly the regular languages closed under the generalized form of stutter equivalence. We also indicate how to tackle the state-space explosion problem with the help of presented results. |
| Related projects: |