A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Language Equations for Maximal Decompositions in Coordination Control
2017
IFAC-PapersOnLine
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
doi:10.1016/j.ifacol.2017.08.2303
fatcat:qye5rtnjwrbv7alrhejrdv4qtq