| Publication | Date of Publication | Type |
|---|
| The boundedness and zero isolation problems for weighted automata over nonnegative rationals | 2024-12-06 | Paper |
| The complexity of soundness in workflow nets | 2024-12-06 | Paper |
| Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality | 2024-11-14 | Paper |
| On rational recursive sequences | 2024-10-08 | Paper |
On polynomial recursive sequences
Theory of Computing Systems | 2024-10-07 | Paper |
| Dynamic data structures for timed automata acceptance | 2024-02-12 | Paper |
| Fast termination and workflow nets | 2024-02-01 | Paper |
Coverability in 2-VASS with one unary counter is in NP
Lecture Notes in Computer Science | 2023-11-24 | Paper |
| scientific article; zbMATH DE number 7650822 (Why is no real title available?) | 2023-02-07 | Paper |
Continuous One-counter Automata
ACM Transactions on Computational Logic | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7649936 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
The Reachability Problem for Petri Nets Is Not Elementary
Journal of the ACM | 2022-12-08 | Paper |
A robust class of linear recurrence sequences
Information and Computation | 2022-12-08 | Paper |
| Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations | 2022-12-07 | Paper |
Dynamic data structures for timed automata acceptance
Algorithmica | 2022-10-27 | Paper |
scientific article; zbMATH DE number 7559504 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Monadic datalog and regular tree pattern queries
ACM Transactions on Database Systems | 2021-11-25 | Paper |
scientific article; zbMATH DE number 7407779 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407779 (Why is no real title available?) | 2021-10-08 | Paper |
scientific article; zbMATH DE number 7407773 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407773 (Why is no real title available?) | 2021-10-08 | Paper |
| Affine extensions of integer vector addition systems with states | 2021-08-04 | Paper |
| When is containment decidable for probabilistic automata? | 2021-07-28 | Paper |
Weak cost register automata are still powerful
International Journal of Foundations of Computer Science | 2021-04-19 | 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 |
| Timed pushdown automata and branching vector addition systems | 2021-01-19 | Paper |
| Pumping lemmas for weighted automata | 2020-08-05 | Paper |
| Polynomial-space completeness of reachability for succinct branching VASS in dimension one | 2020-05-27 | Paper |
The reachability problem for Petri nets is not elementary
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
The reachability problem for Petri nets is not elementary
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Binary reachability of timed-register pushdown automata and branching vector addition systems
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Copyless cost-register automata: structure, expressiveness, and closure properties
Journal of Computer and System Sciences | 2019-05-02 | Paper |
Weak cost register automata are still powerful
(available as arXiv preprint) | 2018-11-22 | Paper |
Decidability of weak logics with deterministic transitive closure
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Copyless cost-register automata: structure, expressiveness, and closure properties
(available as arXiv preprint) | 2018-01-24 | Paper |
| Maximal partition logic: towards a logical characterization of copyless cost register automata | 2017-08-31 | Paper |
Complexity of two-variable logic on finite trees
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Eliminating recursion from monadic datalog programs on trees
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Monadic datalog and regular tree pattern queries
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Complexity of two-variable logic on finite trees
Automata, Languages, and Programming | 2013-08-07 | Paper |
