How does it work? (in brief)

• An iterative algorithm that labels states in the transition graph with formulae known to be true

• For a query Q

  • the first iteration marks all subformulae of Q oflength 1
  • the second iteration marks them of length 2
  • this terminates since the formula is finite

• The details of the logic indeed matter (but not at this level of description)

Previous slide

Next slide

Back to first slide

View graphic version