| Publication | Date of Publication | Type |
|---|
| Cyclotomic identity testing and applications | 2025-01-20 | Paper |
| On the computation of the Zariski closure of finitely generated groups of matrices | 2025-01-17 | Paper |
| The membership problem for hypergeometric sequences with rational parameters | 2025-01-17 | Paper |
| On rational recursion for holonomic sequences | 2025-01-10 | Paper |
| On the existential theories of Büchi arithmetic and linear \(p\)-adic fields | 2024-12-19 | Paper |
| The monadic theory of toric words | 2024-12-12 | Paper |
| On the Skolem problem and the Skolem conjecture | 2024-12-06 | Paper |
| Identity testing for radical expressions | 2024-12-06 | Paper |
| The Skolem landscape (invited talk) | 2024-11-14 | Paper |
| Positivity problems for reversible linear recurrence sequences | 2024-11-14 | Paper |
| Porous invariants for linear systems | 2024-11-04 | Paper |
| Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications | 2024-08-13 | Paper |
| Skolem meets schanuel | 2024-08-06 | Paper |
| The pseudo-reachability problem for diagonalisable linear dynamical systems | 2024-08-06 | Paper |
| Bounding the escape time of a linear dynamical system over a compact semialgebraic set | 2024-08-06 | Paper |
| A universal Skolem set of positive lower density | 2024-08-06 | Paper |
| On the Monniaux problem in abstract interpretation | 2024-04-19 | Paper |
| On the 𝑝-adic zeros of the Tribonacci sequence | 2024-02-28 | Paper |
| The Membership Problem for Hypergeometric Sequences with Quadratic Parameters | 2023-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134272 | 2023-08-21 | Paper |
| What's decidable about discrete linear dynamical systems? | 2023-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168448 | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168485 | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168447 | 2023-08-08 | Paper |
| Markov chains and unambiguous automata | 2023-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874324 | 2023-02-07 | Paper |
| Algebraic model checking for discrete linear dynamical systems | 2023-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5053308 | 2022-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092319 | 2022-07-21 | Paper |
| On Reachability Problems for Low-Dimensional Matrix Semigroups | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090452 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089280 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089224 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089305 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089299 | 2022-07-18 | Paper |
| Skolem Meets Schanuel | 2022-04-28 | Paper |
| On the transcendence of a series related to Sturmian words | 2022-04-18 | Paper |
| Porous invariants | 2022-03-25 | Paper |
| \(o\)-minimal invariants for linear loops | 2022-02-24 | Paper |
| Probabilistic automata of bounded ambiguity | 2022-01-06 | Paper |
| Costs and rewards in priced timed automata | 2022-01-06 | Paper |
| First-order orbit queries | 2021-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009460 | 2021-08-04 | Paper |
| \(o\)-minimal invariants for linear loops | 2021-07-28 | Paper |
| When is containment decidable for probabilistic automata? | 2021-07-28 | Paper |
| Costs and rewards in priced timed automata | 2021-07-28 | Paper |
| On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices | 2021-06-03 | Paper |
| When are emptiness and containment decidable for probabilistic automata? | 2021-04-14 | Paper |
| Polynomial Invariants for Affine Programs | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144644 | 2021-01-19 | Paper |
| Polynomial automata: zeroness and applications | 2021-01-19 | Paper |
| On the Skolem Problem and Prime Powers | 2020-06-12 | Paper |
| Probabilistic automata of bounded ambiguity | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111354 | 2020-05-27 | Paper |
| Timed temporal logics | 2020-02-24 | Paper |
| On the decidability of membership in matrix-exponential semigroups | 2020-02-11 | Paper |
| How Fast Can You Escape a Compact Polytope? | 2020-01-14 | Paper |
| Effective definability of the reachability relation in timed automata | 2019-11-21 | Paper |
| On the decidability of reachability in linear time-invariant systems | 2019-10-22 | Paper |
| Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem | 2019-08-27 | Paper |
| Positivity problems for low-order linear recurrence sequences | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376664 | 2019-05-17 | Paper |
| Markov chains and unambiguous Büchi automata | 2019-05-03 | Paper |
| Algebraic Invariants for Linear Hybrid Automata | 2019-02-27 | Paper |
| Model checking flat Freeze LTL on one-counter automata | 2019-01-18 | Paper |
| Game characterization of probabilistic bisimilarity, and applications to pushdown automata | 2018-11-30 | Paper |
| On the complexity of the orbit problem | 2018-08-02 | Paper |
| Model Checking Real-Time Systems | 2018-07-20 | Paper |
| On rationality of nonnegative matrix factorization | 2018-07-16 | Paper |
| On the complexity of linear arithmetic with divisibility | 2018-04-23 | Paper |
| On recurrent reachability for continuous linear dynamical systems | 2018-04-23 | Paper |
| Solvability of Matrix-Exponential Equations | 2018-04-23 | Paper |
| Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem | 2018-04-19 | Paper |
| Model checking flat freeze LTL on one-counter automata | 2018-03-21 | Paper |
| On the Decidability of Reachability in Linear Time-Invariant Systems | 2018-02-19 | Paper |
| On restricted nonnegative matrix factorization | 2017-12-19 | Paper |
| On the Skolem problem for continuous linear dynamical systems | 2017-12-19 | Paper |
| Proving the Herman-protocol conjecture | 2017-12-19 | Paper |
| On termination of integer linear loops | 2017-10-05 | Paper |
| The polyhedron-hitting problem | 2017-10-05 | Paper |
| Nonnegative matrix factorization requires irrationality | 2017-07-21 | Paper |
| Complexity of two-variable logic on finite trees | 2017-07-13 | Paper |
| Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete | 2017-07-12 | Paper |
| On the polytope escape problem for continuous linear dynamical systems | 2017-07-11 | Paper |
| Expressive completeness for metric temporal logic | 2017-07-03 | Paper |
| On the magnitude of completeness thresholds in bounded model checking | 2017-05-16 | Paper |
| Minimisation of multiplicity tree automata | 2017-05-08 | Paper |
| Relating reachability problems in timed and counter automata | 2017-03-16 | Paper |
| Bisimilarity of probabilistic pushdown automata | 2017-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955006 | 2017-01-24 | Paper |
| Complexity of equivalence and learning for multiplicity tree automata | 2016-02-19 | Paper |
| Minimisation of multiplicity tree automata | 2015-10-01 | Paper |
| Three variables suffice for real-time logic | 2015-10-01 | Paper |
| Reachability problems for Markov chains | 2014-12-09 | Paper |
| Complexity of equivalence and learning for multiplicity tree automata | 2014-10-14 | Paper |
| The orbit problem in higher dimensions | 2014-08-07 | Paper |
| Language equivalence of probabilistic pushdown automata | 2014-07-18 | Paper |
| Time-bounded reachability for monotonic hybrid automata: complexity and fixed points | 2014-07-08 | Paper |
| On the positivity problem for simple linear recurrence sequences | 2014-07-01 | Paper |
| Ultimate positivity is decidable for simple linear recurrence sequences | 2014-07-01 | Paper |
| Algorithmic probabilistic game semantics. Playing games with automata | 2014-06-30 | Paper |
| The complexity of computing a bisimilarity pseudometric on probabilistic automata | 2014-06-02 | Paper |
| Addendum to ``Recursively defined metric spaces without contraction | 2014-01-10 | Paper |
| Labelled Markov processes as generalised stochastic relations | 2013-12-06 | Paper |
| A static analysis framework for livelock freedom in CSP | 2013-09-26 | Paper |
| Zeno, Hercules and the Hydra: downward rational termination is Ackermannian | 2013-09-20 | Paper |
| Axioms for probability and nondeterminism | 2013-09-09 | Paper |
| Timed CSP = closed timed automata | 2013-08-15 | Paper |
| A note on coalgebras and presheaves | 2013-08-15 | Paper |
| Complexity of two-variable logic on finite trees | 2013-08-07 | Paper |
| Revisiting the equivalence problem for finite multitape automata | 2013-08-07 | Paper |
| LTL model checking of interval Markov chains | 2013-08-05 | Paper |
| Two variable vs. linear temporal logic in model checking and games | 2013-06-20 | Paper |
| On the Complexity of Equivalence and Minimisation for Q-weighted Automata | 2013-04-09 | Paper |
| Three tokens in Herman's algorithm | 2013-03-22 | Paper |
| On termination and invariance for faulty channel machines | 2013-03-22 | Paper |
| On termination for faulty channel machines | 2013-03-19 | Paper |
| On the relationship between reachability problems in timed and counter automata | 2013-01-07 | Paper |
| Decision problems for linear recurrence sequences | 2013-01-07 | Paper |
| The Church synthesis problem with metric | 2012-09-18 | Paper |
| Computing rational radical sums in uniform \(\mathrm{TC}^0\) | 2012-08-29 | Paper |
| On the complexity of computing probabilistic bisimilarity | 2012-06-22 | Paper |
| On the Complexity of the Equivalence Problem for Probabilistic Automata | 2012-06-22 | Paper |
| Branching-time model checking of parametric one-counter automata | 2012-06-22 | Paper |
| Tractable Reasoning in a Fragment of Separation Logic | 2011-09-02 | Paper |
| Static Livelock Analysis in CSP | 2011-09-02 | Paper |
| Two variable vs. linear temporal logic in model checking and games | 2011-09-02 | Paper |
| Linear completeness thresholds for bounded model checking | 2011-08-19 | Paper |
| On reachability for hybrid automata over bounded time | 2011-07-07 | Paper |
| On stabilization in Herman's algorithm | 2011-07-07 | Paper |
| On Process-Algebraic Extensions of Metric Temporal Logic | 2010-10-26 | Paper |
| Model checking succinct and parametric one-counter automata | 2010-09-07 | Paper |
| Towards a theory of time-bounded verification | 2010-09-07 | Paper |
| Reachability in Succinct and Parametric One-Counter Automata | 2009-10-22 | Paper |
| Time-Bounded Verification | 2009-10-22 | Paper |
| Testing Semantics: Connecting Processes and Process Logics | 2009-04-28 | Paper |
| Nets with Tokens Which Carry Data | 2009-03-11 | Paper |
| Nets with tokens which carry data | 2009-02-12 | Paper |
| Universality analysis for one-clock timed automata | 2009-02-10 | Paper |
| Some Recent Results in Metric Temporal Logic | 2008-12-02 | Paper |
| On Expressiveness and Complexity in Real-Time Model Checking | 2008-08-19 | Paper |
| Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems | 2008-08-07 | Paper |
| Undecidability of Universality for Timed Automata with Minimal Resources | 2008-07-03 | Paper |
| Zone-Based Universality Analysis for Single-Clock Timed Automata | 2008-07-01 | Paper |
| On the decidability and complexity of Metric Temporal Logic over finite words | 2007-10-11 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems | 2007-09-07 | Paper |
| Recursively defined metric spaces without contraction | 2007-07-16 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-05-02 | Paper |
| Approximating and computing behavioural distances in probabilistic transition systems | 2006-09-14 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| A note on coalgebras and presheaves | 2005-08-03 | Paper |
| On the final sequence of a finitary set functor | 2005-06-30 | Paper |
| A behavioural pseudometric for probabilistic transition systems | 2005-04-06 | Paper |
| Domain theory, testing and simulation for labelled Markov processes | 2005-04-06 | Paper |
| Measuring the probabilistic powerdomain | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737187 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737180 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457839 | 2004-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418006 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417860 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791270 | 2003-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535035 | 2002-06-12 | Paper |
| On the structure of categories of coalgebras | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499300 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936143 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256309 | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222958 | 1999-01-06 | Paper |
| Skolem Meets Bateman-Horn | N/A | Paper |
| Twisted rational zeros of linear recurrence sequences | N/A | Paper |
| On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words | N/A | Paper |
