Title :
Concurrency and discrete event control
Author :
Heymann, Michael
Author_Institution :
Dept. of Comput. Sci., Technion, Haifa, Israel
fDate :
6/1/1990 12:00:00 AM
Abstract :
Much of discrete event control theory has been developed within the framework of automata and formal languages. An alternative approach inspired by the theories of process-algebra as developed in the computer science literature is presented. 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.<>
Keywords :
automata theory; discrete time systems; formal languages; parallel algorithms; automata; concurrency; discrete event control; formal languages; process-algebra; Algebra; Automata; Automatic control; Centralized control; Communication system traffic control; Computer science; Concurrent computing; Control systems; Control theory; Formal languages;
Journal_Title :
Control Systems Magazine, IEEE
