An n log n Alogrithm for Deterministic Kripke Structure Minimization
Karl Meinke, Muddassar A. Sindhu
TL;DR
This paper presents an efficient algorithm for minimizing deterministic Kripke structures with improved time complexity, ensuring correctness and practical applicability in model checking.
Contribution
The paper introduces a novel n log n time algorithm for deterministic Kripke structure minimization, improving upon previous methods.
Findings
Algorithm runs in O(kn log^2 n) time
Proven correctness and complexity of the algorithm
Applicable to large-scale model checking tasks
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · semigroups and automata theory · Algorithms and Data Compression