| Publication | Date of Publication | Type |
|---|
| Timed games and deterministic separability | 2026-03-18 | Paper |
| Cost automata, safe schemes, and downward closures | 2026-03-18 | Paper |
| Multiplicity problems on algebraic series and context-free grammars | 2026-02-27 | Paper |
| Weighted basic parallel processes and combinatorial enumeration | 2026-02-10 | Paper |
| On rational recursive sequences | 2024-10-08 | Paper |
Cost Automata, Safe Schemes, and Downward Closures
Fundamenta Informaticae | 2023-05-19 | Paper |
Timed Basic Parallel Processes
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7566065 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-02 | Paper |
| scientific article; zbMATH DE number 7566065 (Why is no real title available?) | 2022-08-02 | Paper |
scientific article; zbMATH DE number 7559498 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7453188 (Why is no real title available?) | 2022-01-06 | Paper |
scientific article; zbMATH DE number 7453188 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
(available as arXiv preprint) | 2021-07-28 | Paper |
Reachability relations of timed pushdown automata
Journal of Computer and System Sciences | 2021-02-02 | Paper |
| Timed pushdown automata and branching vector addition systems | 2021-01-19 | Paper |
Regular separability of Parikh automata
(available as arXiv preprint) | 2020-05-27 | Paper |
Binary reachability of timed-register pushdown automata and branching vector addition systems
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Efficient reduction of nondeterministic automata with application to language inclusion testing
(available as arXiv preprint) | 2019-02-25 | Paper |
Timed Pushdown Automata Revisited
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The diagonal problem for higher-order recursion schemes is decidable
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Separability of reachability sets of vector addition systems
(available as arXiv preprint) | 2018-04-19 | Paper |
Reachability analysis of first-order definable pushdown systems
(available as arXiv preprint) | 2017-08-31 | Paper |
Ordered tree-pushdown systems
(available as arXiv preprint) | 2017-07-13 | Paper |
Non-zero sum games for reactive synthesis
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Stochastic parity games on lossy channel systems
Logical Methods in Computer Science | 2015-01-15 | Paper |
Advanced automata minimization
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Decidable topologies for communicating automata with FIFO and bag channels
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Reachability of communicating timed processes
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Advanced Ramsey-based Büchi automata inclusion testing
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Büchi automata can have smaller quotients
Automata, Languages and Programming | 2011-07-07 | Paper |
Multipebble simulations for alternating automata (extended abstract)
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
