| Publication | Date of Publication | Type |
|---|
| On the complexity of model checking knowledge and time | 2024-04-26 | Paper |
| Reasoning about Quality and Fuzziness of Strategic Behaviors | 2023-07-18 | Paper |
| Hierarchical cost-parity games | 2023-02-03 | Paper |
| Evaluation of temporal datasets via interval temporal logic model checking | 2023-02-03 | Paper |
| Verification of agent navigation in partially-known environments | 2022-06-01 | Paper |
| Quantifying Bounds in Strategy Logic | 2022-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079770 | 2022-05-28 | Paper |
| Context-free timed formalisms: robust automata and linear temporal logics | 2022-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021006 | 2022-01-11 | Paper |
| Equilibria for games with combined qualitative and quantitative objectives | 2021-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384177 | 2021-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015276 | 2021-12-07 | Paper |
| Improving parity games in practice | 2021-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999223 | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5151033 | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144683 | 2021-01-19 | Paper |
| Hierarchical cost-parity games | 2020-11-06 | Paper |
| Verification of multi-agent systems with public actions against strategy logic | 2020-08-06 | Paper |
| Alternating-time temporal logics with linear past | 2020-04-21 | Paper |
| Natural strategic ability | 2020-01-20 | Paper |
| Model-checking graded computation-tree logic with finite path semantics | 2020-01-16 | Paper |
| Solving parity games: explicit vs symbolic | 2018-11-07 | Paper |
| CTL\(^\ast\) with graded path modalities | 2018-09-27 | Paper |
| Cycle detection in computation tree logic | 2018-09-27 | Paper |
| Event-clock nested automata | 2018-06-26 | Paper |
| Practical verification of multi-agent systems against \textsc{Slk} specifications | 2018-06-14 | Paper |
| Graded modalities in strategy logic | 2018-06-14 | Paper |
| Additional Winning Strategies in Reachability Games*† | 2018-05-03 | Paper |
| Reasoning about graded strategy quantifiers | 2018-03-21 | Paper |
| On the Boundary of Behavioral Strategies | 2017-07-03 | Paper |
| Substructure Temporal Logic | 2017-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2980973 | 2017-05-08 | Paper |
| Relentful strategic reasoning in alternating-time temporal logic | 2017-01-31 | Paper |
| Reasoning About Substructures and Games | 2017-01-30 | Paper |
| Prompt Interval Temporal Logic | 2016-11-30 | Paper |
| Ordered multi-stack visibly pushdown automata | 2016-11-24 | Paper |
| Solving Parity Games Using an Automata-Based Algorithm | 2016-11-09 | Paper |
| Checking interval properties of computations | 2016-10-21 | Paper |
| On Promptness in Parity Games*† | 2016-05-11 | Paper |
| On CTL* with Graded Path Modalities | 2016-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3456021 | 2015-12-11 | Paper |
| Graded computation tree logic | 2015-09-17 | Paper |
| Reasoning About Strategies | 2015-09-17 | Paper |
| A Behavioral Hierarchy of Strategy Logic | 2014-10-14 | Paper |
| On Promptness in Parity Games | 2014-01-17 | Paper |
| Automata-theoretic decision of timed games | 2013-12-10 | Paper |
| Pushdown module checking with imperfect information | 2013-06-06 | Paper |
| What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908844 | 2012-08-29 | Paper |
| Improved model checking of hierarchical systems | 2012-05-24 | Paper |
| Quantitatively fair scheduling | 2012-03-13 | Paper |
| Exploring the boundary of half-positionality | 2012-01-13 | Paper |
| Relentful Strategic Reasoning in Alternating-Time Temporal Logic | 2011-01-07 | Paper |
| Graded Computation Tree Logic with Binary Coding | 2010-09-03 | Paper |
| Exploring the Boundary of Half Positionality | 2010-08-24 | Paper |
| Pushdown module checking | 2010-05-05 | Paper |
| Improved Model Checking of Hierarchical Systems | 2010-01-14 | Paper |
| Balanced Paths in Colored Graphs | 2009-10-16 | Paper |
| Branching-Time Temporal Logics with Minimal Model Quantifiers | 2009-07-07 | Paper |
| Program Complexity in Hierarchical Module Checking | 2009-01-27 | Paper |
| Enriched MU-Calculi Module Checking | 2008-11-13 | Paper |
| The Complexity of Enriched Mu-Calculi | 2008-11-13 | Paper |
| Pushdown Module Checking with Imperfect Information | 2008-09-18 | Paper |
| Pushdown Module Checking | 2008-05-27 | Paper |
| Enriched μ–Calculus Pushdown Module Checking | 2008-05-15 | Paper |
| 2-Visibly Pushdown Automata | 2007-11-28 | Paper |
| The Complexity of Enriched μ-Calculi | 2007-09-11 | Paper |
| Enriched μ-Calculi Module Checking | 2007-09-07 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| TYPENESS FOR ω-REGULAR AUTOMATA | 2006-08-21 | Paper |
| Theoretical Aspects of Computing - ICTAC 2004 | 2005-11-30 | Paper |
| Weak Muller acceptance conditions for tree automata | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736990 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737000 | 2004-08-11 | Paper |
