ABSTRACT
An approach to deadlock avoidance based on finite automata is reviewed in this chapter. This approach begins from the framework introduced by Ramadge and Wonham (R&W) for modeling and control of discrete event systems based on formal languages generated by finite automata. We apply this framework to the problem of dynamic scheduling and control of automated manufacturing systems.
