54 citations · 213 across the 36 of their papers we have counts for
18 papers · 1 filter
Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification
Jiří Balun, Tomáš Masopust, Petr Osička
Opacity is a property of privacy and security applications asking whether, given a system model, a passive intruder that makes online observations of system's behaviour can ascerta…
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…
On Opacity Verification for Discrete-Event Systems
Jiří Balun, Tomáš Masopust
Opacity is an information flow property characterizing whether a system reveals its secret to an intruder. Verification of opacity for discrete-event systems modeled by automata is…
On Verification of D-Detectability for Discrete Event Systems
Jiří Balun, Tomáš Masopust
Detectability has been introduced as a generalization of state-estimation properties of discrete event systems studied in the literature. It asks whether the current and subsequent…
On the Height of Towers of Subsequences and Prefixes
Štěpán Holub, Tomáš Masopust, Michaël Thomazo
A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of word…
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard
Tomáš Masopust, Markus Krötzsch
An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Strau…