Concurrency and discrete event control

Much of discrete event control theory has been developed within the framework of automata and formal languages. This tutorial paper presents an alternative approach inspired by the theories of process-algebra as developed in the computer science literature. The framework, which rests on a new formalism of concurrency, can adequately handle nondeterminism and can be used for analysis of a wide range of discrete event phenomena.