Supervisor Reduction for Discrete-Event Systems

In supervisory control theory (SCT) the supremal supervisor (representing the supremal controllable sublanguage) typically has a large state size (of order the product of state sizes of the plant and specification automata). In this paper, we propose an algorithm which can significantly reduce supervisor size while preserving control action. We also show that finding a supervisor of minimal size is NP-hard.

[1]  M.H. de Queiroz,et al.  Synthesis and implementation of local modular supervisory control for a manufacturing cell , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[2]  W. M. Wonham,et al.  Complexity reduction in discrete event systems , 2002 .

[3]  Charles P. Pfleeger,et al.  State Reduction in Incompletely Specified Finite-State Machines , 1973, IEEE Transactions on Computers.

[4]  A. F. Vaz,et al.  On supervisor reduction in discrete-event systems , 1986 .

[5]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[6]  Arlindo L. Oliveira,et al.  A new algorithm for the reduction of incompletely specified finite state machines , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[7]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[8]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[9]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[10]  B. Craven.  Control and optimization , 2019, Mathematical Modelling of the Human Cardiovascular System.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[13]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..