About: The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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.
  • 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. (en)
  • 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. (cs)
Title
  • The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
  • The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (en)
  • The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (cs)
skos:prefLabel
  • The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
  • The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (en)
  • The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (cs)
skos:notation
  • RIV/00216224:14330/02:00006381!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany
  • 276
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/00/0400), P(GA201/00/1023), Z(MSM 143300001)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 665827
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/02:00006381
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • verification; concurrency; weak bisimilarity; infinite-state systems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [08B89A45EAA7]
http://linked.open...v/mistoKonaniAkce
  • September 22-25, 2002, Edinburgh, Scotland
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kučera, Antonín
  • Strejček, Jan
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 3-540-44240-5
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software