Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. - Patricia Bouyer; François Laroussinie; Pierre-Alain Reynier (FORMATS, 2005)

Extended Timed Automata and Time Petri Nets. - Patricia Bouyer; Pierre-Alain Reynier; Serge Haddad (ACSD, 2006)

Timed Unfoldings for Networks of Timed Automata. - Patricia Bouyer; Serge Haddad; Pierre-Alain Reynier (ATVA, 2006)

Robust Model-Checking of Linear-Time Properties in Timed Automata. - Patricia Bouyer; Nicolas Markey; Pierre-Alain Reynier (LATIN, 2006)

Robust Analysis of Timed Automata via Channel Machines. - Patricia Bouyer; Nicolas Markey; Pierre-Alain Reynier (FoSSaCS, 2008)

Timed Petri nets and timed automata: On the discriminating power of zeno sequences. - Patricia Bouyer; Serge Haddad; Pierre-Alain Reynier (Inf. Comput., 2008)

Weak Time Petri Nets Strike Back!. - Pierre-Alain Reynier; Arnaud Sangnier (CONCUR, 2009)

Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study. - Franck Cassez; Jan Jakob Jessen; Kim Guldstrand Larsen; Jean-François Raskin; Pierre-Alain Reynier (HSCC, 2009)

Undecidability Results for Timed Automata with Silent Transitions. - Patricia Bouyer; Serge Haddad; Pierre-Alain Reynier (Fundam. Informaticae, 2009)

Properties of Visibly Pushdown Transducers. - Emmanuel Filiot; Jean-François Raskin; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (MFCS, 2010)

On Functionality of Visibly Pushdown Transducers - Emmanuel Filiot; Jean-François Raskin; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (CoRR, 2010)

A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. - Janusz Malinowski; Peter Niebert; Pierre-Alain Reynier (ATVA, 2011)

Quantitative Robustness Analysis of Flat Timed Automata. - Rémi Jaubert; Pierre-Alain Reynier (FoSSaCS, 2011)

Controllers with Minimal Observation Power (Application to Timed Systems). - Peter E. Bulychev; Franck Cassez; Alexandre David; Kim Guldstrand Larsen; Jean-François Raskin; Pierre-Alain Reynier (ATVA, 2012)

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. - Mathieu Caralp; Pierre-Alain Reynier; Jean-Marc Talbot (Developments in Language Theory, 2012)

Robust Controller Synthesis in Timed Automata. - Ocan Sankur; Patricia Bouyer; Nicolas Markey; Pierre-Alain Reynier (CONCUR, 2013)

From Two-Way to One-Way Finite State Transducers. - Emmanuel Filiot; Olivier Gauwin; Pierre-Alain Reynier; Frédéric Servais (LICS, 2013)

Expressiveness of Visibly Pushdown Transducers. - Mathieu Caralp; Emmanuel Filiot; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (TTATT, 2013)

Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. - Pierre-Alain Reynier; Frédéric Servais (Fundam. Informaticae, 2013)

On characteristic formulae for Event-Recording Automata. - Omer Landry Nguena-Timo; Pierre-Alain Reynier (RAIRO Theor. Informatics Appl., 2013)

Probabilistic Robust Timed Games. - Youssouf Oualhadj; Pierre-Alain Reynier; Ocan Sankur (CONCUR, 2014)

On Streaming String Transducers and HDT0L Systems. - Emmanuel Filiot; Pierre-Alain Reynier (CoRR, 2014)

Aperiodic Transducers. - Luc Dartois; Pierre-Alain Reynier (CoRR, 2015)

Trimming visibly pushdown automata. - Mathieu Caralp; Pierre-Alain Reynier; Jean-Marc Talbot (Theor. Comput. Sci., 2015)

Two-Way Visibly Pushdown Automata and Transducers. - Luc Dartois; Emmanuel Filiot; Pierre-Alain Reynier; Jean-Marc Talbot (LICS, 2016)

A Generalised Twinning Property for Minimisation of Cost Register Automata. - Laure Daviaud; Pierre-Alain Reynier; Jean-Marc Talbot (LICS, 2016)

Robustness of Time Petri Nets under Guard Enlargement. - S. Akshay 001; Loïc Hélouët; Claude Jard; Pierre-Alain Reynier (Fundam. Informaticae, 2016)

Visibly Pushdown Transducers with Well-Nested Outputs. - Pierre-Alain Reynier; Jean-Marc Talbot (Int. J. Found. Comput. Sci., 2016)

Transducers, logic and algebra for functions of finite words. - Emmanuel Filiot; Pierre-Alain Reynier (ACM SIGLOG News, 2016)

Optimal Reachability in Divergent Weighted Timed Games. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier (FoSSaCS, 2017)

Degree of Sequentiality of Weighted Automata. - Laure Daviaud; Ismaël Jecker; Pierre-Alain Reynier; Didier Villevalois (FoSSaCS, 2017)

Symbolic Approximation of Weighted Timed Games. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier (FSTTCS, 2018)

Decision problems of tree transducers with origin. - Emmanuel Filiot; Sebastian Maneth; Pierre-Alain Reynier; Jean-Marc Talbot (Inf. Comput., 2018)

Aperiodic String Transducers. - Luc Dartois; Ismaël Jecker; Pierre-Alain Reynier (Int. J. Found. Comput. Sci., 2018)

Visibly pushdown transducers. - Emmanuel Filiot; Jean-François Raskin; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (J. Comput. Syst. Sci., 2018)

Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier; Ocan Sankur (CAV (1), 2019)

Sequentiality of String-to-Context Transducers. - Pierre-Alain Reynier; Didier Villevalois (ICALP, 2019)

On the Computation of the Minimal Coverability Set of Petri Nets. - Pierre-Alain Reynier; Frédéric Servais (RP, 2019)

Streamability of nested word transductions. - Emmanuel Filiot; Olivier Gauwin; Pierre-Alain Reynier; Frédéric Servais (Log. Methods Comput. Sci., 2019)

Reaching Your Goal Optimally by Playing at Random with No Memory. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (CONCUR, 2020)

On Computability of Data Word Functions Defined by Transducers. - Léo Exibard; Emmanuel Filiot; Pierre-Alain Reynier (FoSSaCS, 2020)

Reaching Your Goal Optimally by Playing at Random. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (CoRR, 2020)

From Two-Way Transducers to Regular Function Expressions. - Nicolas Baudru; Pierre-Alain Reynier (Int. J. Found. Comput. Sci., 2020)

Optimal and robust controller synthesis using energy timed automata with uncertainty. - Giovanni Bacci 001; Patricia Bouyer; Uli Fahrenberg; Kim G. Larsen; Nicolas Markey; Pierre-Alain Reynier (Formal Aspects Comput., 2021)

Copyful Streaming String Transducers. - Emmanuel Filiot; Pierre-Alain Reynier (Fundam. Informaticae, 2021)

Synthesis of Data Word Transducers. - Léo Exibard; Emmanuel Filiot; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2021)

Weighted Automata and Expressions over Pre-Rational Monoids. - Nicolas Baudru; Louis-Marie Dando; Nathan Lhote; Benjamin Monmege; Pierre-Alain Reynier; Jean-Marc Talbot (CSL, 2022)

A Robust Class of Languages of 2-Nested Words. - Séverine Fratani; Guillaume Maurras; Pierre-Alain Reynier (MFCS, 2022)

Computability of Data-Word Transductions over Different Data Domains. - Léo Exibard; Emmanuel Filiot; Nathan Lhote; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2022)

Register Minimization of Cost Register Automata over a Field. - Yahia Idriss Benalioua; Nathan Lhote; Pierre-Alain Reynier (CoRR, 2023)

Optimal controller synthesis for timed systems. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2023)

Minimizing Cost Register Automata over a Field. - Yahia Idriss Benalioua; Nathan Lhote; Pierre-Alain Reynier (MFCS, 2024)

Synthesis of Robust Optimal Real-Time Systems. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (MFCS, 2024)

Synthesis of Robust Optimal Strategies in Weighted Timed Games. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (CoRR, 2024)

Lexicographic Transductions of Finite Words. - Emmanuel Filiot; Nathan Lhote; Pierre-Alain Reynier (MFCS, 2025)

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2025)

Playing Stochastically in Weighted Timed Games to Emulate Memory. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2025)