Büchi Complementation

Julian Brunner 🌐

October 19, 2017

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This entry provides a verified implementation of rank-based Büchi Complementation. The verification is done in three steps:
  1. Definition of odd rankings and proof that an automaton rejects a word iff there exists an odd ranking for it.
  2. Definition of the complement automaton and proof that it accepts exactly those words for which there is an odd ranking.
  3. Verified implementation of the complement automaton using the Isabelle Collections Framework.


BSD License


Session Buchi_Complementation