An n log n Alogrithm for Deterministic Kripke Structure Minimization

We introduce an algorithm for the minimization of deterministic Kripke structures with O(kn log2 n) time complexity. We prove the correctness and complexity properties of this algorithm.