Tomás Masopust

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 52

Top Venues

CoRR

IEEE Trans. Autom. Control.

Autom.

Discret. Event Dyn. Syst.

Publications

Tomás Masopust, Petr Osicka
On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems. CoRR (2024)
Jan Komenda, Tomás Masopust
Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality. IEEE Trans. Autom. Control. 69 (6) (2024)
Jirí Balun, Tomás Masopust, Petr Osicka
Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. MFCS (2023)
Jan Komenda, Tomás Masopust
Supervisory Control of Modular Discrete-Event Systems under Partial Observation: Normality. CoRR (2023)
Jan Komenda, Tomás Masopust
Hierarchical Supervisory Control Under Partial Observation: Normality. IEEE Trans. Autom. Control. 68 (12) (2023)
Jirí Balun, Tomás Masopust
Verifying weak and strong k-step opacity in discrete-event systems. Autom. 155 (2023)
Jirí Balun, Tomás Masopust, Petr Osicka
Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification. CoRR (2023)
Yingying Liu, Jan Komenda, Tomás Masopust, Zhiwu Li
Modular control of discrete-event systems using similarity. Autom. 142 (2022)
Jan Komenda, Tomás Masopust
Hierarchical and Modular Supervisory Control under Partial Observation: Normality. CoRR (2022)
Jirí Balun, Tomás Masopust
Verifying Weak and Strong k-Step Opacity in Discrete-Event Systems. CoRR (2022)
Jirí Balun, Tomás Masopust
On Transformations among Opacity Notions. SMC (2022)
Jirí Balun, Tomás Masopust
Comparing the notions of opacity for discrete-event systems. Discret. Event Dyn. Syst. 31 (4) (2021)
Tomás Masopust, Markus Krötzsch
Partially Ordered Automata and Piecewise Testability. Log. Methods Comput. Sci. 17 (2) (2021)
Jirí Balun, Tomás Masopust
Comparing the Notions of Opacity for Discete-Event Systems. CoRR (2021)
Jirí Balun, Tomás Masopust
On verification of D-detectability for discrete event systems. Autom. 133 (2021)
Jirí Balun, Tomás Masopust
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations. CoRR (2021)
Tomás Masopust
Critical Observability for Automata and Petri Nets. IEEE Trans. Autom. Control. 65 (1) (2020)
Spyros A. Reveliotis, Tomás Masopust
Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems. IEEE Trans. Autom. Control. 65 (7) (2020)
Jan Komenda, Tomás Masopust
Conditions for Hierarchical Supervisory Control under Partial Observation. CoRR (2019)
Spyros A. Reveliotis, Tomás Masopust
Some new results on the state liveness of open guidepath-based traffic systems. MED (2019)
Jirí Balun, Tomás Masopust
On Opacity Verification for Discrete-Event Systems. CoRR (2019)
Jirí Balun, Tomás Masopust
On Verification of Strong Periodic D-Detectability for Discrete Event Systems. CoRR (2019)
Stepan Holub, Tomás Masopust, Michaël Thomazo
On the height of towers of subsequences and prefixes. Inf. Comput. 265 (2019)
Liyong Lin, Tomás Masopust, Walter Murray Wonham, Rong Su
Automatic Generation of Optimal Reductions of Distributions. IEEE Trans. Autom. Control. 64 (3) (2019)
Tomás Masopust, Markus Krötzsch
Partially Ordered Automata and Piecewise Testability. CoRR (2019)
Tomás Masopust, Xiang Yin
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems. Autom. 101 (2019)
Tomás Masopust
Complexity of Verifying Nonblockingness in Modular Supervisory Control. IEEE Trans. Autom. Control. 63 (2) (2018)
Tomás Masopust, Markus Krötzsch
Deciding Universality of ptNFAs is PSpace-Complete. SOFSEM (2018)
Tomás Masopust
Complexity of Infimal Observable Superlanguages. IEEE Trans. Autom. Control. 63 (1) (2018)
Tomás Masopust
Complexity of deciding detectability in discrete event systems. Autom. 93 (2018)
Tomás Masopust, Xiang Yin
Deciding Detectability for Labeled Petri Nets. CoRR (2018)
Tomás Masopust
Separability by piecewise testable languages is PTime-complete. Theor. Comput. Sci. 711 (2018)
Tomás Masopust
Critical Observability for Automata and Petri Nets. CoRR (2018)
Liyong Lin, Tomás Masopust, Walter Murray Wonham, Rong Su
Automatic Generation of Optimal Reductions of Distributions. CoRR (2018)
Tomás Masopust, Michaël Thomazo
On Boolean combinations forming piecewise testable languages. Theor. Comput. Sci. 682 (2017)
Jan Komenda, Tomás Masopust
Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication. Discret. Event Dyn. Syst. 27 (4) (2017)
Tomás Masopust, Xiang Yin
Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems. CoRR (2017)
Tomás Masopust
Separability by Piecewise Testable Languages is PTime-Complete. CoRR (2017)
Tomás Masopust
Complexity of Verifying Nonblockingness in Modular Supervisory Control. CoRR (2017)
Tomás Masopust
Complexity of Infimal Observable Superlanguages. CoRR (2017)
Tomás Masopust
Complexity of Deciding Detectability in Discrete Event Systems. CoRR (2017)
Stepan Holub, Tomás Masopust, Michaël Thomazo
On the Height of Towers of Subsequences and Prefixes. CoRR (2017)
Tomás Masopust, Markus Krötzsch
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard. CoRR (2017)
Markus Krötzsch, Tomás Masopust, Michaël Thomazo
Complexity of universality and related problems for partially ordered NFAs. Inf. Comput. 255 (2017)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Control of an engineering-structured multilevel discrete-event system. WODES (2016)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
On a Distributed Computation of Supervisors in Modular Supervisory Control. CoRR (2016)
Tomás Masopust
Piecewise Testable Languages and Nondeterministic Automata. CoRR (2016)
Jan Komenda, Tomás Masopust
Distributed computation of supremal conditionally controllable sublanguages. Int. J. Control 89 (2) (2016)
Tomás Masopust
Piecewise Testable Languages and Nondeterministic Automata. MFCS (2016)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Distributed computation of maximally permissive supervisors in three-level relaxed coordination control of discrete-event systems. CDC (2016)
Markus Krötzsch, Tomás Masopust, Michaël Thomazo
On the Complexity of Universality for Partially Ordered NFAs. MFCS (2016)
Markus Krötzsch, Tomás Masopust, Michaël Thomazo
Complexity of Universality and Related Problems for Partially Ordered NFAs. CoRR (2016)
Jan Komenda, Tomás Masopust
On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control. CoRR (2015)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Relative observability in coordination control. CASE (2015)
Tomás Masopust, Michaël Thomazo
On the Complexity of k-Piecewise Testability and the Depth of Automata. DLT (2015)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Multilevel coordination control of partially observed modular DES. ACC (2015)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Coordination control of discrete-event systems revisited. Discret. Event Dyn. Syst. 25 (1-2) (2015)
Stepan Holub, Galina Jirásková, Tomás Masopust
On Upper and Lower Bounds on the Length of Alternating Towers. MFCS (1) (2014)
Galina Jirásková, Tomás Masopust
On Upper and Lower Bounds on the Length of Alternating Towers. CoRR (2014)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Bottom-up approach to multilevel supervisory control with coordination. ECC (2014)
Stepan Holub, Tomás Masopust, Michaël Thomazo
Alternating Towers and Piecewise Testable Separators. CoRR (2014)
Tomás Masopust, Michaël Thomazo
On $k$-piecewise testability (preliminary report). CoRR (2014)
Jan Komenda, Tomás Masopust
Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control. CoRR (2014)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
A Note on Relative Observability in Coordination Control. CoRR (2014)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions. CoRR (2014)
Jan Komenda, Tomás Masopust
Decentralized supervisory control with communicating supervisors based on top-down coordination control. CDC (2014)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Multilevel coordination control of modular DES. CDC (2013)
Wojciech Czerwinski, Wim Martens, Tomás Masopust
Efficient Separability of Regular Languages by Subsequences and Suffixes. ICALP (2) (2013)
Wojciech Czerwinski, Wim Martens, Tomás Masopust
Efficient Separability of Regular Languages by Subsequences and Suffixes CoRR (2013)
Jan Komenda, Tomás Masopust
A bridge between decentralized and coordination control. Allerton (2013)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Coordination Control of Discrete-Event Systems Revisited. CoRR (2013)
Galina Jirásková, Tomás Masopust
On the State Complexity of the Reverse of R- and J-trivial Regular Languages CoRR (2013)
Galina Jirásková, Tomás Masopust
On the State Complexity of the Reverse of - and -Trivial Regular Languages. DCFS (2013)
Tomás Masopust
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata. Int. J. Found. Comput. Sci. 24 (3) (2013)
Tomás Masopust
A Note on Undecidability of Observation Consistency for Non-Regular Languages CoRR (2012)
Tomás Masopust
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata CoRR (2012)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
On Conditional Decomposability CoRR (2012)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
On algorithms and extensions of coordination control of discrete-event systems. WODES (2012)
Galina Jirásková, Tomás Masopust
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. CIAA (2012)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
On conditional decomposability. Syst. Control. Lett. 61 (12) (2012)
Tomás Masopust
A note on controllability of deterministic context-free systems. Autom. 48 (8) (2012)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
On Algorithms and Extensions of Coordination Control of Discrete-Event Systems CoRR (2012)
Jürgen Dassow, Tomás Masopust
On restricted context-free grammars. J. Comput. Syst. Sci. 78 (1) (2012)
Galina Jirásková, Tomás Masopust
On Properties and State Complexity of Deterministic State-Partition Automata. IFIP TCS (2012)
Galina Jirásková, Tomás Masopust
On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449 (2012)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Supervisory control synthesis of discrete-event systems using a coordination scheme. Autom. 48 (2) (2012)
Zbynek Krivka, Tomás Masopust
Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybern. 20 (2) (2011)
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator. Syst. Control. Lett. 60 (7) (2011)
Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil
Blackhole Pushdown Automata. Fundam. Informaticae 112 (2-3) (2011)
Olivier Boutin, Jan Komenda, Tomás Masopust, Klaus Schmidt, Jan H. van Schuppen
Hierarchical control with partial observations: Sufficient conditions. CDC/ECC (2011)
Galina Jirásková, Tomás Masopust
Complexity in Union-Free Regular Languages. Int. J. Found. Comput. Sci. 22 (7) (2011)
Olivier Boutin, Jan Komenda, Tomás Masopust, Nicola Pambakian, Jan H. van Schuppen, Pia L. Kempker, André C. M. Ran
Control of Distributed Systems: Tutorial and Overview. Eur. J. Control 17 (5-6) (2011)
Galina Jirásková, Tomás Masopust
State Complexity of Projected Languages. DCFS (2011)
Filip Goldefus, Tomás Masopust, Alexander Meduna
Left-forbidding cooperating distributed grammar systems. Theor. Comput. Sci. 411 (40-42) (2010)
Galina Jirásková, Tomás Masopust
Complexity in Union-Free Regular Languages. Developments in Language Theory (2010)
Tomás Masopust
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. Fundam. Informaticae 104 (1-2) (2010)
Tomás Masopust
Simple restriction in context-free rewriting. J. Comput. Syst. Sci. 76 (8) (2010)
Jan Komenda, Tomás Masopust
Supremal normal sublanguages in hierarchical supervisory control. WODES (2010)
Tomás Masopust
Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms CoRR (2010)
Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil
Blackhole State-Controlled Regulated Pushdown Automata. NCMA (2010)

Tomás Masopust.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tomás Masopust