Jan Komenda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jan Komenda has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Tomáš Masopust
Faculty of Science, Palacký University Olomouc, Olomouc, Czechia
39 shared publications Jan H. van Schuppen
Van Schuppen Control Research, Gouden Leeuw 143, 1103 KB Amsterdam, Netherlands
17 shared publications- Jan H. van Schuppen
Delft University of Technology
14 shared publications - Sébastien Lahaye
University of Angers
8 shared publications - Aiwen Lai
Department of Automation, Xiamen University, Xiamen, China
6 shared publications - Davide Zorzenon
Control Systems Group, Technische Universität Berlin, Berlin, Germany
6 shared publications
Latest Publications
- Open Access
Active prognosis and diagnosis of modular discrete-event systems
This paper addresses the verification and enforcement of prognosability and diagnosability for discreteevent systems (DESs) modeled by deterministic finite automata. We establish the equivalence between prognosability (respectively, diagnosability) and pre-normality over a subset of the non-faulty language (respectively, a suffix of the faulty language). We then demonstrate the existence of supremal prognosable (respectively, diagnosable) and normal sublanguages. Furthermore, an algorithm is then designed to compute the supremal controllable, normal, and prognosable (respectively, diagnosable) sublanguages. Since DESs are typically composed of multiple components operating in parallel, pure local supervisors are generally insufficient, as prognosability and diagnosability are global properties of a system. Given the limited work on enforcing prognosability or diagnosability in modular DESs, where these properties are enforced through local supervisors, this paper leverages a refined version of pre-normality to compute modular supervisors for local subsystems. The resulting closed-loop system is shown to be globally controllable, normal, and prognosable/ diagnosable. Examples are provided to illustrate the proposed method.
Open AccessActive prognosis and diagnosis of modular discrete-event systems
This paper addresses the verification and enforcement of prognosability and diagnosability for discreteevent systems (DESs) modeled by deterministic finite automata. We establish the equivalence between prognosability (respectively, diagnosability) and pre-normality over a subset of the non-faulty language (respectively, a suffix of the faulty language). We then demonstrate the existence of supremal prognosable (respectively, diagnosable) and normal sublanguages. Furthermore, an algorithm is then designed to compute the supremal controllable, normal, and prognosable (respectively, diagnosable) sublanguages. Since DESs are typically composed of multiple components operating in parallel, pure local supervisors are generally insufficient, as prognosability and diagnosability are global properties of a system. Given the limited work on enforcing prognosability or diagnosability in modular DESs, where these properties are enforced through local supervisors, this paper leverages a refined version of pre-normality to compute modular supervisors for local subsystems. The resulting closed-loop system is shown to be globally controllable, normal, and prognosable/ diagnosable. Examples are provided to illustrate the proposed method.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (5) , 2873-2886
Supervisory Control for Active Diagnosis in Labeled Petri Nets Under Coordinated Sensor and Actuator Attacks
In this article, we formalize and solve the problems of active diagnosis for discrete event systems modeled with labeled Petri nets that may enter deadlocks under coordinated sensor and actuator attacks. Given a plant, a sensor attacker has the ability to edit certain sensor readings to conceal the faults to confuse the operator. An actuator attacker may exist in the control channel between a plant and its supervisor, and has the ability to tamper with the control actions commanded by the supervisor such that the plant remains nondiagnosable under the control of the supervisor. Furthermore, sensor and actuator attackers collaborate to attack a plant and maintain furtivity, i.e., their presence should not be discovered by the operator. In order to test the diagnosability under such attacks, a structure, called an extended verifier, is established. It is shown that a labeled Petri net that may enter deadlocks under coordinated sensor and actuator attacks is diagnosable if and only if the verifier does not contain the confused cycles composed exclusively of pairs of faulty states and normal states. This result also provides necessary and sufficient conditions for active diagnosis under coordinated sensor and actuator attacks by designing a maximally resilient supervisor. Examples are presented to demonstrate the proposed method.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (5) , 2873-2886
Supervisory Control for Active Diagnosis in Labeled Petri Nets Under Coordinated Sensor and Actuator Attacks
In this article, we formalize and solve the problems of active diagnosis for discrete event systems modeled with labeled Petri nets that may enter deadlocks under coordinated sensor and actuator attacks. Given a plant, a sensor attacker has the ability to edit certain sensor readings to conceal the faults to confuse the operator. An actuator attacker may exist in the control channel between a plant and its supervisor, and has the ability to tamper with the control actions commanded by the supervisor such that the plant remains nondiagnosable under the control of the supervisor. Furthermore, sensor and actuator attackers collaborate to attack a plant and maintain furtivity, i.e., their presence should not be discovered by the operator. In order to test the diagnosability under such attacks, a structure, called an extended verifier, is established. It is shown that a labeled Petri net that may enter deadlocks under coordinated sensor and actuator attacks is diagnosable if and only if the verifier does not contain the confused cycles composed exclusively of pairs of faulty states and normal states. This result also provides necessary and sufficient conditions for active diagnosis under coordinated sensor and actuator attacks by designing a maximally resilient supervisor. Examples are presented to demonstrate the proposed method.
- 16 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 2114-2119
Enforcement of Critical Observability in Modular Discrete-Event Systems
In safety-critical applications, the ability to distinguish between critical and noncritical states based on observations, known as critical observability (CO), is essential for ensuring reliability and security. We address the enforcement of CO in discrete-event systems (DES) through supervisory control. While a supremal CO sublanguage does not exist, we overcome this challenge by leveraging the concept of normality, proposing an algorithm to compute the least restrictive closed-loop system that is CO. We extend this approach to modular DES, showing how CO can be enforced locally to achieve global enforcement, thereby addressing scalability challenges. Finally, we integrate our framework with safety specifications, enabling the synthesis of supervisors that concurrently ensure both safety and CO.
- 16 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 2114-2119
Enforcement of Critical Observability in Modular Discrete-Event Systems
In safety-critical applications, the ability to distinguish between critical and noncritical states based on observations, known as critical observability (CO), is essential for ensuring reliability and security. We address the enforcement of CO in discrete-event systems (DES) through supervisory control. While a supremal CO sublanguage does not exist, we overcome this challenge by leveraging the concept of normality, proposing an algorithm to compute the least restrictive closed-loop system that is CO. We extend this approach to modular DES, showing how CO can be enforced locally to achieve global enforcement, thereby addressing scalability challenges. Finally, we integrate our framework with safety specifications, enabling the synthesis of supervisors that concurrently ensure both safety and CO.
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 3392-3397
Decentralized Fault Diagnosis for Constant-Time Automata
This letter investigates the verification problem of codiagnosability for discrete-event systems modeled by constant-time automata (CTAs). Codiagnosability requires that the occurrence of a fault event necessarily be detected by at least one local diagnostic agent within a finite number of events after the fault event occurs. In the present work, we first construct a verifier to check the codiagnosability of CTAs in the decentralized architecture. Additionally, an inappropriate, lower-complexity statement concerning diagnosability verification in our previous work is corrected. This correction prompts us to investigate the underlying reasons for increased complexity and to propose a condition for complexity reduction based on the verifier. Furthermore, another important contribution is our demonstration of the equivalence between diagnosability and codiagnosability for CTAs, an equivalence that does not hold in the framework of logical finite state automata. This equivalence serves as another verification technique for the codiagnosability of CTAs.
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 3392-3397
Decentralized Fault Diagnosis for Constant-Time Automata
This letter investigates the verification problem of codiagnosability for discrete-event systems modeled by constant-time automata (CTAs). Codiagnosability requires that the occurrence of a fault event necessarily be detected by at least one local diagnostic agent within a finite number of events after the fault event occurs. In the present work, we first construct a verifier to check the codiagnosability of CTAs in the decentralized architecture. Additionally, an inappropriate, lower-complexity statement concerning diagnosability verification in our previous work is corrected. This correction prompts us to investigate the underlying reasons for increased complexity and to propose a condition for complexity reduction based on the verifier. Furthermore, another important contribution is our demonstration of the equivalence between diagnosability and codiagnosability for CTAs, an equivalence that does not hold in the framework of logical finite state automata. This equivalence serves as another verification technique for the codiagnosability of CTAs.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11239-11249
Active Diagnosis of Time-Interval Automata: Time Perspectives
Language diagnosability captures the capability of the system to detect faults based on observations. When a system is not diagnosable, supervisory control can be used to enforce its diagnosability to prevent the faults from occurring silently, known as the active diagnosis problem. Note that in the context of timed discrete-event systems, an observation contains not only the sequence of the events but also their time information. Therefore, two sequences consisting of the same events but with different occurrence time instants can still reveal the occurrence of faults. This fact motivates us to consider enforcing the diagnosability of a timed discrete-event system by regulating the occurrence time instants of certain controllable events. In this paper, we first construct a verifier for a time-interval automaton to verify its diagnosability. Then, based on the verifier, we enforce the diagnosability of a time-interval automaton by restricting the time intervals of certain controllable events and disabling some controllable events.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11239-11249
Active Diagnosis of Time-Interval Automata: Time Perspectives
Language diagnosability captures the capability of the system to detect faults based on observations. When a system is not diagnosable, supervisory control can be used to enforce its diagnosability to prevent the faults from occurring silently, known as the active diagnosis problem. Note that in the context of timed discrete-event systems, an observation contains not only the sequence of the events but also their time information. Therefore, two sequences consisting of the same events but with different occurrence time instants can still reveal the occurrence of faults. This fact motivates us to consider enforcing the diagnosability of a timed discrete-event system by regulating the occurrence time instants of certain controllable events. In this paper, we first construct a verifier for a time-interval automaton to verify its diagnosability. Then, based on the verifier, we enforce the diagnosability of a time-interval automaton by restricting the time intervals of certain controllable events and disabling some controllable events.
- 15 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 694-699
On the Existence of Simulations for Max-Plus Automata
The concept of weighted simulation has recently been defined for max-plus automata. This paper contributes to identifying the structural conditions for which a weighted simulation might exist. In particular, it provides verifiable sufficient conditions for the existence of a weighted simulation.
- 15 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 694-699
On the Existence of Simulations for Max-Plus Automata
The concept of weighted simulation has recently been defined for max-plus automata. This paper contributes to identifying the structural conditions for which a weighted simulation might exist. In particular, it provides verifiable sufficient conditions for the existence of a weighted simulation.
- 6 April 2024
- Published by Elsevier in ISA Transactions
- Vol. 148, 237-246
Verification of initial-and-final-state opacity for unambiguous weighted automata
- 6 April 2024
- Published by Elsevier in ISA Transactions
- Vol. 148, 237-246
Verification of initial-and-final-state opacity for unambiguous weighted automata
- Open Access
- 1 February 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (1) , 199-250
Switched max-plus linear-dual inequalities: cycle time analysis and applications
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 dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches; ii. a complete trajectory of the robot including start-up and shut-down transients.
- 1 February 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (1) , 199-250
Open AccessSwitched max-plus linear-dual inequalities: cycle time analysis and applications
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 dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches; ii. a complete trajectory of the robot including start-up and shut-down transients.
- 16 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (6) , 3796-3807
Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality
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 normal sublanguage of the specification. Such controllers are called maximally permissive normal supervisors. The challenge in modular systems is to find conditions under which the global nonblocking and maximally permissive normal supervisor can be achieved locally as the parallel composition of local normal supervisors. We show that a structural concept of hierarchical supervisory control called modified observation consistency (MOC) is such a condition.However, the algorithmic verification of MOC is an open problem, and therefore it is necessary to find easily-verifiable conditions that ensure MOC. We show that the condition that all shared events are observable is such a condition.Considering specifications, we examine both local specifications, where each module has its own specification, and global specifications.Combining our results for normality with the existing results for controllability yields the local synthesis of the nonblocking and maximally permissive controllable and normal supervisor. Finally, we illustrate the results on an industrial case study of the patient table of an MRI scanner.
- 16 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (6) , 3796-3807
Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality
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 normal sublanguage of the specification. Such controllers are called maximally permissive normal supervisors. The challenge in modular systems is to find conditions under which the global nonblocking and maximally permissive normal supervisor can be achieved locally as the parallel composition of local normal supervisors. We show that a structural concept of hierarchical supervisory control called modified observation consistency (MOC) is such a condition.However, the algorithmic verification of MOC is an open problem, and therefore it is necessary to find easily-verifiable conditions that ensure MOC. We show that the condition that all shared events are observable is such a condition.Considering specifications, we examine both local specifications, where each module has its own specification, and global specifications.Combining our results for normality with the existing results for controllability yields the local synthesis of the nonblocking and maximally permissive controllable and normal supervisor. Finally, we illustrate the results on an industrial case study of the patient table of an MRI scanner.
- Open Access
Switched max-plus linear-dual inequalities: cycle time analysis and applications
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 dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches; ii. a complete trajectory of the robot including start-up and shut-down transients.
Open AccessSwitched max-plus linear-dual inequalities: cycle time analysis and applications
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 dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches; ii. a complete trajectory of the robot including start-up and shut-down transients.