Kripke Structure to Büchi automata
Consider a Kripke Structure K = (AP, W, W0, R, l). We construct an NBA AK such that AK accepts a computation iff π is a computation of K. The construction of AK essentially moves the labels of K from the states to the transitions. Thus, AK = , where for all w ∈ W and σ ∈ , we have:
if then
else