Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Stuttering Equivalence

Stephan Merz 1 
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Stephan Merz Connect in order to contact the contributor
Submitted on : Tuesday, December 4, 2012 - 11:43:19 AM
Last modification on : Wednesday, October 26, 2022 - 8:16:32 AM


  • HAL Id : hal-00760690, version 1



Stephan Merz. Stuttering Equivalence. [Research Report] 2012. ⟨hal-00760690⟩



Record views