Stocplan

Stocplan is a general implementation of the random walk algorithm for deciding questions of reachability in the state-transition graph of a discrete state, discrete time, dynamical system. It can be used to solve plan existance problems and certain kinds of verification problems.

Downloading

• The Stocplan system (gzip/tar, 119k).
• The PPI compiler (gzip/tar, 45k).

Please send questions, comments, bug reports, etc. to me by email

Publications

Jonsson, P., Haslum, P. & Bäström, C:, Towards Efficient Universal Planning - A Randomized Approach. Artificial Intelligence 117(1):1-29, 2000.

Complexity-oriented, describes the use of random walks for universal planning.

Haslum, P. Model Checking by Random Walk. Proc. 1999 ECSEL Workshop.

Describes the use of random walks for verification (model checking).

/P@trik Haslum, August 1999