Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call