| Publication | Date of Publication | Type |
|---|
| Process symmetry in probabilistic transducers | 2026-03-23 | Paper |
Jumping automata over infinite words
Theory of Computing Systems | 2025-01-13 | Paper |
| The geometry of reachability in continuous vector addition systems with states | 2024-12-03 | Paper |
| Determinization of integral discounted-sum automata is decidable | 2024-10-30 | Paper |
| Dimension-minimality and primality of counter nets | 2024-10-30 | Paper |
| Determinization of one-counter nets | 2024-08-13 | Paper |
| Concurrent games with multiple topologies | 2024-08-13 | Paper |
Temporal segmentation in multi agent path finding with applications to explainability
Artificial Intelligence | 2024-07-03 | Paper |
| scientific article; zbMATH DE number 7830359 (Why is no real title available?) | 2024-04-10 | Paper |
Simulation by Rounds of Letter-to-Letter Transducers
Logical Methods in Computer Science | 2024-01-16 | Paper |
Jumping automata over Infinite words
Developments in Language Theory | 2023-11-16 | Paper |
| Quantitative assume guarantee synthesis | 2022-08-12 | 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 7559494 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559503 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
o-minimal invariants for discrete-time dynamical systems
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
What's decidable about weighted 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 |
| \(o\)-minimal invariants for linear loops | 2021-07-28 | Paper |
Weak cost register automata are still powerful
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Good-enough synthesis
(available as arXiv preprint) | 2021-02-09 | Paper |
scientific article; zbMATH DE number 7204476 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-27 | Paper |
Sensing as a complexity measure
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Weak cost register automata are still powerful
(available as arXiv preprint) | 2018-11-22 | Paper |
Formally reasoning about quality
Journal of the ACM | 2018-08-02 | Paper |
Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
(available as arXiv preprint) | 2018-03-21 | Paper |
Latticed-LTL synthesis in the presence of noisy inputs
Discrete Event Dynamic Systems | 2017-11-10 | Paper |
| Repairing multi-player games | 2017-09-12 | Paper |
| Sensing as a complexity measure | 2017-08-31 | Paper |
High-Quality Synthesis Against Stochastic Environments
(available as arXiv preprint) | 2017-07-19 | Paper |
| The sensing cost of monitoring and synthesis | 2017-07-13 | Paper |
| Regular sensing | 2017-04-25 | Paper |
Discounting in LTL
Tools and Algorithms for the Construction and Analysis of Systems | 2015-02-10 | Paper |
Latticed-LTL synthesis in the presence of noisy inputs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Formalizing and Reasoning about Quality
Automata, Languages, and Programming | 2013-08-07 | Paper |
What's decidable about weighted automata?
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Max and sum semantics for alternating weighted automata
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Promptness in \(\omega \)-regular automata
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
