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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• Takai Shigemasa

  Division Of Electrical Electronic And Information Engineering Osaka University

• Nomura Masashi

  Division Of Electrical Electronic And Information Engineering Osaka University

• TAKAI Shigemasa

  Division of Electrical, Electronic and Information Engineering, Osaka University

• NOMURA Masashi

  Division of Electrical, Electronic and Information Engineering, Osaka University

関連論文

• Modular Synthesis of Maximally Permissive Opacity-Enforcing Supervisors for Discrete Event Systems
• Decentralized Supervisory Control of Timed Discrete Event Systems Using a Partition of the Forcible Event Set
• Decentralized Supervisory Control of Timed Discrete Event Systems
• Computation of Sublanguages for Synthesizing Decentralized Supervisors for Timed Discrete Event Systems

スポンサーリンク