Premium
A MODIFIED METHOD FOR SUPERVISOR SPECIFICATION AND SYNTHESIS OF A CLASS OF DISCRETE EVENT SYSTEMS
Author(s) -
Ou YeongChang,
Hu JwuSheng
Publication year - 2000
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1111/j.1934-6093.2000.tb00031.x
Subject(s) - sublanguage , supervisor , computer science , automaton , class (philosophy) , interpretation (philosophy) , set (abstract data type) , supervisory control , supervisory control theory , state (computer science) , event (particle physics) , specification language , theoretical computer science , simple (philosophy) , regular language , programming language , control (management) , artificial intelligence , philosophy , physics , epistemology , quantum mechanics , political science , law
In this paper, a model‐refining method is proposed to alleviate the complexity involved in specification interpretation of DES control problems. The legal constraint language is defined in terms of illegal states and events in contrast with constructing the automaton of the specification language. This method could provide a more intuitive view of the DES control problem and would be suitable for practical implementation. Two examples, which have commonly been used in the literature, are employed to show the efficiency of the proposed method. Further, under this framework, it is shown that the supremal controllable sublanguage can take a simpler form based on the concept of an illegal state set. A state‐based supervisor synthesis procedure is presented, and a simple example is provided.