文章基本信息

标题：Language Equations for Maximal Decompositions in Coordination Control
本地全文：下载
作者：Jan Komenda ; Feng Lin ; Jan H. van Schuppen 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2017
卷号：50
期号：1
页码：13441-13446
DOI：10.1016/j.ifacol.2017.08.2303
语种：English
出版社：Elsevier
摘要：AbstractThe problem considered is to construct all solutions of an equation for a tuple of languages. The tuple in synchronous composition should equal a considered language. Of special interest are the maximal solutions with respect to a partial order relation on the set of solutions. The motivation of the problem is coordination control. The approach to the problem is to transform the equation to a fixed-point equation. An algorithm is proposed which constructs tuples of maximal solutions by convergence of a sequence of tuples to a solution of the fixed-point equation. Modular supervisory control is shown to benefit from the proposed approach.
关键词：KeywordsDiscrete-event systemcoordination controlconvergenceautomatasupervisory control