2002
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
KUČERA, Antonín a Jan STREJČEKZákladní údaje
Originální název
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
Autoři
KUČERA, Antonín (203 Česká republika, garant) a Jan STREJČEK (203 Česká republika)
J. Bradfield (Ed.).
J. Bradfield (Ed.).
Vydání
Berlin, Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02), s. 276-291, 2002
Nakladatel
Springer
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
20206 Computer hardware and architecture
Stát vydavatele
Německo
Utajení
není předmětem státního či obchodního tajemství
Kód RIV
RIV/00216224:14330/02:00006381
Organizační jednotka
Fakulta informatiky
ISBN
3-540-44240-5
UT WoS
000187294300019
Klíčová slova anglicky
verification; concurrency; weak bisimilarity; infinite-state systems
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 20. 12. 2011 18:12, prof. RNDr. Jan Strejček, Ph.D.
Anotace
V originále
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.
Návaznosti
| GA201/00/0400, projekt VaV |
| ||
| GA201/00/1023, projekt VaV |
| ||
| MSM 143300001, záměr |
|