Symbolic State Exploration

Fabio Somenzi
2001 Electronical Notes in Theoretical Computer Science  
The exploration of the state space of the model is at the heart of model checking. Symbolic algorithms often use Binary Decision Diagrams for the representation of sets of states, and have to pay attention to the size of the BDDs. We review the techniques that have been proposed for this task in the framework of closed sequences of monotonic functions. Open access under CC BY-NC-ND license.
doi:10.1016/s1571-0661(04)80668-6 fatcat:vwtfwc6curhkhjhpqaudbeqnlm