Stuttering equivalence (original) (raw)
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 .
| Property | Value |
|---|---|
| dbo: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) |
| dbo:wikiPageID | 30875123 (xsd:integer) |
| dbo:wikiPageLength | 2347 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1026710808 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Modal_logic dbr:Computation_tree_logic dbr:Theoretical_computer_science dbr:Linear_temporal_logic dbc:Formal_methods dbc:Logic_in_computer_science dbr:Bisimulation dbr:File:Stuttering_Equivalence.pdf |
| dbp:wikiPageUsesTemplate | dbt:Citation_needed dbt:Reflist dbt:Technical dbt:Comp-sci-theory-stub |
| dcterms:subject | dbc:Formal_methods dbc:Logic_in_computer_science |
| rdf:type | yago:Ability105616246 yago:Abstraction100002137 yago:Cognition100023271 yago:Know-how105616786 yago:Method105660268 yago:PsychologicalFeature100023100 yago:WikicatFormalMethods |
| 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) |
| rdfs:label | Stuttering equivalence (en) |
| owl:sameAs | freebase:Stuttering equivalence yago-res:Stuttering equivalence wikidata:Stuttering equivalence https://global.dbpedia.org/id/4vFSA |
| prov:wasDerivedFrom | wikipedia-en:Stuttering_equivalence?oldid=1026710808&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Stuttering_equivalence |
| is dbo:wikiPageDisambiguates of | dbr:Stutter_(disambiguation) |
| is dbo:wikiPageRedirects of | dbr:Stuttering_equivalent |
| is dbo:wikiPageWikiLink of | dbr:Stutter_(disambiguation) dbr:Stuttering_equivalent |
| is foaf:primaryTopic of | wikipedia-en:Stuttering_equivalence |