On Verification of Strong Periodic D-Detectability for Discrete Event Systems. - Jirí Balun; Tomás Masopust (CoRR, 2019)

On Opacity Verification for Discrete-Event Systems. - Jirí Balun; Tomás Masopust (CoRR, 2019)

On verification of D-detectability for discrete event systems. - Jirí Balun; Tomás Masopust (Autom., 2021)

Comparing the Notions of Opacity for Discete-Event Systems. - Jirí Balun; Tomás Masopust (CoRR, 2021)

K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations. - Jirí Balun; Tomás Masopust (CoRR, 2021)

Comparing the notions of opacity for discrete-event systems. - Jirí Balun; Tomás Masopust (Discret. Event Dyn. Syst., 2021)

On Transformations among Opacity Notions. - Jirí Balun; Tomás Masopust (SMC, 2022)

Weak consistency of P-time event graphs. - Davide Zorzenon; Jirí Balun; Jörg Raisch (CoRR, 2022)

Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. - Jirí Balun; Tomás Masopust; Petr Osicka (MFCS, 2023)

Verifying weak and strong k-step opacity in discrete-event systems. - Jirí Balun; Tomás Masopust (Autom., 2023)