[isabelle] New AFP entry: Stuttering Equivalence

Stuttering Equivalence
Stephan Merz

Two omega-sequences are stuttering equivalent if they differ only by finite
repetitions of elements. Stuttering equivalence is a fundamental concept in the
theory of concurrent and distributed systems. Notably, Lamport argues that
refinement notions for such systems should be insensitive to finite stuttering.
Peled and Wilke show that all LTL (linear-time temporal logic) properties that
are insensitive to stuttering equivalence can be expressed without the next-time
operator. Stuttering equivalence is also important for certain verification
techniques such as partial-order reduction for model checking.

We formalize stuttering equivalence in Isabelle/HOL. Our development relies on
the notion of a stuttering sampling function that identifies blocks of identical
sequence elements.


[An eminently reusable contribution, thanks Stephan.]

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.