Follow
Jiří Balun
Title
Cited by
Cited by
Year
Comparing the notions of opacity for discrete-event systems
J Balun, T Masopust
Discrete Event Dynamic Systems 31 (4), 553-582, 2021
312021
On opacity verification for discrete-event systems
J Balun, T Masopust
IFAC-PapersOnLine 53 (2), 2075-2080, 2020
92020
On verification of D-detectability for discrete event systems
J Balun, T Masopust
Automatica 133, 109884, 2021
82021
On Verification of Weak and Strong k-step Opacity for Discrete-Event Systems
J Balun, T Masopust
IFAC-PapersOnLine 55 (28), 108-113, 2022
72022
On transformations among opacity notions
J Balun, T Masopust
2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC …, 2022
62022
On Verification of Strong Periodic D-Detectability for Discrete Event Systems
J Balun, T Masopust
IFAC-PapersOnLine 53 (4), 263-268, 2020
52020
Verifying weak and strong k-step opacity in discrete-event systems
J Balun, T Masopust
Automatica 155, 111153, 2023
42023
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations
J Balun, T Masopust
arXiv preprint arXiv:2109.02158, 2021
42021
Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification
J Balun, T Masopust, P Osička
arXiv preprint arXiv:2304.09920, 2023
12023
Modeling of safe timed Petri nets by two-level (max,+) automata
J Komenda, D Zorzenon, J Balun
IFAC-PapersOnLine 55 (28), 212-219, 2022
12022
Weak consistency of P-time event graphs
D Zorzenon, J Balun, J Raisch
IFAC-PapersOnLine 55 (40), 19-24, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–11