State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search to ensure termination.We propose and experimentally evaluate an extension of the state caching method for general state exploring algorithms that are independent of the search order (i.e., search algorithms that partition the state space into closed (visited) states, open (to visit) states and unmet states).
Lecture Notes in Computer Science, 2010, Vol 6550, p. 21-41
Main Research Area:
Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, 2010