| Publication | Date of Publication | Type |
|---|
| Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete | 2024-12-06 | Paper |
| Expressiveness and decidability of temporal logics for asynchronous hyperproperties | 2024-08-13 | Paper |
| The addition of temporal neighborhood makes the logic of prefixes and sub-intervals \textsc{ExpSpace-complete} | 2024-06-27 | Paper |
| On the complexity of model checking knowledge and time | 2024-04-26 | Paper |
| Parametric interval temporal logic over infinite words | 2024-02-08 | Paper |
| Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes | 2023-10-02 | Paper |
| \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes | 2023-09-27 | Paper |
| Interval Temporal Logic for Visibly Pushdown Systems | 2023-07-18 | Paper |
| Quantifying over Trees in Monadic Second-Order Logic | 2023-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875669 | 2023-02-03 | Paper |
| Complexity analysis of a unifying algorithm for model checking interval temporal logic | 2023-02-03 | Paper |
| Hierarchical cost-parity games | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875668 | 2023-02-03 | Paper |
| On a Temporal Logic of Prefixes and Infixes. | 2022-07-18 | Paper |
| Results on alternating-time temporal logics with linear past | 2022-05-28 | Paper |
| Context-free timed formalisms: robust automata and linear temporal logics | 2022-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028481 | 2022-02-09 | Paper |
| Complexity issues for timeline-based planning over dense time under future and minimal semantics | 2022-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384890 | 2021-12-17 | Paper |
| On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions | 2021-12-14 | Paper |
| On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking | 2021-12-14 | Paper |
| Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete | 2021-12-07 | Paper |
| Complexity analysis of a unifying algorithm for model checking interval temporal logic | 2021-09-21 | Paper |
| The complexity of synthesizing uniform strategies | 2021-05-06 | Paper |
| Opacity issues in games with imperfect information | 2021-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964726 | 2021-03-03 | Paper |
| Hierarchical cost-parity games | 2020-11-06 | Paper |
| Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption | 2020-05-27 | Paper |
| Model checking interval temporal logics with regular expressions | 2020-05-26 | Paper |
| Timeline-based planning over dense temporal domains | 2020-04-21 | Paper |
| Alternating-time temporal logics with linear past | 2020-04-21 | Paper |
| An in-depth investigation of interval temporal logic model checking with regular expressions | 2019-09-16 | Paper |
| Which fragments of the interval temporal logic HS are tractable in model checking? | 2019-03-13 | Paper |
| Interval vs. point temporal logic model checking. An expressiveness comparison | 2019-02-07 | Paper |
| Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy | 2018-09-27 | Paper |
| Event-clock nested automata | 2018-06-26 | Paper |
| Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison | 2018-04-19 | Paper |
| Visibly linear temporal logic | 2018-02-02 | Paper |
| Visibly rational expressions | 2017-01-26 | Paper |
| On the expressiveness of temporal equilibrium logic | 2016-11-30 | Paper |
| Interval temporal logic model checking: the border between good and bad HS fragments | 2016-09-05 | Paper |
| Foundations of Boolean stream runtime verification | 2016-05-02 | Paper |
| The complexity of one-agent refinement modal logic | 2015-10-12 | Paper |
| Unifying hyper and epistemic temporal logics | 2015-10-01 | Paper |
| Uniform strategies, rational relations and jumping automata | 2015-06-01 | Paper |
| CaRet with forgettable past | 2015-03-23 | Paper |
| Refinement modal logic | 2014-11-28 | Paper |
| Visibly linear temporal logic | 2014-09-26 | Paper |
| Visibly rational expressions | 2014-06-12 | Paper |
| Verification of gap-order constraint abstractions of counter systems | 2014-02-04 | Paper |
| On timed alternating simulation for concurrent timed games | 2012-10-24 | Paper |
| On timed alternating simulation for concurrent timed games | 2012-10-15 | Paper |
| The complexity of one-agent refinement modal logic | 2012-09-21 | Paper |
| Verification of gap-order constraint abstractions of counter systems | 2012-06-15 | Paper |
| Strong termination for gap-order constraint abstractions of counter systems | 2012-06-08 | Paper |
| Hardness of preorder checking for basic formalisms | 2011-12-07 | Paper |
| Complexity analysis of the backward coverability algorithm for VASS | 2011-10-07 | Paper |
| Hybrid and first-order complete extensions of CaRet | 2011-07-01 | Paper |
| Hardness of preorder checking for basic formalisms | 2011-01-07 | Paper |
| Pushdown module checking | 2010-05-05 | Paper |
| Complexity and succinctness issues for linear-time hybrid logics | 2009-12-15 | Paper |
| Decision problems for lower/upper bound parametric timed automata | 2009-12-02 | Paper |
| On decidability of LTL model checking for process rewrite systems | 2009-03-26 | Paper |
| Complexity and Succinctness Issues for Linear-Time Hybrid Logics | 2008-10-27 | Paper |
| Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages | 2008-09-18 | Paper |
| Verification of well-formed communicating recursive state machines | 2008-09-16 | Paper |
| Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints | 2008-05-27 | Paper |
| Pushdown Module Checking | 2008-05-27 | Paper |
| On Decidability of LTL Model Checking for Process Rewrite Systems | 2008-04-17 | Paper |
| The Complexity of CTL* + Linear Past | 2008-04-11 | Paper |
| Decision Problems for Lower/Upper Bound Parametric Timed Automata | 2007-11-28 | Paper |
| Controller Synthesis for MTL Specifications | 2007-09-04 | Paper |
| Complexity results on branching-time pushdown model checking | 2007-07-16 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2007-02-12 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2007-02-12 | Paper |
| Model checking for process rewrite systems and a class of action-based regular properties | 2006-09-14 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2005-12-06 | Paper |
