activity
20102023
most citedSupervisory Control Synthesis of Discrete-Event Systems using Coordination Scheme

54 citations · 166 across the 22 of their papers we have counts for

collaborators

22 papers

eess.SY2023

Coordination Control of Discrete Event Systems under Cyber Attacks

Fei Wang, Jan Komenda, Feng Lin

In this paper, coordination control of discrete event systems under joint sensor and actuator attacks is investigated. Sensor attacks are described by a set of attack languages usi…

eess.SY2023★ 4 cited

Switched max-plus linear-dual inequalities: cycle time analysis and applications

Davide Zorzenon, Jan Komenda, Jörg Raisch

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-…

cs.FL2023

Supervisory Control of Modular Discrete-Event Systems under Partial Observation: Normality

Jan Komenda, Tomáš Masopust

Complex systems are often composed of many small communicating components called modules. We investigate the synthesis of supervisory controllers for modular systems under partial…

eess.SY2022★ 2 cited

Switched Max-Plus Linear-Dual Inequalities: Application in Scheduling of Multi-Product Processing Networks

Davide Zorzenon, Jan Komenda, Jörg Raisch

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 syst…

eess.SY2022

Hierarchical Supervisory Control under Partial Observation: Normality

Jan Komenda, Tomáš Masopust

Conditions preserving observability of specifications between the plant and its abstraction are essential for hierarchical supervisory control of discrete-event systems under parti…

eess.SY2021

Supervisory Control of Multi-Agent Discrete-Event Systems with Partial Observation

Yingying Liu, Jan Komenda, Zhiwu Li

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 (is…

cs.DS2021★ 4 cited

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem

Davide Zorzenon, Jan Komenda, Joerg Raisch

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…

math.CO2021★ 3 cited

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory

Davide Zorzenon, Jan Komenda, Joerg Raisch

Let us consider a parametric weighted directed graph in which every arc has weight of the form , where is a real parameter and…

eess.SY2020★ 1 cited

Analysis of P-time Event Graphs in (Max,+) and (Min,+) Algebras

Pavel Špaček, Jan Komenda, Sébastien Lahaye

In this work we investigate the behavior of P-time event graphs, a class of time Petri nets with nondeterministic timing of places. Our approach is based on combined linear descrip…

eess.SY2019

Conditions for Hierarchical Supervisory Control under Partial Observation

Jan Komenda, Tomáš Masopust

The fundamental problem in hierarchical supervisory control under partial observation is to find conditions preserving observability between the original (low-level) and the abstra…

eess.SY2019★ 1 cited

A Uniform Approach to Maximal Permissiveness in Modular Control of Discrete-Event Systems

Jan Komenda, Feng Lin, Jan H. van Schuppen

In this paper, a uniform approach to maximal permissiveness in modular control of discrete-event systems is proposed. It is based on three important concepts of modular closed-loop…

math.OC2016★ 10 cited

On a Distributed Computation of Supervisors in Modular Supervisory Control

Jan Komenda, Tomáš Masopust, J. H. van Schuppen

In this paper, we discuss a supervisory control problem of modular discrete-event systems that allows for a distributed computation of supervisors. We provide a characterization an…

math.OC2015★ 13 cited

Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication

Jan Komenda, Tomáš Masopust

In decentralized supervisory control, several local supervisors cooperate to accomplish a common goal (specification). Controllability and coobservability are the key conditions to…

math.OC2015★ 1 cited

Combined Top-down and Bottom-up Approach to Multilevel Supervisory Control

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

Recently, we have proposed two complementary approaches, top-down and bottom-up, to multilevel supervisory control of discrete-event systems. In this paper, we compare and combine…

math.OC2015

A Relaxed Framework for Coordination Control of Discrete-Event Systems

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

In this paper, we simplify the coordination control approach by removing the supervisor for the coordinator from the closed-loop system and relax the restrictions placed on a coord…

math.OC2014★ 2 cited

A Note on Relative Observability in Coordination Control

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

Relative observability has been introduced and studied in the framework of partially observed discrete-event systems as a condition stronger than observability, but weaker than nor…

math.OC2014

Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control

Jan Komenda, Tomáš Masopust

In this paper we present a new approach to decentralized supervisory control of large automata with communicating supervisors. We first generalize the recently developed top-down a…

math.OC2014★ 2 cited

Maximally Permissive Coordination Supervisory Control -- Towards Necessary and Sufficient Conditions

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observation. A new weaker sufficient condition for th…

math.OC2013★ 28 cited

Coordination Control of Discrete-Event Systems Revisited

Jan Komenda, Tomas Masopust, Jan H. van Schuppen

In this paper, we revise and further investigate the coordination control approach proposed for supervisory control of distributed discrete-event systems with synchronous communica…

math.OC2012

On Algorithms and Extensions of Coordination Control of Discrete-Event Systems

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

In this paper, we further develop the coordination control scheme for discrete-event systems based on the Ramadge-Wonham framework. The notions of conditional decomposability, cond…

eess.SY2012★ 41 cited

On Conditional Decomposability

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. I…

math.OC2010★ 54 cited

Supervisory Control Synthesis of Discrete-Event Systems using Coordination Scheme

Jan Komenda, Tomas Masopust, Jan H. van Schuppen

Supervisory control of discrete-event systems with a global safety specification and with only local supervisors is a difficult problem. For global specifications the equivalent co…