Stuttering equivalence

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In theoretical computer science, stuttering equivalence,[1] a relation written as

The paths and are stuttering equivalent.
,

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.[citation needed]

References[edit]

  1. ^ Groote, Jan Friso; Vaandrager, Frits W. (1990). "An efficient algorithm for branching bisimulation and stuttering equivalence". In Paterson, Michael S. Proceedings of the 17th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. 443. Springer-Verlag. pp. 626–638. doi:10.1007/BFb0032063. ISBN 0-387-52826-1.