Distributive Control of Logical Discrete Event Systems Using Control Objectives
Michael P. Spathopoulos, Rein Smedinga, M.A. de Ridder · 1995
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. 1 Introduction A simple but effective way of defining a logical discrete event system is by giving its alphabet set and its behaviour set, so: P = haP; bPi denotes a DES with possible events collected in the finite set aP and with possible behaviour collected in the set bP ` (aP) . bP is a set of strings. For simplicity we suppose that bP is prefix closed (i.e., if st 2 bP then also s 2 bP, where st denotes concatenation of s and t). DESs de...