Dr. Tomáš Masopust

Ehemaliges Mitglied

Ehemals Wissenschaftlicher Mitarbeiter in Forschungsgruppe Wissensbasierte Systeme

Neueste Publikationen

Tomáš Masopust, Markus Krötzsch
Partially Ordered Automata and Piecewise Testability
Logical Methods in Computer Science, 17(2), 2021
Details Download

Tomáš Masopust, Markus Krötzsch
Deciding Universality of ptNFAs is PSpace-Complete
In A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jiri Wiedermann, eds., Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018), volume 10706 of LNCS, 413-427, 2018. Springer
Details Download

Tomáš Masopust
Complexity of Verifying Nonblockingness in Modular Supervisory Control
IEEE Transactions on Automatic Control, 63(2):602-607, 2018
Details Download

Tomáš Masopust
Complexity of Infimal Observable Superlanguages
IEEE Transactions on Automatic Control, 63(1):249-254, 2018
Details Download

Markus Krötzsch, Tomáš Masopust, Michaël Thomazo
Complexity of Universality and Related Problems for Partially Ordered NFAs
Information and Computation, 255(1):177-192, August 2017
Details Download

Jan Komenda, Tomáš Masopust
Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication
Discrete Event Dynamic Systems, 27(4):585-608, December 2017
Details Download

Tomáš Masopust, Michaël Thomazo
On boolean combinations forming piecewise testable languages
Theoretical Computer Science, 682:165-179, June 2017
Details Download

Tomáš Masopust
Piecewise Testable Languages and Nondeterministic Automata
In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds., Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics, 67:1--67:14, 2016. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Details Download

Markus Krötzsch, Tomáš Masopust, Michaël Thomazo
On the Complexity of Universality for Partially Ordered NFAs
In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds., Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics, 61:1--61:14, 2016. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Control of an Engineering-Structured Multilevel Discrete-Event System
Proceedings of the International Workshop on Discrete Event Systems (WODES), 103-108, June 2016
Details

Komplette Publikationsliste anzeigen

Editorial Board von Kybernetika

Lehrveranstaltungen

Foundations of Databases and Query Languages (SS 2015)

cfaed
CENTER FOR ADVANCING ELECTRONICS DRESDEN

https://cfaed.tu-dresden.de/