Discrete-Event Systems and Theoretical Computer Science Research Group

We are a group of people interested in Discrete-Event Systems and Theoretical Computer Science. In particular, we are interested in

Verification and control of discrete-event systems
Cyber-physical systems
Automata theory
Petri nets
Complexity theory
Databases

If you are interested in these or similar topics, please feel free to join us face to face at our seminar or at the DES-TCS google group.

[upravit]

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

Jan Komenda, Tomáš Masopust
IEEE Transactions on Automatic Control, 2024

Hierarchical Supervisory Control under Partial Observation: Normality

Jan Komenda, Tomáš Masopust
IEEE Transactions on Automatic Control 68(12), 7286-7298, 2023

Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification

Jiří Balun, Petr Osička, Tomáš Masopust
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), 2023

Verifying Weak and Strong k-Step Opacity in Discrete-Event Systems

Jiří Balun, Tomáš Masopust
Automatica 155, 111153, 2023

On Transformations among Opacity Notions

Jiří Balun, Tomáš Masopust
IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2022

On Verification of Weak and Strong k-Step Opacity for Discrete-Event Systems

Jiří Balun, Tomáš Masopust
IFAC PapersOnLine 55(28), 108-113, 2022

Weak consistency of P-time event graphs

Davide Zorzenon, Jiří Balun, Jörg Raisch
COSY, 2022

Modeling of safe timed Petri nets by two-level (max,+) automata

Jan Komenda, Jiří Balun, Davide Zorzenon
WODES, 2022

Modular Control of Discrete-Event Systems using Similarity

Yingying Liu, Tomáš Masopust, Jan Komenda, Zhiwu Li
Automatica 142, 110431, 2022

Comparing the Notions of Opacity for Discrete-Event Systems

Jiří Balun, Tomáš Masopust
Discrete Event Dynamic Systems 31, 2021

All publications

[upravit]

IGA PrF 2023 026

Martin Trnečka
Jiří Balun, Jiří Valůšek

IGA PrF 2022 018

Martin Trnečka
Jiří Balun, Jiří Valůšek

Verification and Control of Networked Discrete Event Systems

Tomáš Masopust, Jan Komenda
Jiří Balun, Stéphane Lafortune, Spyros Reveliotis, Feng Lin

Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems

Jan Komenda, Jörg Raisch
Tomáš Masopust, Thomas Moor

All projects

[upravit]

Coordination control plug-in

Tomáš Masopust
website
Description: Coordination Control Plug-In for libFAUDES C++ library (distributed under conditions of the GNU Lesser General Public License LGPL)

Version: released on Feb 5, 2012. Included in the official libFAUDES distribution since version 2.21e.
Description: Complete coordination control synthesis procedure for the computation of the supremal conditionally controllable sublanguage of a given prefix-closed global specification language K and a set of local subsystems, corresponding supervisors, and the supervised coordinator. (The case of non-prefix-closed global specifications is under investigation...)
Updates: Polynomial algorithm for conditional decomposability included since version 2.26

Piecewise testability Plug-In

Eliška Foltasová
Thesis: Piecewise testability
Tool
Description: This tool implements three algorithms to verify piecewise testability. The tool is a plug-in for the C++ library libFAUDES.

Relative observability Plug-In

Marián Pochyba
Thesis: Relative observability
Tool
Description: This tool implements the algorithms for verification of observability and relative observability of systems (languages) represented by finite automata as a plug-in for the C++ library libFAUDES.