Session 10: Invited Talk

Computer Aided Verification

Volume 939 of the series Lecture Notes in Computer Science pp 309-324


Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach

  • E. A. EmersonAffiliated withDepartment of Computer Science, University of Texas at Austin
  • , A. P. SistlaAffiliated withDepartment of Electrical Engineering and Computer Science, University of Illinois at Chicago

* Final gross prices may vary according to local VAT.

Get Access


One useful technique for combating the state explosion problem is to exploit symmetry [ID93, CFJ93, ES93] when performing temporal logic model checking [CE81, CES86]. In [CFJ93] [ES93] it is shown how, using some basic notions of group theory, symmetry may be exploited for the full range of correctness properties expressible in the very expressive temporal logic CTL*. Surprisingly, while fairness properties are readily expressible in CTL*, these methods are not powerful enough to admit any amelioration of state explosion, when fairness assumptions are involved. We show that it is nonetheless possible to handle fairness efficiently by trading some group theory for automata theory. Our automata-theoretic approach [VW86] depends on detecting fair paths subtly encoded in a permutation annotated quotient structure, using a threaded structure to “physically” reflect coordinate permutations.