This paper presents a simple and flexible on-line synthesis algorithm
that derives the optimal controller for a given environment. It consis
ts of finding the greatest possible number of admissible event sequenc
es of a discrete-event system with respect to a requirements specifica
tion. It generates and explores the slate space on-the-fly and uses a
control-directed backtracking technique. Compared to a previous algori
thm of Wonham and Ramadge, pur algorithm does not require explicit sto
rage of the entire work space and backtracks on paths of arbitrary len
gth to prune the search space more efficiently. This paper also discus
ses an implementation of our algorithm and includes an evaluation of i
ts performance on a variety of problems. (C) 1997 Academic Press.