Zobrazeno 1 - 10
of 191
pro vyhledávání: '"KOMENDA, Jan"'
This paper investigates the coordination control of discrete event systems in the presence of combined sensor and actuator attacks. Discrete event systems are modeled as automata, and sensor attacks are defined using specific attack languages. The ap
Externí odkaz:
http://arxiv.org/abs/2309.11965
P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows. Their dynamics can be represented by max-plus linear-dual inequalities (LDIs), i.e., systems of linear dynamica
Externí odkaz:
http://arxiv.org/abs/2305.02934
Autor:
Komenda, Jan, Masopust, Tomáš
Complex systems are often composed of many small communicating components called modules. We investigate the synthesis of supervisory controllers for modular systems under partial observation that, as the closed-loop system, realize the supremal norm
Externí odkaz:
http://arxiv.org/abs/2302.10666
P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows. Their dynamics can be represented by systems of linear dynamical inequalities in the max-plus algebra and its d
Externí odkaz:
http://arxiv.org/abs/2204.01156
Autor:
Komenda, Jan, Masopust, Tomáš
Conditions preserving observability of specifications between the plant and its abstraction are essential for hierarchical supervisory control of discrete-event systems under partial observation. Observation consistency and local observation consiste
Externí odkaz:
http://arxiv.org/abs/2203.01444
Publikováno v:
In ISA Transactions May 2024 148:237-246
In this paper we investigate multi-agent discrete-event systems with partial observation. The agents can be divided into several groups in each of which the agents have similar (isomorphic) state transition structures, and thus can be relabeled into
Externí odkaz:
http://arxiv.org/abs/2103.10877
P-time event graphs (P-TEGs) are specific timed discrete-event systems, in which the timing of events is constrained by intervals. An important problem is to check, for all natural numbers $d$, the existence of consistent $d$-periodic trajectories fo
Externí odkaz:
http://arxiv.org/abs/2103.01024
Let us consider a parametric weighted directed graph in which every arc $(j,i)$ has weight of the form $w((j,i))=\max(P_{ij}+\lambda,I_{ij}-\lambda,C_{ij})$, where $\lambda$ is a real parameter and $P$, $I$ and $C$ are arbitrary square matrices with
Externí odkaz:
http://arxiv.org/abs/2102.12264