Print Email Facebook Twitter Language Equations for Maximal Decompositions in Coordination Control Title Language Equations for Maximal Decompositions in Coordination Control Author Komenda, Jan (Institute of Mathematics, Academy of Sciences of the Czech Republic) Lin, Feng (Wayne State University) van Schuppen, J.H. (TU Delft Mathematical Physics) Contributor Dochain, D. (editor) Henrion, D. (editor) Peaucelle, D. (editor) Date 2017 Abstract The 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 fixedpoint 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. Subject Discrete-event systemcoordination controlconvergenceautomatasupervisory control To reference this document use: http://resolver.tudelft.nl/uuid:285d2c6f-3a83-41f1-9085-78080ddceedb DOI https://doi.org/10.1016/j.ifacol.2017.08.2303 Publisher Elsevier Source IFAC-PapersOnLine Event 20th World Congress of the International Federation of Automatic Control (IFAC), 2017, 2017-07-09 → 2017-07-14, Toulouse, France Series IFAC-PapersOnLine, 2405-8963, 50 (1) Part of collection Institutional Repository Document type conference paper Rights © 2017 Jan Komenda, Feng Lin, J.H. van Schuppen Files PDF 36831234.pdf 460.92 KB Close viewer /islandora/object/uuid:285d2c6f-3a83-41f1-9085-78080ddceedb/datastream/OBJ/view