Fair Equivalence Relations [chapter]

Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2000 Lecture Notes in Computer Science  
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs are modeled by fair state-transition systems, equivalence in the linear paradigm corresponds to fair trace equivalence, and in the branching paradigm corresponds to fair bisimulation. In this work we study the expressive power of various types of fairness conditions. For the linear paradigm, it is known that the Büchi
more » ... ondition is sufficiently strong (that is, a fair system that uses Rabin or Streett fairness can be translated to an equivalent Büchi system). We show that in the branching paradigm the expressiveness hierarchy depends on the types of fair bisimulation one chooses to use. We consider three types of fair bisimulation studied in the literature: © bisimulation, game-bisimulation, and -bisimulation. We show that while gamebisimulation and -bisimulation have the same expressiveness hierarchy as tree automata, © -bisimulation induces a different hierarchy. This hierarchy lies between the hierarchies of word and tree automata, and it collapses at Rabin conditions of index one, and Streett conditions of index two. § bisimulation [GL94], game-bisimulation [HKR97,HR00], and¨-bisimulation [LT87]. In a bisimulation relation between © and © with no fairness, two related states and ¡ -calculus is given in [HR00]. 2 As shown in [ASB ¢ 94], the logic CTL induces yet another definition, strictly weaker than © -bisimulation. Also, no logical characterization is known for -bisimulation. -bisimulation relation. As demonstrated in [HKR97], the other direction is not true. For all types © of bisimulation relations (that is © F § $ t $¨ u ), a © -bisimulation relation ! is © -stronger than ! % E to indicate that
doi:10.1007/3-540-44450-5_12 fatcat:dabexamcufepljiawgjdbs6psm