I agree that this site is using cookies. You can find further informations here.
X
Masopust, Tomas
107  results:
Search for persons X
?
1

Supervisory Control of Modular Discrete-Event Systems Under..:

Komenda, Jan ; Masopust, Tomáš
IEEE Transactions on Automatic Control.  69 (2024)  6 - p. 3796-3807 , 2024
Link: https://doi.org/10.1109/..
 
?
2

Hierarchical Supervisory Control Under Partial Observation:..:

Komenda, Jan ; Masopust, Tomáš
IEEE Transactions on Automatic Control.  68 (2023)  12 - p. 7286-7298 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Verifying weak and strong k-step opacity in discrete-event ..:

Balun, Jiří ; Masopust, Tomáš
Automatica.  155 (2023)  - p. 111153 , 2023
Link: https://doi.org/10.1016/..
 
?
4

Modular control of discrete-event systems using similarity:

Liu, Yingying ; Komenda, Jan ; Masopust, Tomáš.
Automatica.  142 (2022)  - p. 110431 , 2022
Link: https://doi.org/10.1016/..
 
?
5

On Transformations among Opacity Notions:

, In: 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC),
Balun, Jiri ; Masopust, Tomas - p. 3012-3017 , 2022
Link: https://doi.org/10.1109/..
 
?
6

Polynomial-time optimal liveness enforcement for guidepath-..:

Reveliotis, Spyros ; Masopust, Tomáš ; Ibrahim, Michael
Nonlinear Analysis: Hybrid Systems.  41 (2021)  - p. 101058 , 2021
Link: https://doi.org/10.1016/..
 
?
7

Comparing the notions of opacity for discrete-event systems:

Balun, Jiří ; Masopust, Tomáš
Discrete Event Dynamic Systems.  31 (2021)  4 - p. 553-582 , 2021
Link: https://doi.org/10.1007/..
 
?
8

On verification of D-detectability for discrete event syste..:

Balun, Jiří ; Masopust, Tomáš
Automatica.  133 (2021)  - p. 109884 , 2021
Link: https://doi.org/10.1016/..
 
?
9

Complexity of detectability, opacity and A-diagnosability f..:

Masopust, Tomáš ; Yin, Xiang
Automatica.  101 (2019)  - p. 290-295 , 2019
Link: https://doi.org/10.1016/..
 
?
10

On the height of towers of subsequences and prefixes:

Holub, Štěpán ; Masopust, Tomáš ; Thomazo, Michaël
Information and Computation.  265 (2019)  - p. 77-93 , 2019
Link: https://doi.org/10.1016/..
 
?
11

Deciding detectability for labeled Petri nets:

Masopust, Tomáš ; Yin, Xiang
Automatica.  104 (2019)  - p. 238-241 , 2019
Link: https://doi.org/10.1016/..
 
?
12

Complexity of deciding detectability in discrete event syst..:

Masopust, Tomáš
Automatica.  93 (2018)  - p. 257-261 , 2018
Link: https://doi.org/10.1016/..
 
?
13

Separability by piecewise testable languages is PTime-compl..:

Masopust, Tomáš
Theoretical Computer Science.  711 (2018)  - p. 109-114 , 2018
Link: https://doi.org/10.1016/..
 
?
14

Computation of controllable and coobservable sublanguages i..:

Komenda, Jan ; Masopust, Tomáš
Discrete Event Dynamic Systems.  27 (2017)  4 - p. 585-608 , 2017
Link: https://doi.org/10.1007/..
 
?
15

Complexity of universality and related problems for partial..:

Krötzsch, Markus ; Masopust, Tomáš ; Thomazo, Michaël
Information and Computation.  255 (2017)  - p. 177-192 , 2017
Link: https://doi.org/10.1016/..
 
1-15