| Publication | Date of Publication | Type |
|---|
| Speed me up if you can: conditional lower bounds on opacity verification | 2024-12-03 | Paper |
| Supervisory control of modular discrete-event systems under partial observation: normality | 2024-08-16 | Paper |
| Hierarchical Supervisory Control Under Partial Observation: Normality | 2024-02-29 | Paper |
| Verifying weak and strong \(k\)-step opacity in discrete-event systems | 2023-07-31 | Paper |
| Modular control of discrete-event systems using similarity | 2022-07-05 | Paper |
| Comparing the notions of opacity for discrete-event systems | 2022-01-10 | Paper |
| On verification of D-detectability for discrete event systems | 2022-01-07 | Paper |
| Polynomial-time optimal liveness enforcement for guidepath-based transport systems | 2021-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4989409 | 2021-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146528 | 2021-01-26 | Paper |
| Deciding Universality of ptNFAs is PSpace-Complete | 2020-10-21 | Paper |
| Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems | 2020-10-07 | Paper |
| Critical Observability for Automata and Petri Nets | 2020-01-28 | Paper |
| On the height of towers of subsequences and prefixes | 2019-09-17 | Paper |
| Complexity of detectability, opacity and A-diagnosability for modular discrete event systems | 2019-04-24 | Paper |
| Deciding detectability for labeled Petri nets | 2019-04-24 | Paper |
| Automatic Generation of Optimal Reductions of Distributions | 2019-03-28 | Paper |
| Supervisory Control of Discrete-Event Systems | 2018-12-12 | Paper |
| Coordination Control of Distributed Discrete-Event Systems | 2018-12-12 | Paper |
| Complexity of deciding detectability in discrete event systems | 2018-10-17 | Paper |
| Complexity of Infimal Observable Superlanguages | 2018-06-27 | Paper |
| Complexity of Verifying Nonblockingness in Modular Supervisory Control | 2018-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608630 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608624 | 2018-03-21 | Paper |
| Separability by piecewise testable languages is \textsc{PTime}-complete | 2018-02-16 | Paper |
| Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication | 2017-12-18 | Paper |
| Complexity of universality and related problems for partially ordered NFAs | 2017-08-08 | Paper |
| On Boolean combinations forming piecewise testable languages | 2017-06-15 | Paper |
| Distributed computation of supremal conditionally controllable sublanguages | 2016-03-14 | Paper |
| On the Complexity of k-Piecewise Testability and the Depth of Automata | 2015-11-10 | Paper |
| Coordination control of discrete-event systems revisited | 2015-06-12 | Paper |
| Combined Top-down and Bottom-up Approach to Multilevel Supervisory Control | 2015-02-25 | Paper |
| A Relaxed Framework for Coordination Control of Discrete-Event Systems | 2015-01-30 | Paper |
| Coordination Control of Distributed Discrete-Event Systems | 2015-01-29 | Paper |
| Languages, Decidability, and Complexity | 2015-01-29 | Paper |
| Supervisory Control of Distributed Discrete-Event Systems | 2015-01-29 | Paper |
| Supervisory Control with Complete Observations | 2015-01-29 | Paper |
| On Upper and Lower Bounds on the Length of Alternating Towers | 2014-10-14 | Paper |
| A note on limited pushdown alphabets in stateless deterministic pushdown automata | 2013-10-23 | Paper |
| On the State Complexity of the Reverse of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages | 2013-08-09 | Paper |
| Efficient Separability of Regular Languages by Subsequences and Suffixes | 2013-08-07 | Paper |
| A note on controllability of deterministic context-free~systems | 2013-07-31 | Paper |
| Supervisory control synthesis of discrete-event systems using a coordination scheme | 2013-03-12 | Paper |
| On conditional decomposability | 2013-01-21 | Paper |
| Control of distributed systems: tutorial and overview | 2012-12-08 | Paper |
| On Properties and State Complexity of Deterministic State-Partition Automata | 2012-09-21 | Paper |
| On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs | 2012-09-20 | Paper |
| Cooperating distributed grammar systems with random context grammars as components | 2012-09-18 | Paper |
| Complexity in union-free regular languages | 2012-08-29 | Paper |
| On a structural property in the state complexity of projected regular languages | 2012-08-13 | Paper |
| On restricted context-free grammars | 2012-05-11 | Paper |
| Blackhole pushdown automata | 2012-05-04 | Paper |
| Some Power-Decreasing Derivation Restrictions in Grammar Systems | 2012-02-08 | Paper |
| State Complexity of Projected Languages | 2011-07-29 | Paper |
| Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator | 2011-07-27 | Paper |
| Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case | 2011-05-18 | Paper |
| Left-forbidding cooperating distributed grammar systems | 2010-10-11 | Paper |
| Simple restriction in context-free rewriting | 2010-10-07 | Paper |
| Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals | 2010-10-01 | Paper |
| Complexity in Union-Free Regular Languages | 2010-08-31 | Paper |
| On Restricted Context-Free Grammars | 2010-08-31 | Paper |
| Descriptional complexity of multi-parallel grammars | 2010-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5306175 | 2010-04-08 | Paper |
| Descriptional complexity of semi-conditional grammars | 2010-03-24 | Paper |
| ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS | 2009-06-23 | Paper |
| On context-free rewriting with a simple restriction and its computational completeness | 2009-05-06 | Paper |
| A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions | 2009-04-02 | Paper |
| Two power-decreasing derivation restrictions in generalized scattered context grammars | 2009-03-19 | Paper |
| On the descriptional complexity of scattered context grammars | 2009-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601874 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387738 | 2008-05-27 | Paper |
| Self-regulating finite automata | 2007-10-26 | Paper |
