State Dependances in Interfering Automata
Viliam Holub · 2006
Abstract. A common problem in the model verification is the amount of states. To avoid revisiting of states during exhaustive traversal, visited states have to be kept in a relatively small operational memory, setting a limit to the verification process. By analyzing dependances among components, we can significantly reduce the size of the state representation and mitigate this limitation.