| Publication | Date of Publication | Type |
|---|
| On the 𝑝-adic zeros of the Tribonacci sequence | 2024-02-28 | 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/Q6168410 | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168447 | 2023-08-08 | 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/Q5874324 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875364 | 2023-02-03 | Paper |
| Reachability in Injective Piecewise Affine Maps | 2023-01-23 | Paper |
| Algebraic model checking for discrete linear dynamical systems | 2023-01-18 | Paper |
| Sequential Relational Decomposition | 2022-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091195 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092319 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089224 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089280 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089299 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090452 | 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 Discrete-Time Dynamical Systems | 2022-02-24 | Paper |
| First-order orbit queries | 2021-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009460 | 2021-08-04 | Paper |
| O-Minimal Invariants for Discrete-Time Dynamical Systems | 2021-07-28 | Paper |
| Sequential Relational Decomposition | 2021-01-20 | Paper |
| Polynomial Invariants for Affine Programs | 2021-01-20 | Paper |
| On the Skolem Problem and Prime Powers | 2020-06-12 | 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 |
| 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 |
| Cyclic-routing of unmanned aerial vehicles | 2019-06-25 | Paper |
| Positivity Problems for Low-Order Linear Recurrence Sequences | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376664 | 2019-05-17 | Paper |
| Algebraic Invariants for Linear Hybrid Automata | 2019-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4611376 | 2019-01-18 | Paper |
| Convex language semantics for nondeterministic probabilistic automata | 2018-11-23 | Paper |
| On the Complexity of the Orbit Problem | 2018-08-02 | Paper |
| Model Checking Real-Time Systems | 2018-07-20 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4636627 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608681 | 2018-03-21 | Paper |
| On the Decidability of Reachability in Linear Time-Invariant Systems | 2018-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598241 | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598245 | 2017-12-19 | Paper |
| The Polyhedron-Hitting Problem | 2017-10-05 | Paper |
| On Termination of Integer Linear Loops | 2017-10-05 | Paper |
| Zeno, Hercules, and the Hydra | 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 |
| On parametric timed automata and one-counter machines | 2017-03-16 | Paper |
| Relating Reachability Problems in Timed and Counter Automata | 2017-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955006 | 2017-01-24 | Paper |
| The Cyclic-Routing UAV Problem is PSPACE-Complete | 2015-10-01 | Paper |
| Reachability problems for Markov chains | 2014-12-09 | Paper |
| Advances in Parametric Real-Time Reasoning | 2014-10-14 | Paper |
| The orbit problem in higher dimensions | 2014-08-07 | Paper |
| Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points | 2014-07-08 | Paper |
| On the Complexity of Temporal-Logic Path Checking | 2014-07-01 | 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 |
| Foundations for Decision Problems in Separation Logic with General Inductive Predicates | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852365 | 2013-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852081 | 2013-10-07 | 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 |
| https://portal.mardi4nfdi.de/entity/Q2847403 | 2013-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2845499 | 2013-08-30 | Paper |
| Timed CSP = Closed Timed Automata1 | 2013-08-15 | Paper |
| On the Complexity of Equivalence and Minimisation for Q-weighted Automata | 2013-04-09 | Paper |
| On termination and invariance for faulty channel machines | 2013-03-22 | Paper |
| Three tokens in Herman's algorithm | 2013-03-22 | Paper |
| On Termination for Faulty Channel Machines | 2013-03-19 | Paper |
| Decision Problems for Linear Recurrence Sequences | 2013-01-07 | Paper |
| On the Relationship between Reachability Problems in Timed and Counter Automata | 2013-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2915691 | 2012-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908860 | 2012-08-29 | Paper |
| SAT-solving in CSP trace refinement | 2012-07-20 | Paper |
| Branching-Time Model Checking of Parametric One-Counter Automata | 2012-06-22 | Paper |
| On the Complexity of the Equivalence Problem for Probabilistic Automata | 2012-06-22 | Paper |
| On Searching for Small Kochen-Specker Vector Systems | 2011-12-16 | Paper |
| Tractable Reasoning in a Fragment of Separation Logic | 2011-09-02 | Paper |
| Static Livelock Analysis in CSP | 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 |
| Towards a Theory of Time-Bounded Verification | 2010-09-07 | Paper |
| Model Checking Succinct and Parametric One-Counter Automata | 2010-09-07 | Paper |
| Reachability in Succinct and Parametric One-Counter Automata | 2009-10-22 | Paper |
| Time-Bounded Verification | 2009-10-22 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2009-05-15 | Paper |
| Integrated Formal Methods | 2009-05-07 | Paper |
| Nets with Tokens Which Carry Data | 2009-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601861 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601411 | 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 |
| 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 |
| State/Event Software Verification for Branching-Time Specifications | 2007-11-29 | 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 |
| Deciding Bit-Vector Arithmetic with Abstraction | 2007-09-03 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-05-02 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| Concurrent software verification with states, events, and deadlocks | 2006-10-25 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems | 2005-10-19 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Domain theory, testing and simulation for labelled Markov processes | 2005-04-06 | Paper |
| Efficient verification of sequential and concurrent C programs | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472226 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457839 | 2004-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417860 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418006 | 2003-07-30 | Paper |
