Jan Komenda

TL;DR: Coordinated distributed systems are defined for linear systems, for Gaussian systems, and for discrete-eventsystemsandanalgebraic-geometriccharacterization and a specific control synthesis procedure is presented.

TL;DR: A procedure to compute the least restrictive solution within the coordination control architecture is provided and conditions under which the result coincides with the supremal controllable sublanguage are stated.

TL;DR: In this article, a control synthesis problem for a generator with a global specification and with a combination of a coordinator and local controllers is formulated and solved, and conditions under which the result coincides with the supremal controllable sublanguage are stated.

TL;DR: A survey of the history of max-plus algebra and its role in the field of discrete event systems during the last three decades, based on the perspective of the authors but it covers a large variety of topics, where max- plus algebra plays a key role.

TL;DR: A polynomial-time algorithm for verification whether a language is conditionally decomposable with respect to given alphabets is presented and it is shown that conditional decomposability is a weaker condition than nonblockingness.