Limitations
This approach is called explicit model checking, because the state graph is represented and traversed explicitly
When the state space is very large, this approach is computationally infeasible
- There has been lots of recent work on explicit model checkers, notably the MurF system at Stanford (Dill et al.)
- Identifying isomorphic states is the central idea
- Can be effective in situations with many replicated structures