LAUSR

Abstract In Supervisory Control Theory (SCT) of Discrete Event Systems, event refinements have been exploited to simplify modeling tasks. Approximations complement this approach with an alternative to also reduce synthesis effort. In spite of advantageous to modeling and synthesis, refinements do not directly cover the SCT implementation phase. In general, controllers obtained with and without refinements are expected to be implemented with equivalent hardware cost. This paper presents a decentralized architecture that extends the gains provided by refinements from synthesis to implementation. The approach separates supervisor and distinguisher codes in two different structures, which then communicate in such a way that the resulting control action on the plant is equivalent to the centralized case, while the implementation is conducted with hardware savings. An example of a buffering system illustrates the approach.