| 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
Theoretical Computer Science | 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
Formal Methods in System Design | 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
Mathematics of Computation | 2024-02-28 | Paper |
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
scientific article; zbMATH DE number 7730630 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
What's decidable about discrete linear dynamical systems?
Lecture Notes in Computer Science | 2023-08-10 | Paper |
| scientific article; zbMATH DE number 7724207 (Why is no real title available?) | 2023-08-08 | Paper |
scientific article; zbMATH DE number 7724240 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
scientific article; zbMATH DE number 7724206 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
Markov chains and unambiguous automata
Journal of Computer and System Sciences | 2023-06-12 | Paper |
scientific article; zbMATH DE number 7650934 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Algebraic model checking for discrete linear dynamical systems | 2023-01-18 | Paper |
scientific article; zbMATH DE number 7626788 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-06 | Paper |
| scientific article; zbMATH DE number 7626788 (Why is no real title available?) | 2022-12-06 | Paper |
scientific article; zbMATH DE number 7561611 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
On Reachability Problems for Low-Dimensional Matrix Semigroups
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559115 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559471 (Why is no real title available?) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559425 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559494 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559488 (Why is no real title available?)
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2022-03-25 | Paper |
o-minimal invariants for discrete-time dynamical systems
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
Probabilistic automata of bounded ambiguity
Information and Computation | 2022-01-06 | Paper |
Costs and rewards in priced timed automata
Information and Computation | 2022-01-06 | Paper |
Costs and rewards in priced timed automata
Information and Computation | 2022-01-06 | Paper |
First-order orbit queries
Theory of Computing Systems | 2021-08-05 | Paper |
scientific article; zbMATH DE number 7378586 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| When is containment decidable for probabilistic automata? | 2021-07-28 | Paper |
| Costs and rewards in priced timed automata | 2021-07-28 | Paper |
| \(o\)-minimal invariants for linear loops | 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?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
When are emptiness and containment decidable for probabilistic automata?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Polynomial Invariants for Affine Programs
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7297846 (Why is no real title available?) | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297846 (Why is no real title available?)
(available as arXiv preprint) | 2021-01-19 | Paper |
| Polynomial automata: zeroness and applications | 2021-01-19 | Paper |
On the Skolem Problem and Prime Powers
(available as arXiv preprint) | 2020-06-12 | Paper |
| Probabilistic automata of bounded ambiguity | 2020-05-27 | Paper |
scientific article; zbMATH DE number 7204476 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-27 | Paper |
Timed temporal logics
Lecture Notes in Computer Science | 2020-02-24 | Paper |
On the decidability of membership in matrix-exponential semigroups
Journal of the ACM | 2020-02-11 | Paper |
How Fast Can You Escape a Compact Polytope?
(available as arXiv preprint) | 2020-01-14 | Paper |
Effective definability of the reachability relation in timed automata
Information Processing Letters | 2019-11-21 | Paper |
On the decidability of reachability in linear time-invariant systems
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 2019-10-22 | Paper |
On the decidability of reachability in linear time-invariant systems
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 2019-10-22 | Paper |
Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
Theory of Computing Systems | 2019-08-27 | Paper |
Positivity problems for low-order linear recurrence sequences
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
scientific article; zbMATH DE number 7056237 (Why is no real title available?)
(available as arXiv preprint) | 2019-05-17 | Paper |
Markov chains and unambiguous Büchi automata
Computer Aided Verification | 2019-05-03 | Paper |
Algebraic Invariants for Linear Hybrid Automata
(available as arXiv preprint) | 2019-02-27 | Paper |
Model checking flat Freeze LTL on one-counter automata
(available as arXiv preprint) | 2019-01-18 | Paper |
Game characterization of probabilistic bisimilarity, and applications to pushdown automata
(available as arXiv preprint) | 2018-11-30 | Paper |
On the complexity of the orbit problem
Journal of the ACM | 2018-08-02 | Paper |
Model Checking Real-Time Systems
Handbook of Model Checking | 2018-07-20 | Paper |
On rationality of nonnegative matrix factorization
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the complexity of linear arithmetic with divisibility
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On recurrent reachability for continuous linear dynamical systems
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Solvability of Matrix-Exponential Equations
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Solvability of Matrix-Exponential Equations
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 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
(available as arXiv preprint) | 2018-02-19 | Paper |
On restricted nonnegative matrix factorization
(available as arXiv preprint) | 2017-12-19 | Paper |
On the Skolem problem for continuous linear dynamical systems
(available as arXiv preprint) | 2017-12-19 | Paper |
Proving the Herman-protocol conjecture
(available as arXiv preprint) | 2017-12-19 | Paper |
On termination of integer linear loops
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The polyhedron-hitting problem
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Nonnegative matrix factorization requires irrationality
SIAM Journal on Applied Algebra and Geometry | 2017-07-21 | Paper |
Complexity of two-variable logic on finite trees
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
On the polytope escape problem for continuous linear dynamical systems
Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control | 2017-07-11 | Paper |
Expressive completeness for metric temporal logic
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
On the magnitude of completeness thresholds in bounded model checking
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Minimisation of multiplicity tree automata
Logical Methods in Computer Science | 2017-05-08 | Paper |
Relating reachability problems in timed and counter automata
Fundamenta Informaticae | 2017-03-16 | Paper |
Bisimilarity of probabilistic pushdown automata
(available as arXiv preprint) | 2017-01-26 | Paper |
| scientific article; zbMATH DE number 6677405 (Why is no real title available?) | 2017-01-24 | Paper |
Complexity of equivalence and learning for multiplicity tree automata
Journal of Machine Learning Research (JMLR) | 2016-02-19 | Paper |
Three variables suffice for real-time logic
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Minimisation of multiplicity tree automata
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Reachability problems for Markov chains
Information Processing Letters | 2014-12-09 | Paper |
Complexity of equivalence and learning for multiplicity tree automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The orbit problem in higher dimensions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Language equivalence of probabilistic pushdown automata
Information and Computation | 2014-07-18 | Paper |
Time-bounded reachability for monotonic hybrid automata: complexity and fixed points
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
On the positivity problem for simple linear recurrence sequences
Automata, Languages, and Programming | 2014-07-01 | Paper |
Ultimate positivity is decidable for simple linear recurrence sequences
Automata, Languages, and Programming | 2014-07-01 | Paper |
Algorithmic probabilistic game semantics. Playing games with automata
Formal Methods in System Design | 2014-06-30 | Paper |
The complexity of computing a bisimilarity pseudometric on probabilistic automata
Lecture Notes in Computer Science | 2014-06-02 | Paper |
Addendum to ``Recursively defined metric spaces without contraction
Theoretical Computer Science | 2014-01-10 | Paper |
Labelled Markov processes as generalised stochastic relations
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
A static analysis framework for livelock freedom in CSP
Logical Methods in Computer Science | 2013-09-26 | Paper |
Zeno, Hercules and the Hydra: downward rational termination is Ackermannian
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| Axioms for probability and nondeterminism | 2013-09-09 | Paper |
Timed CSP = closed timed automata
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
A note on coalgebras and presheaves
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
Complexity of two-variable logic on finite trees
Automata, Languages, and Programming | 2013-08-07 | Paper |
Revisiting the equivalence problem for finite multitape automata
Automata, Languages, and Programming | 2013-08-07 | Paper |
LTL model checking of interval Markov chains
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Two variable vs. linear temporal logic in model checking and games
Logical Methods in Computer Science | 2013-06-20 | Paper |
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Logical Methods in Computer Science | 2013-04-09 | Paper |
Three tokens in Herman's algorithm
Formal Aspects of Computing | 2013-03-22 | Paper |
On termination and invariance for faulty channel machines
Formal Aspects of Computing | 2013-03-22 | Paper |
| On termination for faulty channel machines | 2013-03-19 | Paper |
On termination for faulty channel machines
(available as arXiv preprint) | 2013-03-19 | Paper |
On the relationship between reachability problems in timed and counter automata
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Decision problems for linear recurrence sequences
Lecture Notes in Computer Science | 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
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
On the Complexity of the Equivalence Problem for Probabilistic Automata
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Branching-time model checking of parametric one-counter automata
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Tractable Reasoning in a Fragment of Separation Logic
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Static Livelock Analysis in CSP
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Two variable vs. linear temporal logic in model checking and games
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Linear completeness thresholds for bounded model checking
Computer Aided Verification | 2011-08-19 | Paper |
On reachability for hybrid automata over bounded time
Automata, Languages and Programming | 2011-07-07 | Paper |
On stabilization in Herman's algorithm
Automata, Languages and Programming | 2011-07-07 | Paper |
On Process-Algebraic Extensions of Metric Temporal Logic
Reflections on the Work of C.A.R. Hoare | 2010-10-26 | Paper |
Model checking succinct and parametric one-counter automata
Automata, Languages and Programming | 2010-09-07 | Paper |
Towards a theory of time-bounded verification
Automata, Languages and Programming | 2010-09-07 | Paper |
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Time-Bounded Verification
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Testing Semantics: Connecting Processes and Process Logics
Algebraic Methodology and Software Technology | 2009-04-28 | Paper |
Nets with Tokens Which Carry Data
Petri Nets and Other Models of Concurrency – ICATPN 2007 | 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
Lecture Notes in Computer Science | 2008-12-02 | Paper |
On Expressiveness and Complexity in Real-Time Model Checking
Automata, Languages and Programming | 2008-08-19 | Paper |
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
Logical Methods in Computer Science | 2008-08-07 | Paper |
Undecidability of Universality for Timed Automata with Minimal Resources
Lecture Notes in Computer Science | 2008-07-03 | Paper |
Zone-Based Universality Analysis for Single-Clock Timed Automata
Lecture Notes in Computer Science | 2008-07-01 | Paper |
On the decidability and complexity of Metric Temporal Logic over finite words
Logical Methods in Computer Science | 2007-10-11 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Recursively defined metric spaces without contraction
Theoretical Computer Science | 2007-07-16 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science | 2006-09-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
A note on coalgebras and presheaves
Mathematical Structures in Computer Science | 2005-08-03 | Paper |
On the final sequence of a finitary set functor
Theoretical Computer Science | 2005-06-30 | Paper |
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science | 2005-04-06 | Paper |
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science | 2005-04-06 | Paper |
Measuring the probabilistic powerdomain
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2086650 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086644 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2059569 (Why is no real title available?) | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 1956642 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1956514 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1864592 (Why is no real title available?) | 2003-02-06 | Paper |
| scientific article; zbMATH DE number 1754609 (Why is no real title available?) | 2002-06-12 | Paper |
On the structure of categories of coalgebras
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1497869 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1392304 (Why is no real title available?) | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1314223 (Why is no real title available?) | 1999-07-12 | Paper |
| scientific article; zbMATH DE number 1231634 (Why is no real title available?) | 1999-01-06 | Paper |
Skolem Meets Bateman-Horn
(available as arXiv preprint) | N/A | Paper |
Twisted rational zeros of linear recurrence sequences
(available as arXiv preprint) | N/A | Paper |
On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words
(available as arXiv preprint) | N/A | Paper |
