Computation of Sublanguages for Synthesizing Decentralized Supervisors for Timed Discrete Event Systems

Masashi NOMURA  Shigemasa TAKAI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E96-A   No.1   pp.345-355
Publication Date: 2013/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E96.A.345
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Concurrent Systems
timed discrete event system,  supervisory control,  decentralized control,  forcible event,  

Full Text: PDF>>
Buy this Article

In this paper, we study decentralized supervisory control of timed discrete event systems, where we adopt the OR rule for fusing local enablement decisions and the AND rule for fusing local enforcement decisions. Under these rules, necessary and sufficient conditions for the existence of a decentralized supervisor that achieves a given specification language are easily obtained from the result of literature. If a given specification language does not satisfy these existence conditions, we must compute its sublanguage satisfying them. The main contribution of this paper is proposing a method for computing such a sublanguage.