| Publication | Date of Publication | Type |
|---|
| Semantic flowers for good-for-games and deterministic automata | 2024-03-13 | Paper |
| Omega-Regular Objectives in Model-Free Reinforcement Learning | 2023-11-24 | Paper |
| Accelerated model checking of parametric Markov chains | 2023-07-28 | Paper |
| History-deterministic timed automata are not determinizable | 2023-07-21 | Paper |
| Incremental Verification of Parametric and Reconfigurable Markov Chains | 2023-06-28 | Paper |
| An impossibility result in automata-theoretic reinforcement learning | 2023-06-02 | Paper |
| Alternating good-for-MDPs automata | 2023-06-02 | Paper |
| Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives | 2022-12-22 | Paper |
| Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning | 2022-10-13 | Paper |
| Model-Free Reinforcement Learning for Stochastic Parity Games | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079761 | 2022-05-28 | Paper |
| Model-free reinforcement learning for branching Markov decision processes | 2022-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028462 | 2022-02-09 | Paper |
| \( \omega \)-automata | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013875 | 2021-12-03 | Paper |
| Simple stochastic games with almost-sure energy-parity objectives are in NP and conp | 2021-10-18 | Paper |
| Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant | 2021-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005125 | 2021-08-04 | Paper |
| Maximum rooted connected expansion | 2021-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986502 | 2021-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4965865 | 2021-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5151040 | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144678 | 2021-01-19 | Paper |
| Fast two-robot disk evacuation with wireless communication | 2020-11-06 | Paper |
| Learning to Complement Büchi Automata | 2020-07-07 | Paper |
| Eternally dominating large grids | 2019-10-16 | Paper |
| Complementing semi-deterministic Büchi automata | 2019-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232902 | 2019-09-13 | Paper |
| A Simple Algorithm for Solving Qualitative Probabilistic Parity Games | 2019-05-03 | Paper |
| Buying optimal payoffs in bi-matrix games | 2018-12-10 | Paper |
| Fast two-robot disk evacuation with wireless communication | 2018-08-16 | Paper |
| Incentive Stackelberg Mean-Payoff Games | 2018-07-06 | Paper |
| Optimal control for multi-mode systems with discrete costs | 2017-12-01 | Paper |
| Model-checking iterated games | 2017-10-26 | Paper |
| Lazy probabilistic model checking without determinisation | 2017-09-12 | Paper |
| Eternally dominating large grids | 2017-07-21 | Paper |
| Bounded-rate multi-mode systems based motion planning | 2017-05-19 | Paper |
| Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games | 2017-02-21 | Paper |
| Solving parity games in big steps | 2016-11-14 | Paper |
| Efficient approximation of optimal control for continuous-time Markov games | 2016-03-10 | Paper |
| Controlling loosely cooperating processes | 2015-12-15 | Paper |
| Multiplayer Cost Games with Simple Nash Equilibria | 2015-12-11 | Paper |
| Symmetric Strategy Improvement | 2015-11-04 | Paper |
| Knowledge = Observation + Memory + Computation | 2015-10-01 | Paper |
| Synthesis of succinct systems | 2015-07-13 | Paper |
| Complexity of node coverage games | 2015-05-18 | Paper |
| Determinising Parity Automata | 2014-10-14 | Paper |
| Tight Bounds for Complementing Parity Automata | 2014-10-14 | Paper |
| Editorial: Special issue on synthesis | 2014-07-03 | Paper |
| Distributed synthesis is simply undecidable | 2014-04-15 | Paper |
| Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge | 2013-09-20 | Paper |
| Model-Checking Iterated Games | 2013-08-05 | Paper |
| Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width | 2013-06-20 | Paper |
| Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games | 2013-02-19 | Paper |
| Bounded Satisfiability for PCTL | 2012-11-22 | Paper |
| Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata | 2012-11-21 | Paper |
| Synthesis of Succinct Systems | 2012-11-21 | Paper |
| Playing Optimally on Timed Automata with Random Delays | 2012-11-21 | Paper |
| Time and Parallelizability Results for Parity Games with Bounded Treewidth | 2012-11-01 | Paper |
| Efficient Approximation of Optimal Control for Markov Games | 2012-08-31 | Paper |
| Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete | 2012-08-29 | Paper |
| Büchi Complementation Made Tight | 2012-04-24 | Paper |
| Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games | 2012-03-23 | Paper |
| The Buck Stops Here: Order, Chance, and Coordination in Distributed Control | 2011-10-07 | Paper |
| Coordination Logic | 2010-09-03 | Paper |
| From Parity and Payoff Games to Linear Programming | 2009-10-16 | Paper |
| Tighter Bounds for the Determinisation of Büchi Automata | 2009-03-31 | Paper |
| Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus | 2009-03-12 | Paper |
| Automatic Synthesis of Assumptions for Compositional Model Checking | 2009-03-11 | Paper |
| An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games | 2008-11-20 | Paper |
| Selective Approaches for Solving Weak Games | 2008-09-04 | Paper |
| Synthesis for Probabilistic Environments | 2008-09-04 | Paper |
| ATL* Satisfiability Is 2EXPTIME-Complete | 2008-08-19 | Paper |
| Distributed Synthesis for Alternating-Time Logics | 2008-07-03 | Paper |
| Bounded Synthesis | 2008-07-03 | Paper |
| Solving Parity Games in Big Steps | 2008-04-24 | Paper |
| Synthesis of Asynchronous Systems | 2007-09-10 | Paper |
| SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS | 2007-03-13 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
