Language Equations for Maximal Decompositions in Coordination Control

Conference paper (2017)

Authors

Jan Komenda Institute of Mathematics, Academy of Sciences of the Czech Republic
Feng Lin Wayne State University
J.H. van Schuppen Mathematical Physics - EEMCS
Research Group
Mathematical Physics (EEMCS) (TU Delft)
Copyright: © 2017 Jan Komenda, Feng Lin, J.H. van Schuppen
DOI: https://doi.org/10.1016/j.ifacol.2017.08.2303
More Info
expand_more

Published Date

2017

Language

English

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Mathematical Physics

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.