| Publication | Date of Publication | Type |
|---|
| New algorithms for combinations of objectives using separating automata | 2024-12-06 | Paper |
| How to play optimally for regular objectives? | 2024-11-14 | Paper |
From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
TheoretiCS | 2024-07-03 | Paper |
| On the Monniaux problem in abstract interpretation | 2024-04-19 | Paper |
Playing Safe, Ten Years Later
Logical Methods in Computer Science | 2024-03-11 | Paper |
| Scalable anytime algorithms for learning fragments of linear temporal logic | 2024-01-23 | Paper |
| scientific article; zbMATH DE number 7650822 (Why is no real title available?) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650909 (Why is no real title available?) | 2023-02-07 | Paper |
A robust class of linear recurrence sequences
Information and Computation | 2022-12-08 | Paper |
The Theory of Universal Graphs for Infinite Duration Games
Logical Methods in Computer Science | 2022-10-06 | Paper |
| Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games | 2022-07-18 | Paper |
| Quantifying Bounds in Strategy Logic | 2022-05-28 | Paper |
scientific article; zbMATH DE number 7471672 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471672 (Why is no real title available?) | 2022-02-09 | Paper |
Probabilistic automata of bounded ambiguity
Information and Computation | 2022-01-06 | Paper |
Lower bounds for arithmetic circuits via the Hankel matrix
Computational Complexity | 2021-11-24 | Paper |
| A reduction from parity games to simple stochastic games | 2021-03-03 | Paper |
A reduction from parity games to simple stochastic games
(available as arXiv preprint) | 2021-03-03 | Paper |
| The theory of universal graphs for games: past and future | 2021-02-22 | Paper |
The state complexity of alternating automata
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| Controlling a random population | 2020-09-23 | Paper |
Trace refinement in labelled Markov decision processes
Logical Methods in Computer Science | 2020-06-26 | Paper |
| Probabilistic automata of bounded ambiguity | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7204557 (Why is no real title available?) | 2020-05-27 | Paper |
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers
Journal Of Logic And Computation | 2020-04-29 | Paper |
| Universal graphs and good for games automata: new tools for infinite duration games | 2020-01-28 | 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 |
Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
Theory of Computing Systems | 2019-08-27 | Paper |
| Profinite techniques for probabilistic automata | 2019-07-03 | Paper |
Expressiveness of probabilistic modal logics: a gradual approach
Information and Computation | 2019-05-29 | Paper |
Timed comparisons of semi-Markov processes
(available as arXiv preprint) | 2018-06-26 | Paper |
| Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem | 2018-04-19 | Paper |
On the Decidability of Reachability in Linear Time-Invariant Systems
(available as arXiv preprint) | 2018-02-19 | Paper |
| Characterisation of an algebraic algorithm for probabilistic automata | 2018-01-24 | Paper |
| The bridge between regular cost functions and omega-regular languages | 2017-12-19 | Paper |
| Irregular behaviours for probabilistic automata | 2017-10-27 | Paper |
Monadic second-order logic with arbitrary monadic predicates
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
| Stamina: stabilisation monoids in automata theory | 2017-08-22 | Paper |
The online space complexity of probabilistic languages
Logical Foundations of Computer Science | 2017-07-21 | Paper |
Profinite techniques for probabilistic automata and the Markov monoid algorithm
Theoretical Computer Science | 2017-05-18 | Paper |
Profinite techniques for probabilistic automata and the Markov monoid algorithm
Theoretical Computer Science | 2017-05-18 | Paper |
Deciding the value 1 problem for probabilistic leaktight automata
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Playing Safe | 2017-04-25 | Paper |
| Emptiness Of Alternating Tree Automata Using Games With Imperfect Information | 2017-02-21 | Paper |
Infinite-state games with finitary conditions
(available as arXiv preprint) | 2017-02-02 | Paper |
| Cost-parity and cost-Streett games | 2017-01-26 | Paper |
Trace refinement in labelled Markov decision processes
Lecture Notes in Computer Science | 2016-06-10 | Paper |
ACME: automata with counters, monoids and equivalence
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Trading bounds for memory in games with counters
Automata, Languages, and Programming | 2015-11-04 | Paper |
Deciding the value 1 problem for probabilistic leaktight automata
Logical Methods in Computer Science | 2015-08-25 | Paper |
Two recursively inseparable problems for probabilistic automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Monadic second-order logic with arbitrary monadic predicates
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Parity and Streett games with costs
Logical Methods in Computer Science | 2014-07-31 | Paper |
Finitary languages
Language and Automata Theory and Applications | 2011-06-03 | Paper |
