Learning objectives
Provide basic elements of supervisory control for discrete events systems theory.
Prerequisites
None.
Course unit content
Elements of supervisory control theory.
Full programme
1 - Languages
Definitions of alphabet and language.
Operations on languages.
Regular languages and rational expressions.
Arden's rule.
2- Deterministic finite state automata
Definitions, equivalence, computation of minimum automata.
3- Non deterministic finite state automata.
4- Generators.
Basic operations on generators.
5- Controllability and supervision.
Controllability theorem, computation of the supremal controllable language.
Bibliography
For reference
"Introduction to Discrete Event Systems", Christos G. Cassandras, Stéphane Lafortune, Springer, 2009.
Teaching methods
Classroom lessons.
Assessment methods and criteria
Written exam with exercises and theoretical questions.
The maximum degree is 32 points.
Other information
- - -
2030 agenda goals for sustainable development
- - -