Other formats:
BibTeX
LaTeX
RIS
@inproceedings{405208, author = {Kučera, Antonín and Strejček, Jan}, address = {Berlin}, booktitle = {Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02)}, keywords = {verification; concurrency; weak bisimilarity; infinitestate systems}, language = {eng}, location = {Berlin}, isbn = {3540442405}, pages = {276291}, publisher = {Springer}, title = {The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL}, year = {2002} }
TY  JOUR ID  405208 AU  Kučera, Antonín  Strejček, Jan PY  2002 TI  The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL PB  Springer CY  Berlin SN  3540442405 KW  verification KW  concurrency KW  weak bisimilarity KW  infinitestate systems N2  It is known that LTL formulae without the `next' operator are invariant under the socalled stutterequivalence 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 statespace explosion problem with the help of presented results. ER 
KUČERA, Antonín and Jan STREJČEK. \textit{The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL}. J. Bradfield (Ed.). In \textit{Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02)}. Berlin: Springer, 2002. p.~276291. ISBN~3540442405.
