On supervisor reduction in discrete-event systems
- 1 August 1986
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 44 (2) , 475-491
- https://doi.org/10.1080/00207178608933613
Abstract
A supervisory controller (supervisor) S for a discrete-event system can be modelled on a recognizer R for the language corresponding to the supervisory task to be accomplished. It is shown that simpler ‘reduced’ supervisors can be constructed by the use of covers of the state set of R; and that any mildly restricted supervisor is a reduction of R in this sense. The reduction procedure is time-exponential with respect to the size of the state set of R.This publication has 1 reference indexed in Scilit:
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959