Tomás Masopust

132 papers B 5C 7Journal 92Unranked 24
YearRankTypeTitle / Venue / Authors
2026 J jnl
Diagnosability verification for automata and Petri nets: Can we do better?
Autom.
Shaowen Miao, Petr Jancar, Jan Komenda, Tomás Masopust, Aiwen Lai
2026 J jnl
Enforcement of Critical Observability in Modular Discrete-Event Systems.
IEEE Trans. Autom. Control.
Shaowen Miao, Jan Komenda, Tomás Masopust, Aiwen Lai
2025 J jnl
On algorithms verifying initial-and-final-state opacity: Complexity, special cases, and comparison.
Autom.
Tomás Masopust, Petr Osicka
2025 J jnl
On the Complexity of the Secret Protection Problem for Discrete-Event Systems.
CoRR
Tomás Masopust, Jakub Vecera
2025 J jnl
Secret Protection in Labeled Petri Nets.
CoRR
Stefan Haar, Tomás Masopust, Jakub Vecera
2024 J jnl
On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems.
CoRR
Tomás Masopust, Petr Osicka
2024 J jnl
Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality.
IEEE Trans. Autom. Control.
Jan Komenda, Tomás Masopust
2023 J jnl
Hierarchical Supervisory Control Under Partial Observation: Normality.
IEEE Trans. Autom. Control.
Jan Komenda, Tomás Masopust
2023 B conf
Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification.
MFCS
Jirí Balun, Tomás Masopust, Petr Osicka
2023 J jnl
Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification.
CoRR
Jirí Balun, Tomás Masopust, Petr Osicka
2023 J jnl
Supervisory Control of Modular Discrete-Event Systems under Partial Observation: Normality.
CoRR
Jan Komenda, Tomás Masopust
2023 J jnl
Verifying weak and strong k-step opacity in discrete-event systems.
Autom.
Jirí Balun, Tomás Masopust
2022 J jnl
Hierarchical and Modular Supervisory Control under Partial Observation: Normality.
CoRR
Jan Komenda, Tomás Masopust
2022 J jnl
Modular control of discrete-event systems using similarity.
Autom.
Yingying Liu, Jan Komenda, Tomás Masopust, ZhiWu Li
2022 B conf
On Transformations among Opacity Notions.
SMC
Jirí Balun, Tomás Masopust
2022 J jnl
Verifying Weak and Strong k-Step Opacity in Discrete-Event Systems.
CoRR
Jirí Balun, Tomás Masopust
2021 J jnl
Comparing the Notions of Opacity for Discete-Event Systems.
CoRR
Jirí Balun, Tomás Masopust
2021 J jnl
Comparing the notions of opacity for discrete-event systems.
Discret. Event Dyn. Syst.
Jirí Balun, Tomás Masopust
2021 J jnl
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations.
CoRR
Jirí Balun, Tomás Masopust
2021 J jnl
On verification of D-detectability for discrete event systems.
Autom.
Jirí Balun, Tomás Masopust
2021 J jnl
Partially Ordered Automata and Piecewise Testability.
Log. Methods Comput. Sci.
Tomás Masopust, Markus Krötzsch
2020 J jnl
Critical Observability for Automata and Petri Nets.
IEEE Trans. Autom. Control.
Tomás Masopust
2020 J jnl
Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems.
IEEE Trans. Autom. Control.
Spyros A. Reveliotis, Tomás Masopust
2019 J jnl
Automatic Generation of Optimal Reductions of Distributions.
IEEE Trans. Autom. Control.
Liyong Lin, Tomás Masopust, Walter Murray Wonham, Rong Su
2019 J jnl
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems.
Autom.
Tomás Masopust, Xiang Yin
2019 J jnl
Conditions for Hierarchical Supervisory Control under Partial Observation.
CoRR
Jan Komenda, Tomás Masopust
2019 J jnl
On Opacity Verification for Discrete-Event Systems.
CoRR
Jirí Balun, Tomás Masopust
2019 J jnl
On Verification of Strong Periodic D-Detectability for Discrete Event Systems.
CoRR
Jirí Balun, Tomás Masopust
2019 J jnl
On the height of towers of subsequences and prefixes.
Inf. Comput.
Stepan Holub, Tomás Masopust, Michaël Thomazo
2019 J jnl
Partially Ordered Automata and Piecewise Testability.
CoRR
Tomás Masopust, Markus Krötzsch
2019 — conf
Some new results on the state liveness of open guidepath-based traffic systems.
MED
Spyros A. Reveliotis, Tomás Masopust
2018 J jnl
Automatic Generation of Optimal Reductions of Distributions.
CoRR
Liyong Lin, Tomás Masopust, Walter Murray Wonham, Rong Su
2018 J jnl
Complexity of Infimal Observable Superlanguages.
IEEE Trans. Autom. Control.
Tomás Masopust
2018 J jnl
Complexity of Verifying Nonblockingness in Modular Supervisory Control.
IEEE Trans. Autom. Control.
Tomás Masopust
2018 J jnl
Complexity of deciding detectability in discrete event systems.
Autom.
Tomás Masopust
2018 J jnl
Critical Observability for Automata and Petri Nets.
CoRR
Tomás Masopust
2018 J jnl
Deciding Detectability for Labeled Petri Nets.
CoRR
Tomás Masopust, Xiang Yin
2018 B conf
Deciding Universality of ptNFAs is PSpace-Complete.
SOFSEM
Tomás Masopust, Markus Krötzsch
2018 J jnl
Separability by piecewise testable languages is PTime-complete.
Theor. Comput. Sci.
Tomás Masopust
2017 J jnl
Complexity of Deciding Detectability in Discrete Event Systems.
CoRR
Tomás Masopust
2017 J jnl
Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems.
CoRR
Tomás Masopust, Xiang Yin
2017 J jnl
Complexity of Infimal Observable Superlanguages.
CoRR
Tomás Masopust
2017 J jnl
Complexity of Verifying Nonblockingness in Modular Supervisory Control.
CoRR
Tomás Masopust
2017 J jnl
Complexity of universality and related problems for partially ordered NFAs.
Inf. Comput.
Markus Krötzsch, Tomás Masopust, Michaël Thomazo
2017 J jnl
Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication.
Discret. Event Dyn. Syst.
Jan Komenda, Tomás Masopust
2017 J jnl
On Boolean combinations forming piecewise testable languages.
Theor. Comput. Sci.
Tomás Masopust, Michaël Thomazo
2017 J jnl
On the Height of Towers of Subsequences and Prefixes.
CoRR
Stepan Holub, Tomás Masopust, Michaël Thomazo
2017 J jnl
Separability by Piecewise Testable Languages is PTime-Complete.
CoRR
Tomás Masopust
2017 J jnl
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard.
CoRR
Tomás Masopust, Markus Krötzsch
2016 J jnl
Complexity of Universality and Related Problems for Partially Ordered NFAs.
CoRR
Markus Krötzsch, Tomás Masopust, Michaël Thomazo
2016 — conf
Control of an engineering-structured multilevel discrete-event system.
WODES
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2016 — conf
Distributed computation of maximally permissive supervisors in three-level relaxed coordination control of discrete-event systems.
CDC
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2016 J jnl
Distributed computation of supremal conditionally controllable sublanguages.
Int. J. Control
Jan Komenda, Tomás Masopust
2016 J jnl
On a Distributed Computation of Supervisors in Modular Supervisory Control.
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2016 B conf
On the Complexity of Universality for Partially Ordered NFAs.
MFCS
Markus Krötzsch, Tomás Masopust, Michaël Thomazo
2016 B conf
Piecewise Testable Languages and Nondeterministic Automata.
MFCS
Tomás Masopust
2016 J jnl
Piecewise Testable Languages and Nondeterministic Automata.
CoRR
Tomás Masopust
2015 J jnl
Coordination control of discrete-event systems revisited.
Discret. Event Dyn. Syst.
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2015 C conf
Multilevel coordination control of partially observed modular DES.
ACC
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2015 C conf
On the Complexity of k-Piecewise Testability and the Depth of Automata.
DLT
Tomás Masopust, Michaël Thomazo
2015 J jnl
On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control.
CoRR
Jan Komenda, Tomás Masopust
2015 — conf
Relative observability in coordination control.
CASE
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2014 J jnl
A Note on Relative Observability in Coordination Control.
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2014 J jnl
Alternating Towers and Piecewise Testable Separators.
CoRR
Stepan Holub, Tomás Masopust, Michaël Thomazo
2014 — conf
Bottom-up approach to multilevel supervisory control with coordination.
ECC
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2014 J jnl
Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control.
CoRR
Jan Komenda, Tomás Masopust
2014 — conf
Decentralized supervisory control with communicating supervisors based on top-down coordination control.
CDC
Jan Komenda, Tomás Masopust
2014 J jnl
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions.
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2014 J jnl
On $k$-piecewise testability (preliminary report).
CoRR
Tomás Masopust, Michaël Thomazo
2014 — conf
On Upper and Lower Bounds on the Length of Alternating Towers.
MFCS (1)
Stepan Holub, Galina Jirásková, Tomás Masopust
2014 J jnl
On Upper and Lower Bounds on the Length of Alternating Towers.
CoRR
Galina Jirásková, Tomás Masopust
2013 J jnl
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata.
Int. J. Found. Comput. Sci.
Tomás Masopust
2013 — conf
A bridge between decentralized and coordination control.
Allerton
Jan Komenda, Tomás Masopust
2013 J jnl
Coordination Control of Discrete-Event Systems Revisited.
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2013 — ch.
Coordination Control of Distributed Discrete-Event Systems.
Control of Discrete-Event Systems
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2013 J jnl
Efficient Separability of Regular Languages by Subsequences and Suffixes
CoRR
Wojciech Czerwinski, Wim Martens, Tomás Masopust
2013 — conf
Efficient Separability of Regular Languages by Subsequences and Suffixes.
ICALP (2)
Wojciech Czerwinski, Wim Martens, Tomás Masopust
2013 — ch.
Languages, Decidability, and Complexity.
Control of Discrete-Event Systems
Stefan Haar, Tomás Masopust
2013 — conf
Multilevel coordination control of modular DES.
CDC
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2013 — conf
On the State Complexity of the Reverse of - and -Trivial Regular Languages.
DCFS
Galina Jirásková, Tomás Masopust
2013 J jnl
On the State Complexity of the Reverse of R- and J-trivial Regular Languages
CoRR
Galina Jirásková, Tomás Masopust
2013 — ch.
Supervisory Control of Distributed Discrete-Event Systems.
Control of Discrete-Event Systems
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2013 — ch.
Supervisory Control with Complete Observations.
Control of Discrete-Event Systems
Tomás Masopust, Jan H. van Schuppen
2012 J jnl
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
CoRR
Tomás Masopust
2012 J jnl
A Note on Undecidability of Observation Consistency for Non-Regular Languages
CoRR
Tomás Masopust
2012 J jnl
A note on controllability of deterministic context-free systems.
Autom.
Tomás Masopust
2012 J jnl
On Algorithms and Extensions of Coordination Control of Discrete-Event Systems
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2012 J jnl
On Conditional Decomposability
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2012 — conf
On Properties and State Complexity of Deterministic State-Partition Automata.
IFIP TCS
Galina Jirásková, Tomás Masopust
2012 J jnl
On a structural property in the state complexity of projected regular languages.
Theor. Comput. Sci.
Galina Jirásková, Tomás Masopust
2012 — conf
On algorithms and extensions of coordination control of discrete-event systems.
WODES
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2012 J jnl
On conditional decomposability.
Syst. Control. Lett.
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2012 J jnl
On restricted context-free grammars.
J. Comput. Syst. Sci.
Jürgen Dassow, Tomás Masopust
2012 C conf
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs.
CIAA
Galina Jirásková, Tomás Masopust
2012 J jnl
Supervisory control synthesis of discrete-event systems using a coordination scheme.
Autom.
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2011 J jnl
Blackhole Pushdown Automata.
Fundam. Informaticae
Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil
2011 J jnl
Complexity in Union-Free Regular Languages.
Int. J. Found. Comput. Sci.
Galina Jirásková, Tomás Masopust
2011 J jnl
Control of Distributed Systems: Tutorial and Overview.
Eur. J. Control
Olivier Boutin, Jan Komenda, Tomás Masopust, Nicola Pambakian, Jan H. van Schuppen, Pia L. Kempker, André C. M. Ran
2011 J jnl
Cooperating Distributed Grammar Systems with Random Context Grammars as Components.
Acta Cybern.
Zbynek Krivka, Tomás Masopust
2011 — conf
Hierarchical control with partial observations: Sufficient conditions.
CDC/ECC
Olivier Boutin, Jan Komenda, Tomás Masopust, Klaus Schmidt, Jan H. van Schuppen
2011 — conf
State Complexity of Projected Languages.
DCFS
Galina Jirásková, Tomás Masopust
2011 J jnl
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator.
Syst. Control. Lett.
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2010 — conf
Blackhole State-Controlled Regulated Pushdown Automata.
NCMA
Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil
2010 J jnl
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals.
Fundam. Informaticae
Tomás Masopust
2010 J jnl
Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms
CoRR
Tomás Masopust
2010 C conf
Complexity in Union-Free Regular Languages.
Developments in Language Theory
Galina Jirásková, Tomás Masopust
2010 J jnl
Left-forbidding cooperating distributed grammar systems.
Theor. Comput. Sci.
Filip Goldefus, Tomás Masopust, Alexander Meduna
2010 C conf
On Restricted Context-Free Grammars.
Developments in Language Theory
Jürgen Dassow, Tomás Masopust
2010 J jnl
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case.
Fundam. Informaticae
Tomás Masopust
2010 J jnl
Simple restriction in context-free rewriting.
J. Comput. Syst. Sci.
Tomás Masopust
2010 J jnl
Supervisory Control Synthesis of Discrete-Event Systems using Coordination Scheme
CoRR
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2010 — conf
Supremal normal sublanguages in hierarchical supervisory control.
WODES
Jan Komenda, Tomás Masopust
2010 — conf
Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems.
WODES
Jan Komenda, Tomás Masopust, Jan H. van Schuppen
2009 — conf
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking.
ICTCS
Zbynek Krivka, Tomás Masopust
2009 C conf
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions.
LATA
Tomás Masopust
2009 J jnl
Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"
CoRR
Tomás Masopust
2009 — conf
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
DCFS
Tomás Masopust, Alexander Meduna
2009 J jnl
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops.
Acta Cybern.
Tomás Masopust, Alexander Meduna
2009 J jnl
On context-free rewriting with a simple restriction and its computational completeness.
RAIRO Theor. Informatics Appl.
Tomás Masopust, Alexander Meduna
2009 J jnl
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components.
Int. J. Found. Comput. Sci.
Tomás Masopust
2009 J jnl
On the descriptional complexity of scattered context grammars.
Theor. Comput. Sci.
Tomás Masopust
2009 — conf
Regulated Nondeterminism in PDAs: The Non-Regular Case.
NCMA
Tomás Masopust
2008 J jnl
Descriptional complexity of multi-parallel grammars.
Inf. Process. Lett.
Tomás Masopust
2008 J jnl
Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof.
Discret. Math. Theor. Comput. Sci.
Tomás Masopust, Jirí Techet
2008 J jnl
On Descriptional Complexity of Partially Parallel Grammars.
Fundam. Informaticae
Tomás Masopust, Alexander Meduna
2008 — conf
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops.
AFL
Tomás Masopust, Alexander Meduna
2008 J jnl
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars.
Acta Cybern.
Tomás Masopust, Alexander Meduna, Jirí Simácek
2007 — conf
A Note on the Descriptional Complexity of Semi-Conditional Grammars.
Workshop on Formal Models
Tomás Masopust
2007 — conf
Descriptional Complexity of Generalized Forbidding Grammars.
DCFS
Tomás Masopust, Alexander Meduna
2007 C conf
Descriptional Complexity of Grammars Regulated by Context Conditions.
LATA
Tomás Masopust, Alexander Meduna
2007 J jnl
Descriptional complexity of semi-conditional grammars.
Inf. Process. Lett.
Tomás Masopust, Alexander Meduna
2007 J jnl
Self-Regulating Finite Automata.
Acta Cybern.
Alexander Meduna, Tomás Masopust