Fair simulation

Abstract

The simulation preorder for labeled transition systems is defined locally as a game that relates states with their immediate successor states. Livehess assumptions about transition systems are typically modeled using fairness constraints. Existing notions of simulation for fair transition systems, however, are not local, and as a result, many appealing properties of the simulation preorder are lost. We extend the local definition of simulation to account for fairness: System S]airly simulates system Z if[in the simulation game, there is a strategy that matches with each fair computation of 2: A fair computation of S. Our definition enjoys a fully abstract semantics and has a logical characterization: S fairly simulates I iff every fair computation tree embedded in the unrolling of 2: Can be embedded also in the unrolling of S or, equivalently, iff every Fair-u formula satisfied by Z is satisfied also by S (VAFMC is the universal fragment of the alternation-free p-calculus). The locality of the deftnition leads us to a polynomial-time algorithm for checking fair simulation for finite-state systems with weak and strong fairness constraints. Finally, fair simulation implies fair trace-containment, and is therefore useful as an efficientlycomputable local criterion for proving linear-time abstraction hierarchies.