Partially Observable Concurrent Kleene Algebra [CONCUR 2020]
Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness [FOSSACS 2020]
A Categorical Framework for Learning Generalised Tree Automata [preprint]
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time [POPL 2020] ( Distinguished paper award)
Completeness and Incompleteness of Synchronous Kleene Algebra [MPC 2019]
Soft component automata: Composition, compilation, logic, and verification [J. Sci. Comp. Prog]
Kleene Algebra with Observations [CONCUR 2019]
Tree Automata as Algebras: Minimisation and Determinisation [CALCO 2019]
On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata [J. LAMP]
Decision problems for Clark-congruential languages [ICGI 2018] ( Best paper award)
Equivalence checking for weak bi-Kleene algebra [preprint]
Learning to coordinate [Farhad Arbab festschrift]
Concurrent Kleene algebra: free model and completeness [ESOP 2018]
A component-oriented framework for autonomous agents [FACS 2017]
Brzozowski goes concurrent: a Kleene theorem for pomset languages [CONCUR 2017]
Constraint automata with memory cells and their composition [J. Sci. Comp. Prog]
A compositional framework for preference-aware agents [V²CPS 2016]
Formal specification and analysis of robust adaptive distributed cyber-physical systems [SFM 2016]
Composing constraint automata, state-by-state [FACS 2015] ( Best paper award)