Počet záznamů: 1
Language equations for maximal decomposition in coordination control
- 1.0480311 - MÚ 2018 RIV NL eng C - Konferenční příspěvek (zahraniční konf.)
Komenda, Jan - Lin, F. - van Schuppen, J. H.
Language equations for maximal decomposition in coordination control.
IFAC-PapersOnLine. Vol. 50. Amsterdam: Elsevier, 2017 - (Dochain, D.; Henrion, D.; Peaucelle, D.), s. 13441-13446. E-ISSN 2405-8963.
[20th IFAC World Congress. Toulouse (FR), 09.07.2017-14.07.2017]
Grant CEP: GA ČR GA15-02532S
Institucionální podpora: RVO:67985840
Klíčová slova: languages * convergence * automata * supervisory control
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://www.sciencedirect.com/science/article/pii/S2405896317331142
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 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.
Trvalý link: http://hdl.handle.net/11104/0276125
Název souboru Staženo Velikost Komentář Verze Přístup Komenda2.pdf 1 369.6 KB Vydavatelský postprint vyžádat
Počet záznamů: 1