Automata Theory and Formal Languages

  • Complexity of universality (inclusion, equivalence) of (restricted) partially ordered NFAs

    Krötzsch, M., Masopust, T., Thomazo, M., On the Complexity of Universality for Partially Ordered NFAs, MFCS 2016
    Files: MFCS 2016, Full version, Summary
    Presentations: Overview

  • (k-)piecewise-testability and nondeterministic automata -- characterization and complexity

    Masopust, T., Piecewise Testable Languages and Nondeterministic Automata, MFCS 2016
    Files: MFCS 2016, TCS, SOFSEM 2018

  • Separability of regular languages by piecewise testable languages

    Czerwiński, W., Martens, W., Masopust, T., Efficient Separability of Regular Languages by Subsequences and Suffixes, ICALP 2013
    Files: ICALP 2013, complexity

  • New normal forms for random context and matrix grammars

    Dassow, J., Masopust, T., On restricted context-free grammars, Journal of Computer and System Sciences 78, 293-304, 2012
    Files: JCSS

Supervisory Control of Discrete-Event Systems

Coordination control and its applications

  1. Komenda, J., Masopust, T., Van Schuppen, J.H., On a Distributed Computation of Supervisors in Modular Supervisory Control, ICCSE 2015
  2. Komenda, J., Masopust, T., van Schuppen J.H., Coordination Control of Discrete-Event Systems Revisited, Discrete Event Dynamic Systems, 25, 65-94, 2015
  3. Komenda, J., Masopust, T., van Schuppen, J.H., Supervisory Control Synthesis of Discrete-Event Systems using a Coordination Scheme, Automatica 48, 247-254, 2012
Files: ICCSE 2015, JDEDS, Automatica

Decentralized supervisory control with communication

  1. Komenda, J., Masopust, T., Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication, Discrete Event Dynamic Systems 27(4), 585-608, 2017.
Files: JDEDS

Controllability of deterministic context-free systems

  1. Masopust, T., A note on controllability of deterministic context-free systems, Automatica 48, 1934-1937, 2012
Files: Automatica

Complexity

  1. Masopust, T., Complexity of Verifying Nonblockingness in Modular Supervisory Control, IEEE Transactions on Automatic Control, 63(2), 602-607, 2018
  2. Masopust, T., Complexity of Infimal Observable Superlanguages, IEEE Transactions on Automatic Control, 63(1), 249-254, 2018
  3. Masopust, T., Complexity of Deciding Detectability in Discrete Event Systems, Automatica 93, 257-261, 2018
  4. Masopust, T., Yin, X., Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems, manuscript, 2017
Files: arXiv 1, arXiv 2, arxiv 3, arxiv 4