Abstract.
We consider the problem of storing a set S⊂Σkas a deterministic finite automaton (DFA). We show that inserting a new string σ∈Σk or deleting a string from the set S represented as a minimized DFA can be done in expected time O(k|Σ|), while preserving the minimality of the DFA. The method can be applied to reduce the memory requirements of model checkers that are based on explicit state enumeration. As an example, we discuss an implementation of the method for the model checker Spin.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Holzmann, G., Puri, A. A minimized automaton representation of reachable states. STTT 2, 270–278 (1999). https://doi.org/10.1007/s100090050034
Issue Date:
DOI: https://doi.org/10.1007/s100090050034