| Publication | Date of Publication | Type |
|---|
| Positional-player games | 2026-08-05 | Paper |
| Coverage games | 2026-08-05 | Paper |
| Alternating-time temporal logic | 2026-05-21 | Paper |
| Perspective games with notifications | 2026-03-23 | Paper |
A hierarchy of nondeterminism
Logical Methods in Computer Science | 2026-02-13 | Paper |
Monotonicity characterizations of regular languages
Information and Computation | 2025-12-15 | Paper |
| Concurrent reachability games | 2025-10-29 | Paper |
Variable automata over infinite alphabets
Formal Methods in System Design | 2025-10-21 | Paper |
Synthesis with privacy against an observer
Logical Methods in Computer Science | 2025-09-25 | Paper |
| Monotonicity characterizations of regular languages | 2025-07-28 | Paper |
| Games with trading of control | 2025-06-26 | Paper |
| Modular model checking | 2025-03-19 | Paper |
| Alternating-time temporal logic | 2025-03-19 | Paper |
| Perspective games | 2024-12-19 | Paper |
| On semantically-deterministic automata | 2024-11-14 | Paper |
| Synthesis with privacy against an observer | 2024-10-30 | Paper |
| Synthesis of privacy-preserving systems | 2024-09-12 | Paper |
| CONCUR test-of-time award 2022 (invited paper) | 2024-08-13 | Paper |
| Energy games with resource-bounded environments | 2024-08-13 | Paper |
Perspective games
ACM Transactions on Computational Logic | 2024-04-26 | Paper |
The complexity of LTL rational synthesis
ACM Transactions on Computational Logic | 2024-04-25 | Paper |
| The complexity of LTL rational synthesis | 2024-01-23 | Paper |
| scientific article; zbMATH DE number 7770050 (Why is no real title available?) | 2023-11-23 | Paper |
Lazy regular sensing
Theoretical Computer Science | 2023-08-18 | Paper |
A Hierarchy of Nondeterminism
(available as arXiv preprint) | 2023-08-08 | Paper |
Reasoning about Quality and Fuzziness of Strategic Behaviors
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
A space-efficient on-the-fly algorithm for real-time model checking
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Minimization of automata for liveness languages
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
On the complexity of verifying concurrent transition systems
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Fair simulation
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
| scientific article; zbMATH DE number 7650823 (Why is no real title available?) | 2023-02-07 | Paper |
| Register-bounded synthesis | 2023-02-03 | Paper |
| Lazy regular sensing | 2023-01-18 | Paper |
Timed network games
Information and Computation | 2023-01-12 | Paper |
Multi-Valued Reasoning about Reactive Systems
Foundations and Trends® in Theoretical Computer Science | 2023-01-11 | Paper |
On (I/O)-Aware Good-For-Games Automata
1517.68186 | 2022-12-22 | Paper |
Minimization and canonization of GFG transition-based automata
(available as arXiv preprint) | 2022-08-30 | Paper |
| Minimization and canonization of GFG transition-based automata | 2022-08-30 | Paper |
| Quantitative assume guarantee synthesis | 2022-08-12 | Paper |
| Minimizing GFG Transition-Based Automata | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559422 (Why is no real title available?) | 2022-07-18 | Paper |
| On Repetition Languages | 2022-07-18 | Paper |
Certifying DFA bounds for recognition and separation
(available as arXiv preprint) | 2022-06-22 | Paper |
Canonicity in GFG and transition-based automata
(available as arXiv preprint) | 2022-01-11 | Paper |
| Canonicity in GFG and transition-based automata | 2022-01-11 | Paper |
What's decidable about weighted automata?
Information and Computation | 2022-01-06 | Paper |
| Verification | 2021-11-12 | Paper |
Certifying inexpressibility
(available as arXiv preprint) | 2021-10-18 | Paper |
Timed network games with clocks
(available as arXiv preprint) | 2021-08-04 | Paper |
| Spanning-tree games | 2021-08-04 | Paper |
| The unfortunate-flow problem | 2021-07-28 | Paper |
| Mutually accepting capacitated automata | 2021-07-14 | Paper |
| Games with full, longitudinal, and transverse observability | 2021-07-06 | Paper |
| Profile trees for Büchi word automata, with application to determinization | 2021-06-09 | Paper |
| Timed vacuity | 2021-05-04 | Paper |
Good-enough synthesis
(available as arXiv preprint) | 2021-02-09 | Paper |
How deterministic are good-for-games automata?
(available as arXiv preprint) | 2020-11-25 | Paper |
| Flow games | 2020-11-25 | Paper |
Hierarchical network formation games
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
On synthesis of specifications with arithmetic
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
| Properties and utilization of capacitated automata (invited talk) | 2020-07-19 | Paper |
| Flow logic | 2020-05-27 | Paper |
| Timed network games | 2020-05-26 | Paper |
Dynamic resource allocation games
Theoretical Computer Science | 2020-01-22 | Paper |
Capacitated automata and systems
Information and Computation | 2019-12-18 | Paper |
Sensing as a complexity measure
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
A Parametrized Analysis of Algorithms on Hierarchical Graphs
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Flow logic
(available as arXiv preprint) | 2019-11-26 | Paper |
Playing with the Maximum-Flow Problem
EPiC Series in Computing | 2019-07-04 | Paper |
LTL with arithmetic and its applications in reasoning about hierarchical systems
EPiC Series in Computing | 2019-07-04 | Paper |
Alternating Reachability Games with Behavioral and Revenue Objectives
EPiC Series in Computing | 2019-07-04 | Paper |
| Reasoning about online algorithms with weighted automata | 2019-05-06 | Paper |
Spanning the spectrum from safety to liveness
Acta Informatica | 2018-12-12 | Paper |
An abstraction-refinement methodology for reasoning about network games
Games | 2018-12-10 | Paper |
Formally reasoning about quality
Journal of the ACM | 2018-08-02 | Paper |
Automata theory and model checking
Handbook of Model Checking | 2018-07-20 | Paper |
On relative and probabilistic finite counterability
Formal Methods in System Design | 2018-04-12 | Paper |
| On the Complexity of Universality for Partially Ordered NFAs | 2018-03-21 | Paper |
Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
(available as arXiv preprint) | 2018-03-21 | Paper |
Synthesis from component libraries with costs
Theoretical Computer Science | 2018-02-09 | 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 |
| A parametrized analysis of algorithms on hierarchical graphs | 2017-08-31 | Paper |
| On relative and probabilistic finite counterability | 2017-08-31 | Paper |
High-Quality Synthesis Against Stochastic Environments
(available as arXiv preprint) | 2017-07-19 | Paper |
| Congestion games with multisets of resources and applications in synthesis | 2017-07-13 | Paper |
| The sensing cost of monitoring and synthesis | 2017-07-13 | Paper |
From linear time to branching time
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
What causes a system to satisfy a specification?
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| Regular sensing | 2017-04-25 | Paper |
Network-formation games with regular objectives
Information and Computation | 2016-11-18 | Paper |
Dynamic resource allocation games
Algorithmic Game Theory | 2016-09-29 | Paper |
Synthesis with rational environments
Annals of Mathematics and Artificial Intelligence | 2016-09-16 | Paper |
On high-quality synthesis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
On the capacity of capacitated automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
| scientific article; zbMATH DE number 6527944 (Why is no real title available?) | 2016-01-08 | Paper |
Spanning the Spectrum from Safety to Liveness
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Alternating-time temporal logic
Journal of the ACM | 2015-12-07 | Paper |
Profile trees for Büchi word automata, with application to determinization
Information and Computation | 2015-12-07 | Paper |
Inherent vacuity in lattice automata
Fields of Logic and Computation II | 2015-09-22 | Paper |
