Abstract
The representation of the desired behaviour of a logical discrete-event system (DES), using predicates and associated sets of blocking events, is introduced. The control of a regular DES consists in blocking events when a predicate concerning the system behaviour becomes true. If a blocking event is uncontrollable an algorithm is given which transforms the associated “uncontrollable” predicates into “controllable” ones. It is shown that using this technique it is possible to derive a non-regular desired behaviour which is least restrictive.
| Original language | English |
|---|---|
| Title of host publication | proceedings of the European Control Conference |
| Subtitle of host publication | Rome, 1995 |
| Number of pages | 6 |
| Publication status | Published - 1995 |
Keywords
- deadlock
- distributive control
- predicates
- control objectives
- logical discrete event systems