About: Stuttering equivalence     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatFormalMethods, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FStuttering_equivalence&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

In theoretical computer science, stuttering equivalence, a relation written as , can be seen as a partitioning of path and into blocks, so that states in the block of one path are labeled the same as states in the block of the other path. Corresponding blocks may have different lengths. Formally, this can be expressed as two infinite paths and which are stuttering equivalent if there are two infinite sequences of integers and such that for every block holds .

AttributesValues
rdf:type
rdfs:label
  • Stuttering equivalence (en)
rdfs:comment
  • In theoretical computer science, stuttering equivalence, a relation written as , can be seen as a partitioning of path and into blocks, so that states in the block of one path are labeled the same as states in the block of the other path. Corresponding blocks may have different lengths. Formally, this can be expressed as two infinite paths and which are stuttering equivalent if there are two infinite sequences of integers and such that for every block holds . (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In theoretical computer science, stuttering equivalence, a relation written as , can be seen as a partitioning of path and into blocks, so that states in the block of one path are labeled the same as states in the block of the other path. Corresponding blocks may have different lengths. Formally, this can be expressed as two infinite paths and which are stuttering equivalent if there are two infinite sequences of integers and such that for every block holds . Stuttering equivalence is not the same as bisimulation, since bisimulation cannot capture the semantics of the 'eventually' (or 'finally') operator found in linear temporal/computation tree logic(branching time logic)(modal logic). So-called branching bisimulation has to be used. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 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 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software