Computing Maximally-Permissive Strategies in Acyclic Timed Automata. - Emily Clement; Thierry Jéron; Nicolas Markey; David Mentré (FORMATS, 2020)

Robustness of timed automata : computing the maximally-permissive strategies. (Robustesse des automates temporisés : calculer les stratégies les plus permissives). - Emily Clement (2022)

Layered Controller Synthesis for Dynamic Multi-agent Systems. - Emily Clement; Nicolas Perrin-Gilbert; Philipp Schlehuber-Caissier (FORMATS, 2023)

Presenting Interval Pomsets with Interfaces. - Amazigh Amrane; Hugo Bazille; Emily Clement; Uli Fahrenberg; Krzysztof Ziemianski (RAMiCS, 2024)

Languages of Higher-Dimensional Timed Automata. - Amazigh Amrane; Hugo Bazille; Emily Clement; Uli Fahrenberg (Petri Nets, 2024)

Expressivity of Linear Temporal Logic for Pomset Languages of Higher Dimensional Automata. - Emily Clement; Enzo Erlich; Jérémy Ledent (CoRR, 2024)

Büchi-Elgot-Trakhtenbrot Theorem for Higher-Dimensional Automata. - Amazigh Amrane; Hugo Bazille; Emily Clement; Uli Fahrenberg; Marie Fortin; Krzysztof Ziemianski (CoRR, 2025)