can be seen as a partitioning of path π and π' into blocks, so that states in the kth block of one path are labeled () the same as states in the kth 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/branching time logic (modal logic). So-called branching bisimulation has to be used.
,
) the same as states in the 
and 
which are stuttering equivalent (
and 
such that for every block 
holds 
.
