Pierre-Alain Reynier

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 52

Top Topics

Weighting Functions

Controller Synthesis

Top Venues

Log. Methods Comput. Sci.

Fundam. Informaticae

Publications

Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal controller synthesis for timed systems. Log. Methods Comput. Sci. 19 (1) (2023)
Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier
Register Minimization of Cost Register Automata over a Field. CoRR (2023)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CoRR (2022)
Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier
Computability of Data-Word Transductions over Different Data Domains. Log. Methods Comput. Sci. 18 (3) (2022)
Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier
A robust class of languages of 2-nested words. CoRR (2022)
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
Weighted Automata and Expressions over Pre-Rational Monoids. CSL (2022)
Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier
A Robust Class of Languages of 2-Nested Words. MFCS (2022)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CONCUR (2022)
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
Weighted Automata and Expressions over Pre-Rational Monoids. CoRR (2021)
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
Synthesis of Data Word Transducers. Log. Methods Comput. Sci. 17 (1) (2021)
Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Pierre-Alain Reynier
Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects Comput. 33 (1) (2021)
Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier
Computability of Data-Word Transductions over Different Data Domains. CoRR (2021)
Emmanuel Filiot, Pierre-Alain Reynier
Copyful Streaming String Transducers. Fundam. Informaticae 178 (1-2) (2021)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Playing Stochastically in Weighted Timed Games to Emulate Memory. ICALP (2021)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Playing Stochastically in Weighted Timed Games to Emulate Memory. CoRR (2021)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal controller synthesis for timed systems. CoRR (2021)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Reaching Your Goal Optimally by Playing at Random. CoRR (2020)
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
On Computability of Data Word Functions Defined by Transducers. CoRR (2020)
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
On Computability of Data Word Functions Defined by Transducers. FoSSaCS (2020)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Reaching Your Goal Optimally by Playing at Random with No Memory. CONCUR (2020)
Nicolas Baudru, Pierre-Alain Reynier
From Two-Way Transducers to Regular Function Expressions. Int. J. Found. Comput. Sci. 31 (6) (2020)
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
Synthesis of Data Word Transducers. CONCUR (2019)
Pierre-Alain Reynier, Didier Villevalois
Sequentiality of String-to-Context Transducers. ICALP (2019)
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
Streamability of nested word transductions. Log. Methods Comput. Sci. 15 (2) (2019)
Pierre-Alain Reynier, Didier Villevalois
Sequentiality of String-to-Context Transducers. CoRR (2019)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) (2019)
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
Synthesis of Data Word Transducers. CoRR (2019)
Pierre-Alain Reynier, Frédéric Servais
On the Computation of the Minimal Coverability Set of Petri Nets. RP (2019)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Symbolic Approximation of Weighted Timed Games. CoRR (2018)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Visibly pushdown transducers. J. Comput. Syst. Sci. 97 (2018)
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
Decision problems of tree transducers with origin. Inf. Comput. 261 (2018)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Symbolic Approximation of Weighted Timed Games. FSTTCS (2018)
Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Pierre-Alain Reynier
Optimal and Robust Controller Synthesis: using Energy Timed Automata with Uncertainty. CoRR (2018)
Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Pierre-Alain Reynier
Optimal and Robust Controller Synthesis - Using Energy Timed Automata with Uncertainty. FM (2018)
Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier
Aperiodic String Transducers. Int. J. Found. Comput. Sci. 29 (5) (2018)
Nicolas Baudru, Pierre-Alain Reynier
From Two-Way Transducers to Regular Function Expressions. DLT (2018)
Emmanuel Filiot, Pierre-Alain Reynier
Copyful Streaming String Transducers. RP (2017)
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
Streamability of nested word transductions. CoRR (2017)
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Degree of sequentiality of weighted automata. CoRR (2017)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal Reachability in Divergent Weighted Timed Games. CoRR (2017)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal Reachability in Divergent Weighted Timed Games. FoSSaCS (2017)
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Degree of Sequentiality of Weighted Automata. FoSSaCS (2017)
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
Two-Way Visibly Pushdown Automata and Transducers. LICS (2016)
S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier
Robustness of Time Petri Nets under Guard Enlargement. Fundam. Informaticae 143 (3-4) (2016)
Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Transducers with Well-Nested Outputs. Int. J. Found. Comput. Sci. 27 (2) (2016)
Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier
Aperiodic String Transducers. DLT (2016)
Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot
A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS (2016)
Emmanuel Filiot, Pierre-Alain Reynier
Transducers, logic and algebra for functions of finite words. ACM SIGLOG News 3 (3) (2016)
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
Two-Way Visibly Pushdown Automata and Transducers. CoRR (2016)
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Trimming visibly pushdown automata. Theor. Comput. Sci. 578 (2015)
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
Decision Problems of Tree Transducers with Origin. ICALP (2) (2015)
Luc Dartois, Pierre-Alain Reynier
Aperiodic Transducers. CoRR (2015)
Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur
Probabilistic Robust Timed Games. CONCUR (2014)
Emmanuel Filiot, Pierre-Alain Reynier
On Streaming String Transducers and HDT0L Systems. CoRR (2014)
Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Transducers with Well-Nested Outputs. Developments in Language Theory (2014)
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
From Two-Way to One-Way Finite State Transducers CoRR (2013)
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Trimming Visibly Pushdown Automata. CIAA (2013)
Omer Landry Nguena-Timo, Pierre-Alain Reynier
On characteristic formulae for Event-Recording Automata. RAIRO Theor. Informatics Appl. 47 (1) (2013)
Pierre-Alain Reynier, Frédéric Servais
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Fundam. Informaticae 122 (1-2) (2013)
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
From Two-Way to One-Way Finite State Transducers. LICS (2013)
Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Expressiveness of Visibly Pushdown Transducers. TTATT (2013)
Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
Robust Controller Synthesis in Timed Automata. CONCUR (2013)
Peter E. Bulychev, Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier
Controllers with Minimal Observation Power (Application to Timed Systems). ATVA (2012)
S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier
Robustness of Time Petri Nets under Guard Enlargement. RP (2012)
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. Developments in Language Theory (2012)
Peter E. Bulychev, Franck Cassez, Alexandre David, Kim G. Larsen, Jean-François Raskin, Pierre-Alain Reynier
Controllers with Minimal Observation Power (Application to Timed Systems) CoRR (2012)
Pierre-Alain Reynier, Frédéric Servais
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Petri Nets (2011)
Rémi Jaubert, Pierre-Alain Reynier
Quantitative Robustness Analysis of Flat Timed Automata. FoSSaCS (2011)
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
Streamability of Nested Word Transductions. FSTTCS (2011)
Janusz Malinowski, Peter Niebert, Pierre-Alain Reynier
A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. ATVA (2011)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Properties of Visibly Pushdown Transducers. MFCS (2010)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
On Functionality of Visibly Pushdown Transducers CoRR (2010)
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
Undecidability Results for Timed Automata with Silent Transitions. Fundam. Informaticae 92 (1-2) (2009)
Omer Landry Nguena-Timo, Pierre-Alain Reynier
On Characteristic Formulae for Event-Recording Automata. FICS (2009)
Franck Cassez, Jan Jakob Jessen, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier
Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study. HSCC (2009)
Pierre-Alain Reynier, Arnaud Sangnier
Weak Time Petri Nets Strike Back!. CONCUR (2009)
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
Timed Petri nets and timed automata: On the discriminating power of zeno sequences. Inf. Comput. 206 (1) (2008)
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
Robust Analysis of Timed Automata via Channel Machines. FoSSaCS (2008)
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
Robust Model-Checking of Linear-Time Properties in Timed Automata. LATIN (2006)
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. ICALP (2) (2006)
Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad
Extended Timed Automata and Time Petri Nets. ACSD (2006)
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
Timed Unfoldings for Networks of Timed Automata. ATVA (2006)
Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS (2005)