| Publication | Date of Publication | Type |
|---|
| LambdaY-calculus with priorities | 2024-12-19 | Paper |
| Active learning for sound negotiations | 2024-12-06 | Paper |
| Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods | 2024-12-06 | Paper |
| Checking timed Büchi automata emptiness using the local-time semantics | 2024-08-13 | Paper |
| Distributed controller synthesis for deadlock avoidance | 2024-06-24 | Paper |
| On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic | 2023-06-28 | Paper |
| Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems | 2022-08-12 | Paper |
| Characterizing Consensus in the Heard-Of Model | 2022-07-18 | Paper |
| Abstraction-based control synthesis using partial information | 2022-03-04 | Paper |
| Synthesis with finite automata | 2021-11-12 | Paper |
| Leafy automata for higher-order concurrency | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144691 | 2021-01-19 | Paper |
| Why Liveness for Timed Automata Is Hard, and What We Can Do About It | 2020-09-11 | Paper |
| The mu-calculus and Model Checking | 2018-07-20 | Paper |
| The Diagonal Problem for Higher-Order Recursion Schemes is Decidable | 2018-04-23 | Paper |
| Why Liveness for Timed Automata Is Hard, and What We Can Do About It | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608664 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3130542 | 2018-01-23 | Paper |
| Deciding the topological complexity of Büchi languages * | 2017-12-19 | Paper |
| Monadic second order logic on tree-like structures | 2017-11-16 | Paper |
| Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable | 2017-09-12 | Paper |
| A model for behavioural properties of higher-order programs | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275365 | 2017-07-13 | Paper |
| Alternating timed automata | 2017-07-12 | Paper |
| Better Abstractions for Timed Automata | 2017-05-16 | Paper |
| Typing Weak MSOL Properties | 2017-05-08 | Paper |
| Distributed synthesis for acyclic architectures | 2017-04-25 | Paper |
| Simply typed fixpoint calculus and collapsible pushdown automata | 2017-04-03 | Paper |
| Evaluation is MSOL compatible | 2017-02-21 | Paper |
| Reachability for Dynamic Parametric Processes | 2017-02-21 | Paper |
| Better abstractions for timed automata | 2016-11-18 | Paper |
| A Note on Monitors and Büchi Automata | 2016-02-25 | Paper |
| Typing Weak MSOL Properties | 2015-10-01 | Paper |
| Using models to model-check recursive schemes | 2015-08-25 | Paper |
| Krivine machines and higher-order schemes | 2014-11-28 | Paper |
| Asynchronous Games over Tree Architectures | 2013-08-07 | Paper |
| Using Models to Model-Check Recursive Schemes | 2013-06-28 | Paper |
| Deciding low levels of tree-automata hierarchy | 2013-04-19 | Paper |
| Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata | 2013-01-07 | Paper |
| Efficient emptiness check for timed Büchi automata | 2012-09-27 | Paper |
| Simple Models for Recursive Schemes | 2012-09-25 | Paper |
| Wreath products of forest algebras, with applications to tree logics | 2012-09-25 | Paper |
| Weak alternating timed automata | 2012-09-25 | Paper |
| Using non-convex approximations for efficient analysis of timed automata | 2012-08-31 | Paper |
| An alternate proof of Statman's finite completeness theorem | 2012-07-25 | Paper |
| Krivine Machines and Higher-Order Schemes | 2011-07-07 | Paper |
| Automata and Games for Synthesis | 2011-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086921 | 2011-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086918 | 2011-03-30 | Paper |
| Choice functions and well-orderings over the infinite binary tree | 2010-11-22 | Paper |
| Synthesis: Words and Traces | 2010-10-04 | Paper |
| Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata | 2010-09-07 | Paper |
| Automata for the modal μ-calculus and related results | 2010-06-17 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190785 | 2009-07-27 | Paper |
| Weak Alternating Timed Automata | 2009-07-14 | Paper |
| Minimizing Variants of Visibly Pushdown Automata | 2008-09-17 | Paper |
| A lower bound on web services composition | 2008-08-07 | Paper |
| Third-order Idealized Algol with iteration is decidable | 2008-03-05 | Paper |
| Positional Determinacy of Games with Infinitely Many Priorities | 2007-10-11 | Paper |
| A Lower Bound on Web Services Composition | 2007-09-07 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| An expressively complete linear time temporal logic for Mazurkiewicz traces | 2006-10-10 | Paper |
| Characterizing EF and EX tree logics | 2006-09-13 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| AN NP-COMPLETE FRAGMENT OF LTL | 2005-08-03 | Paper |
| Difficult configurations -- on the complexity of LTrL | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472439 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807834 | 2004-02-22 | Paper |
| A gap property of deterministic tree languages. | 2003-08-17 | Paper |
| Complexity of weak acceptance conditions in tree automata. | 2003-01-21 | Paper |
| Pushdown processes: Games and model-checking | 2003-01-14 | Paper |
| Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. | 2003-01-14 | Paper |
| Monadic second-order logic on tree-like structures | 2002-07-31 | Paper |
| Permissive strategies: from parity games to safety games | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936126 | 2000-01-24 | Paper |
| Monadic second-order logic, graph coverings and unfoldings of transition systems | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219025 | 1999-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381391 | 1998-04-01 | Paper |
| A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus | 1997-08-19 | Paper |
| Games for the \(\mu\)-calculus | 1997-02-27 | Paper |
| Gentzen-type axiomatization for PAL | 1993-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976050 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3979283 | 1992-06-26 | Paper |
