Area of research
Computational Theory and Mathematics · Artificial Intelligence
Research interest
Research focused on Automaton and Decidability, with related work in Outcome (game theory), Rational agent, Linear temporal logic. Notable publications include 'Synthesis with rational environments', 'Formally Reasoning About Quality', and 'Automata Theory and Model Checking'.
Games with Weighted Multiple Objectives
Easy Complementation of History-Deterministic Büchi Automata
Foundations of Software Science and Computation Structures
Reasoning about Quality and Fuzziness of Strategic Behaviors
Using the past for resolving the future
Minimization and Canonization of GFG Transition-Based Automata
The Complexity of LTL Rational Synthesis
Certifying DFA Bounds for Recognition and Separation
Certifying Inexpressibility
Certifying Inexpressibility
Certifying DFA Bounds for Recognition and Separation
What's decidable about weighted automata?
On Synthesis of Specifications with Arithmetic
On (I/O)-Aware Good-For-Games Automata
Reasoning about Quality and Fuzziness of Strategic Behaviours
Minimizing GFG Transition-Based Automata (Track B: Automata, Logic, Semantics, and Theory of Programming)
Register-Bounded Synthesis
Sensing as a Complexity Measure
Automata Theory and Model Checking
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
Quantitative Assume Guarantee Synthesis
Spanning the spectrum from safety to liveness
How Deterministic are Good-For-Games Automata?
On relative and probabilistic finite counterability
An Abstraction-Refinement Methodology for Reasoning about Network Games
Synthesis from component libraries with costs
Synthesis with rational environments
Formally Reasoning About Quality
On High-Quality Synthesis