The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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. ... Conclusions We have given an algorithm for the minimization of deterministic Kripke structures with worst case time complexity O(kn log 2 n). ... By contrast, we will show that deterministic Kripke structures can be efficiently minimized even up to language equivalence with a worst case time complexity of O(kn log 2 n). ...arXiv:1205.5928v1 fatcat:ekjtlvnyrndftii2am5baviqea