Publications of Tomas Masopust

Journal Articles

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

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

Tomáš Masopust
Complexity of Verifying Nonblockingness in Modular Supervisory Control
IEEE Transactions on Automatic Control, 63(2):602-607, 2018
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

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

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

Jan Komenda, Tomáš Masopust
Distributed computation of supremal conditionally-controllable sublanguages
International Journal of Control, 89(2):424-436, 2016
Details

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Coordination control of discrete-event systems revisited
Discrete Event Dynamic Systems, 25(1):65-94, 2015
Details Download

Tomáš Masopust
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
International Journal of Foundations of Computer Science, 24(3):319-328, 2014
Details Download

Jürgen Dassow, Tomáš Masopust
On restricted context-free grammars
Journal of Computer and System Sciences, 78(1):293–304, 2012
Details Download

Galina Jirásková, Tomáš Masopust
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science, 449:93–105, 2012
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
On conditional decomposability
Systems & Control Letters, 61(12):1260–1268, 2012
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Supervisory control synthesis of discrete-event systems using a coordination scheme
Automatica, 48(2):247-254, 2012
Details Download

Tomáš Masopust
A note on controllability of deterministic context-free systems
Automatica, 48(8):1934-1937, 2012
Details Download

Olivier Boutin, Jan Komenda, Tomáš Masopust, Nicola Pambakian, Jan H. van Schuppen, Pia L. Kempker, André C. M. Ran
Control of Distributed Systems: Tutorial and Overview
European Journal of Control, 17(5-6):579-602, 2011
Details Download

Erzsébet Csuhaj-Varjú, Tomáš Masopust, György Vaszil
Blackhole Pushdown Automata
Fundamenta Informaticae, 112(2-3):137-156, 2011
Details Download

Galina Jirásková, Tomáš Masopust
Complexity in Union-Free Regular Languages
International Journal of Foundations of Computer Science, 22(7):1639-1653, 2011
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
Systems & Control Letters, 60(7):492-502, 2011
Details Download

Zbyněk Křivka, Tomáš Masopust
Cooperating Distributed Grammar Systems with Random Context Grammars as Components
Acta Cybernetica, 20(2):269-283, 2011
Details Download

Filip Goldefus, Tomáš Masopust, Alexander Meduna
Left-forbidding cooperating distributed grammar systems
Theoretical Computer Science, 411(40-42):3661-3667, 2010
Details Download

Tomáš Masopust
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Fundamenta Informaticae, 104(1-2):111-124, 2010
Details Download

Tomáš Masopust
Simple restriction in context-free rewriting
Journal of Computer and System Sciences, 76(8):837-846, 2010
Details Download

Tomáš Masopust
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals
Fundamenta Informaticae, 99(4):473-480, 2010
Details Download

Tomáš Masopust, Alexander Meduna
On context-free rewriting with a simple restriction and its computational completeness
RAIRO - Theoretical Informatics and Applications, 43(2):365-378, 2009
Details Download

Tomáš Masopust
On the descriptional complexity of scattered context grammars
Theoretical Computer Science, 410(1):108-112, 2009
Details Download

Tomáš Masopust, Alexander Meduna
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops
Acta Cybernetica, 19(2):537-552, 2009
Details Download

Tomáš Masopust
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components
International Journal of Foundations of Computer Science, 20(2):331-340, 2009
Details Download

Tomáš Masopust
Descriptional complexity of multi-parallel grammars
Information Processing Letters, 108(2):68-70, 2008
Details Download

Tomáš Masopust, Alexander Meduna, Jirí Simácek
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars
Acta Cybernetica, 18(4):783-793, 2008
Details Download

Tomáš Masopust, Jirí Techet
Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof
Discrete Mathematics & Theoretical Computer Science, 10(2):39-46, 2008
Details Download

Tomáš Masopust, Alexander Meduna
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae, 87(3-4):407-415, 2008
Details Download

Tomáš Masopust, Alexander Meduna
Descriptional complexity of semi-conditional grammars
Information Processing Letters, 104(1):29-31, 2007
Details Download

Alexander Meduna, Tomáš Masopust
Self-Regulating Finite Automata
Acta Cybernetica, 18(1):135-153, 2007
Details Download

Proceedings Articles

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

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

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

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

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
On a Distributed Computation of Supervisors in Modular Supervisory Control
Proc. of International Conference on Complex Systems Engineering (ICCSE), 2015. IEEE
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Multilevel Coordination Control of Partially Observed Modular DES
In A. Astolfi, eds., American Control Conference (ACC 2015), 384-389, 2015
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Relative Observability in Coordination Control
In B. Lennartson, eds., 2015 IEEE International Conference on Automation Science and Engineering (CASE), 75-80, 2015. IEEE
Details Download

Tomáš Masopust, Michaël Thomazo
On the Complexity of k-Piecewise Testability and the Depth of Automata
In I. Potapov, eds., Proc. 19th International Conference on Developments in Language Theory (DLT'15), volume 9168 of LNCS, 364-376, 2015. Springer
Details Download

Štěpán Holub, Galina Jirásková, Tomáš Masopust
On Upper and Lower Bounds on the Length of Alternating Towers
In E. Csuhaj-Varju, M. Dietzfelbinger, Z. Esik, eds., Mathematical Foundations of Computer Science (MFCS), volume 8634 of LNCS, 315-326, 2014. Springer
Details Download

Jan Komenda, Tomáš Masopust
Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control
In F. Jabbari and A. R. Teel, eds., Proc. of 53rd IEEE Conference on Decision and Control (CDC), 5149-5155, 2014. IEEE
Details Download

Wojciech Czerwiński, Wim Martens, Tomáš Masopust
Efficient Separability of Regular Languages by Subsequences and Suffixes
In F. V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg, eds., Proc. of 40th International Colloquium on Automata, Languages, and Programming (ICALP), volume 7966 of LNCS, 150-161, 2013. Springer
Details Download

Galina Jirásková, Tomáš Masopust
On the State Complexity of the Reverse of R- and J-Trivial Regular Languages
In H. Jurgensen and R. Reis, eds., Proc. of 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS), volume 8031 of LNCS, 136-147, 2013. Springer
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Multilevel coordination control of modular DES
Proc. of 52nd Annual Conference on Decision and Control (CDC), 6323-6328, 2013. IEEE
Details Download

Jan Komenda, Tomáš Masopust
A bridge between decentralized and coordination control
Proc. of 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 966-972, 2013. IEEE
Details Download

Galina Jirásková, Tomáš Masopust
On Properties and State Complexity of Deterministic State-Partition Automata
In J. C. M. Baeten, T. Ball, F. S. de Boer, eds., Proc. of 7th International Conference on Theoretical Computer Science (IFIP TCS), volume 7604 of LNCS, 164-178, 2012. Springer
Details Download

Galina Jirásková, Tomáš Masopust
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
In N. Moreira, R. Reis, eds., Proc. of 17th International Conference on Implementation and Application of Automata (CIAA), volume 7381 of LNCS, 229-239, 2012. Springer
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
On Algorithms and Extensions of Coordination Control of Discrete-Event Systems
In A. Ramírez-Treviño, J.-J. Lesage, M. Silva, eds., Proc. of 11th International Workshop on Discrete Event Systems (WODES), 245-250, 2012. IFAC
Details Download

Olivier Boutin, Jan Komenda, Tomáš Masopust, Klaus Schmidt, Jan H. van Schuppen
Hierarchical control with partial observations: Sufficient conditions
Proc. of 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), 1817-1822, 2011. IEEE
Details Download

Galina Jirásková, Tomáš Masopust
State Complexity of Projected Languages
In M. Holzer, M. Kutrib, G. Pighizzini, eds., Proc. of 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS), volume 6808 of LNCS, 198-211, 2011. Springer
Details Download

Erzsébet Csuhaj-Varjú, Tomáš Masopust, György Vaszil
Blackhole State-Controlled Regulated Pushdown Automata
In H. Bordihn, R. Freund, T. Hinze, M. Holzer, M. Kutrib, F. Otto, eds., Proc. of Second Workshop on Non-Classical Models for Automata and Applications (NCMA), volume band 263 of books@ocg.at, 45-56, 2010. Österreichische Computer Gesellschaft
Details Download

Galina Jirásková, Tomáš Masopust
Complexity in Union-Free Regular Languages
In Y. Gao, H. Lu, S. Seki, S. Yu, eds., Proc. of 14th International Conference on Developments in Language Theory, volume 6224 of LNCS, 255-266, 2010. Springer
Details Download

Zbyněk Křivka, Tomáš Masopust
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking
Proc. of 11th Italian Conference on Theoretical Computer Science (ICTCS), 129-135, 2009
Details Download

Tomáš Masopust
Regulated Nondeterminism in PDAs: The Non-Regular Case
Proc. of Workshop on Non-Classical Models of Automata and Applications (NCMA), 181-194, 2009
Details Download

Tomáš Masopust, Alexander Meduna
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvemen
Proc. of 11th International Workshop on Descriptional Complexity of Formal Systems (DCFS), 183-192, 2009
Details Download

Tomáš Masopust
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
In A. H. Dediu, A. M. Ionescu, C. Martín-Vide, eds., Proc. of 3rd International Conference Language and Automata Theory and Applications (LATA), volume 5457 of LNCS, 554-565, 2009. Springer
Details Download

Tomáš Masopust, Alexander Meduna
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops
Proc. of 12th International Conference on Automata and Formal Languages (AFL), 325-336, 2008
Details Download

Tomáš Masopust, Alexander Meduna
Descriptional Complexity of Generalized Forbidding Grammars
Proc. of 9th International Workshop on Descriptional Complexity of Formal Systems (DCFS), 170-177, 2007
Details Download

Tomáš Masopust, Alexander Meduna
Descriptional Complexity of Grammars Regulated by Context Conditions
Proc. of Language and Automata Theory and Applications (LATA), 403-412, 2007
Details Download

Book Chapters

Jan Komenda, Tomáš Masopust
Coordination Control of Distributed Discrete-Event Systems
In J.H. van Schuppen and T. Villa, eds., Coordination Control of Distributed Systems, volume 456 of Lecture Notes in Control and Information Sciences, 137-144. Springer, 2015
Details

Jan Komenda, Tomáš Masopust
Supervisory Control of Discrete-Event Systems
In J.H. van Schuppen and T. Villa, eds., Coordination Control of Distributed Systems, volume 456 of Lecture Notes in Control and Information Sciences, 129-136. Springer, 2015
Details

Stefan Haar, Tomáš Masopust
Languages, Decidability, and Complexity
In C. Seatzu and M. Silva and J.H. van Schuppen, eds., Control of Discrete-event Systems, volume 433 of Lecture Notes in Control and Information Sciences, 23-43. Springer, 2013
Details

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Supervisory Control of Distributed Discrete-Event Systems
In C. Seatzu and M. Silva and J.H. van Schuppen, eds., Control of Discrete-event Systems, volume 433 of Lecture Notes in Control and Information Sciences, 107-126. Springer, 2013
Details

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Coordination Control of Distributed Discrete-Event Systems
In C. Seatzu and M. Silva and J.H. van Schuppen, eds., Control of Discrete-event Systems, volume 433 of Lecture Notes in Control and Information Sciences, 147-167. Springer, 2013
Details

Tomáš Masopust, Jan H. van Schuppen
Supervisory Control with Complete Observations
In C. Seatzu and M. Silva and J.H. van Schuppen, eds., Control of Discrete-event Systems, volume 433 of Lecture Notes in Control and Information Sciences, 45-64. Springer, 2013
Details

Technical Reports

Štěpán Holub, Tomáš Masopust, Michaël Thomazo
Alternating Towers and Piecewise Testable Separators
Technical Report, arXiv.org, volume CoRR abs/1409.3943, September 2014
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
A Note on Relative Observability in Coordination Control
Technical Report, arXiv.org, volume CoRR abs/1404.2195, April 2014
Details Download

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions
Technical Report, arXiv.org, volume CoRR abs/1403.4762, March 2014
Details Download

Tomáš Masopust, Michaël Thomazo
On k-piecewise testability (preliminary report)
Technical Report, arXiv.org, volume CoRR abs/1412.1641, December 2014
Details Download

Tomáš Masopust
A Note on Undecidability of Observation Consistency for Non-Regular Languages
Technical Report, arXiv.org, volume CoRR abs/1201.1754, January 2012
Details Download

Tomáš Masopust
Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms
Technical Report, arXiv.org, volume CoRR abs/1004.3635, April 2010
Details Download