Synthesis of Reliable Decentralized Supervisors for Discrete Event Systems

Shigemasa TAKAI  Toshimitsu USHIO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.11   pp.2212-2218
Publication Date: 2000/11/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Concurrent Systems Technology)
discrete event system,  decentralized supervisory control,  reliable control,  normality,  fully decentralized supervisor,  

Full Text: PDF>>
Buy this Article

We consider a discrete event system controlled by a decentralized supervisor consisting of n local supervisors. Given a nonempty and closed language as the upper bound specification, we consider a problem to synthesize a reliable decentralized supervisor such that the closed-loop behavior is still legal under possible failures of any less than or equal to n-k (1 k n) local supervisors. We synthesize two such reliable decentralized supervisors. One is synthesized based on a suitably defined normal sublanguage. The other is the fully decentralized supervisor induced by a suitably defined centralized supervisor. We then show that the generated languages under the control actions of these two decentralized supervisors are incomparable.