Control of distributed systems: Tutorial and overview JH van Schuppen, O Boutin, PL Kempker, J Komenda, T Masopust, ... European journal of control 17 (5-6), 579-602, 2011 | 67 | 2011 |
Efficient separability of regular languages by subsequences and suffixes W Czerwiński, W Martens, T Masopust Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 66 | 2013 |
Supervisory control synthesis of discrete-event systems using a coordination scheme J Komenda, T Masopust, JH Van Schuppen Automatica 48 (2), 247-254, 2012 | 59 | 2012 |
Coordination control of discrete-event systems revisited J Komenda, T Masopust, JH van Schuppen Discrete Event Dynamic Systems 25, 65-94, 2015 | 51 | 2015 |
Complexity of deciding detectability in discrete event systems T Masopust Automatica 93, 257-261, 2018 | 49 | 2018 |
On Conditional Decomposability J Komenda, T Masopust, JH van Schuppen Systems & Control Letters 61 (12), 1260-1268, 2012 | 48 | 2012 |
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems T Masopust, X Yin Automatica 101, 290-295, 2019 | 40 | 2019 |
Comparing the notions of opacity for discrete-event systems J Balun, T Masopust Discrete Event Dynamic Systems 31 (4), 553-582, 2021 | 35 | 2021 |
Complexity in union-free regular languages G Jirásková, T Masopust International Journal of Foundations of Computer Science 22 (07), 1639-1653, 2011 | 33 | 2011 |
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator J Komenda, T Masopust, JH Van Schuppen Systems & Control Letters 60 (7), 492-502, 2011 | 32 | 2011 |
Deciding detectability for labeled Petri nets T Masopust, X Yin Automatica 104, 238-241, 2019 | 30 | 2019 |
Control of an engineering-structured multilevel discrete-event system J Komenda, T Masopust, JH van Schuppen 2016 13th International Workshop on Discrete Event Systems (WODES), 103-108, 2016 | 26 | 2016 |
Complexity of universality and related problems for partially ordered NFAs M Krötzsch, T Masopust, M Thomazo Information and Computation 255, 177-192, 2017 | 25 | 2017 |
On a structural property in the state complexity of projected regular languages G Jirásková, T Masopust Theoretical Computer Science 449, 93-105, 2012 | 24 | 2012 |
Cooperating distributed grammar systems with permitting grammars as components E Csuhaj-Varjú, T Masopust, G Vaszil Romanian Journal of Information Science and Technology 12 (2), 175-189, 2009 | 19 | 2009 |
Multilevel coordination control of modular DES J Komenda, T Masopust, JH van Schuppen 52nd IEEE Conference on Decision and Control, 6323-6328, 2013 | 18 | 2013 |
Left-forbidding cooperating distributed grammar systems F Goldefus, T Masopust, A Meduna Theoretical Computer Science 411 (40-42), 3661-3667, 2010 | 18 | 2010 |
On restricted context-free grammars J Dassow, T Masopust Journal of Computer and System Sciences 78 (1), 293-304, 2012 | 17 | 2012 |
Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems J Komenda, T Masopust, JH van Schuppen Workshop on Discrete-Event Systems 10 (1), 426-431, 2010 | 17 | 2010 |
Complexity in union-free regular languages G Jirásková, T Masopust International Conference on Developments in Language Theory, 255-266, 2010 | 17 | 2010 |