Chicago Journal of Theoretical Computer Science

Volume 1999

Article 12

Published by the Department of Computer Science, The University of Chicago.

Equivalences for Fair Kripke Structures

Adnan Aziz (Department of ECE, University of Texas, Austin), Felice Balarin (Cadence Berkeley Labs, Berkeley CA), Vigyan Singhal (Cadence Berkeley Labs), Robert Brayton (Department of EECS, University of California, Berkeley), and Alberto Sangiovanni-Vincentelli (Department of EECS, University of California, Berkeley)
1 June 2005

We extend the notion of bisimulation to Kripke structures with fairness. We define equivalences that preserve fairness and are akin to bisimulation. Specifically we define an equivalence and show that it is complete in the sense that it is the coarsest equivalence that preserves the logic CTL* interpreted with respect to the fair paths. The addition of fairness might cause two Kripke structures, which can be distinguished by a CTL* formula, to become indistinguishable by any CTL formula. We define a weaker equivalence that is the weakest equivalence preserving CTL interpreted on the fair paths. As a consequence of our proofs, we also obtain characterizations of states in the fair structure in terms of CTL* and CTL formulae.

DOI: 10.4086/cjtcs.1999.012
[] Article 11 [] Volume 2000, Article 1
[back] Volume 1999 [back] Published articles
[CJCTS home]