| Publication | Date of Publication | Type |
|---|
| Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems | 2022-08-12 | Paper |
| Origin-equivalence of two-way word transducers is in PSPACE | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090969 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092324 | 2022-07-21 | Paper |
| On Synthesis of Resynchronizers for Transducers | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090448 | 2022-07-18 | Paper |
| Abstraction-based control synthesis using partial information | 2022-03-04 | Paper |
| Communicating automata | 2021-11-12 | Paper |
| One-way resynchronizability of word transducers | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155668 | 2021-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144685 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144691 | 2021-01-19 | Paper |
| Automated Synthesis: a Distributed Viewpoint | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5216306 | 2020-02-17 | Paper |
| On the complementation of Büchi asynchronous cellular automata | 2019-04-29 | Paper |
| Logical definability on infinite traces | 2019-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4611380 | 2019-01-18 | Paper |
| Solving trace equations using lexicographical normal forms | 2018-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636633 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608664 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3130542 | 2018-01-23 | Paper |
| Minimizing resources of sweeping and streaming string transducers | 2017-12-19 | Paper |
| On codings of traces | 2017-12-04 | Paper |
| A tour of recent results on word transducers | 2017-11-22 | Paper |
| Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable | 2017-09-12 | Paper |
| One-way Definability of Sweeping Transducer. | 2017-07-13 | Paper |
| Distributed synthesis for acyclic architectures | 2017-04-25 | Paper |
| Reachability for Dynamic Parametric Processes | 2017-02-21 | Paper |
| Walking on data words | 2017-01-18 | Paper |
| A Note on Monitors and Büchi Automata | 2016-02-25 | Paper |
| Controlling loosely cooperating processes | 2015-12-15 | Paper |
| Two-variable logic on data trees and XML reasoning | 2015-11-11 | Paper |
| Automated Synthesis of Distributed Controllers | 2015-11-04 | Paper |
| On Distributed Monitoring and Synthesis | 2015-10-20 | Paper |
| Two-variable logic on data words | 2015-09-17 | Paper |
| A quadratic construction for Zielonka automata with acyclic communication structure | 2014-09-02 | Paper |
| Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge | 2013-09-20 | Paper |
| Asynchronous Games over Tree Architectures | 2013-08-07 | Paper |
| Walking on Data Words | 2013-06-14 | Paper |
| Reachability Analysis of Communicating Pushdown Systems | 2012-10-22 | Paper |
| On Distributed Monitoring of Asynchronous Systems | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908878 | 2012-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086934 | 2011-03-30 | Paper |
| Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata | 2010-09-07 | Paper |
| Taming Distributed Asynchronous Systems | 2010-08-31 | Paper |
| Analysis of Communicating Automata | 2010-05-26 | Paper |
| Reachability Analysis of Communicating Pushdown Systems | 2010-04-27 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Complementing deterministic tree-walking automata | 2010-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190785 | 2009-07-27 | Paper |
| Tree Pattern Rewriting Systems | 2008-11-20 | Paper |
| A lower bound on web services composition | 2008-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504343 | 2008-06-11 | Paper |
| Pattern matching and membership for hierarchical message sequence charts | 2008-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431917 | 2008-01-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Constructing Exponential-Size Deterministic Zielonka Automata | 2007-09-11 | Paper |
| A Lower Bound on Web Services Composition | 2007-09-07 | Paper |
| SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE | 2007-03-21 | Paper |
| Permutation rewriting and algorithmic verification | 2007-02-20 | Paper |
| Active context-free games | 2006-10-25 | Paper |
| A Kleene theorem and model checking algorithms for existentially bounded communicating automata | 2006-07-12 | Paper |
| Infinite-state high-level MSCs: model-checking and realizability | 2006-06-30 | Paper |
| Lectures on Concurrency and Petri Nets | 2005-12-23 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| AN NP-COMPLETE FRAGMENT OF LTL | 2005-08-03 | Paper |
| Bounded MSC communication | 2004-10-04 | Paper |
| Characterizations of classes of graphs recognizable by local computations | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044337 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737197 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738233 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535046 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535059 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769610 | 2002-02-05 | Paper |
| Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time | 2001-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502806 | 2000-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941891 | 2000-03-19 | Paper |
| Solving word equations modulo partial commutations | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218104 | 1999-03-02 | Paper |
| The code problem for traces -- improving the boundaries | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375801 | 1998-02-08 | Paper |
| A note on the commutative closure of star-free languages | 1997-02-28 | Paper |
| Logical definability on infinite traces | 1997-02-28 | Paper |
| On the complementation of asynchronous cellular Büchi automata | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874653 | 1996-08-13 | Paper |
| Deterministic asynchronous automata for infinite traces | 1994-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281564 | 1994-03-10 | Paper |
