default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre-Alain Reynier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c45]Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier:
Minimizing Cost Register Automata over a Field. MFCS 2024: 23:1-23:15- [c44]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Synthesis of Robust Optimal Real-Time Systems. MFCS 2024: 74:1-74:15 - [i23]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Synthesis of Robust Optimal Strategies in Weighted Timed Games. CoRR abs/2403.06921 (2024) - 2023
- [j18]Damien Busatto-Gaston
, Benjamin Monmege, Pierre-Alain Reynier:
Optimal controller synthesis for timed systems. Log. Methods Comput. Sci. 19(1) (2023) - [i22]Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier:
Register Minimization of Cost Register Automata over a Field. CoRR abs/2307.13505 (2023) - 2022
- [j17]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) - [c43]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CONCUR 2022: 15:1-15:22 - [c42]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: 6:1-6:16 - [c41]Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier:
A Robust Class of Languages of 2-Nested Words. MFCS 2022: 50:1-50:15 - [i21]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CoRR abs/2207.01608 (2022) - [i20]Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier:
A robust class of languages of 2-nested words. CoRR abs/2208.10347 (2022) - 2021
- [j16]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): 3-25 (2021) - [j15]Emmanuel Filiot, Pierre-Alain Reynier:
Copyful Streaming String Transducers. Fundam. Informaticae 178(1-2): 59-76 (2021) - [j14]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. Log. Methods Comput. Sci. 17(1) (2021) - [c40]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Playing Stochastically in Weighted Timed Games to Emulate Memory. ICALP 2021: 137:1-137:17 - [i19]Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier:
Computability of Data-Word Transductions over Different Data Domains. CoRR abs/2101.07038 (2021) - [i18]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal controller synthesis for timed systems. CoRR abs/2104.12577 (2021) - [i17]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Playing Stochastically in Weighted Timed Games to Emulate Memory. CoRR abs/2105.00984 (2021) - [i16]Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot:
Weighted Automata and Expressions over Pre-Rational Monoids. CoRR abs/2110.12395 (2021) - 2020
- [j13]Nicolas Baudru, Pierre-Alain Reynier:
From Two-Way Transducers to Regular Function Expressions. Int. J. Found. Comput. Sci. 31(6): 843-873 (2020) - [c39]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Reaching Your Goal Optimally by Playing at Random with No Memory. CONCUR 2020: 26:1-26:21 - [c38]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
On Computability of Data Word Functions Defined by Transducers. FoSSaCS 2020: 217-236 - [i15]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
On Computability of Data Word Functions Defined by Transducers. CoRR abs/2002.08203 (2020) - [i14]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Reaching Your Goal Optimally by Playing at Random. CoRR abs/2005.04985 (2020)
2010 – 2019
- 2019
- [j12]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. Log. Methods Comput. Sci. 15(2) (2019) - [c37]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur:
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) 2019: 572-590 - [c36]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. CONCUR 2019: 24:1-24:15 - [c35]Pierre-Alain Reynier, Didier Villevalois:
Sequentiality of String-to-Context Transducers. ICALP 2019: 128:1-128:14 - [c34]Pierre-Alain Reynier, Frédéric Servais:
On the Computation of the Minimal Coverability Set of Petri Nets. RP 2019: 164-177 - [i13]Pierre-Alain Reynier, Didier Villevalois:
Sequentiality of String-to-Context Transducers. CoRR abs/1902.11263 (2019) - [i12]Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. CoRR abs/1905.03538 (2019) - 2018
- [j11]Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision problems of tree transducers with origin. Inf. Comput. 261: 311-335 (2018) - [j10]Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier:
Aperiodic String Transducers. Int. J. Found. Comput. Sci. 29(5): 801-824 (2018) - [j9]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Visibly pushdown transducers. J. Comput. Syst. Sci. 97: 147-181 (2018) - [c33]Nicolas Baudru, Pierre-Alain Reynier:
From Two-Way Transducers to Regular Function Expressions. DLT 2018: 96-108 - [c32]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: 203-221 - [c31]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Symbolic Approximation of Weighted Timed Games. FSTTCS 2018: 28:1-28:16 - [e1]Igor Potapov, Pierre-Alain Reynier:
Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings. Lecture Notes in Computer Science 11123, Springer 2018, ISBN 978-3-030-00249-7 [contents] - [i11]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 abs/1805.00847 (2018) - [i10]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Symbolic Approximation of Weighted Timed Games. CoRR abs/1812.01062 (2018) - 2017
- [c30]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal Reachability in Divergent Weighted Timed Games. FoSSaCS 2017: 162-178 - [c29]Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of Sequentiality of Weighted Automata. FoSSaCS 2017: 215-230 - [c28]Emmanuel Filiot, Pierre-Alain Reynier:
Copyful Streaming String Transducers. RP 2017: 75-86 - [i9]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal Reachability in Divergent Weighted Timed Games. CoRR abs/1701.03716 (2017) - [i8]Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of sequentiality of weighted automata. CoRR abs/1701.04632 (2017) - [i7]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. CoRR abs/1707.00527 (2017) - 2016
- [j8]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): 207-234 (2016) - [j7]Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Transducers with Well-Nested Outputs. Int. J. Found. Comput. Sci. 27(2): 235-258 (2016) - [j6]Emmanuel Filiot, Pierre-Alain Reynier:
Transducers, logic and algebra for functions of finite words. ACM SIGLOG News 3(3): 4-19 (2016) - [c27]Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier:
Aperiodic String Transducers. DLT 2016: 125-137 - [c26]Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot:
Two-Way Visibly Pushdown Automata and Transducers. LICS 2016: 217-226 - [c25]Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot:
A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS 2016: 857-866 - [i6]Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot:
Two-Way Visibly Pushdown Automata and Transducers. CoRR abs/1606.00234 (2016) - 2015
- [j5]Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming visibly pushdown automata. Theor. Comput. Sci. 578: 13-29 (2015) - [c24]Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision Problems of Tree Transducers with Origin. ICALP (2) 2015: 209-221 - [i5]Luc Dartois, Pierre-Alain Reynier:
Aperiodic Transducers. CoRR abs/1506.04059 (2015) - 2014
- [c23]Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur:
Probabilistic Robust Timed Games. CONCUR 2014: 203-217 - [c22]Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Transducers with Well-Nested Outputs. Developments in Language Theory 2014: 129-141 - [i4]Emmanuel Filiot, Pierre-Alain Reynier:
On Streaming String Transducers and HDT0L Systems. CoRR abs/1412.0537 (2014) - 2013
- [j4]Pierre-Alain Reynier, Frédéric Servais:
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Fundam. Informaticae 122(1-2): 1-30 (2013) - [j3]Omer Landry Nguena-Timo, Pierre-Alain Reynier:
On characteristic formulae for Event-Recording Automata. RAIRO Theor. Informatics Appl. 47(1): 69-96 (2013) - [c21]Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Controller Synthesis in Timed Automata. CONCUR 2013: 546-560 - [c20]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. LICS 2013: 468-477 - [c19]Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming Visibly Pushdown Automata. CIAA 2013: 84-96 - [c18]Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Expressiveness of Visibly Pushdown Transducers. TTATT 2013: 17-26 - [i3]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. CoRR abs/1301.5197 (2013) - 2012
- [c17]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: 223-237 - [c16]Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. Developments in Language Theory 2012: 226-238 - [c15]S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier:
Robustness of Time Petri Nets under Guard Enlargement. RP 2012: 92-106 - [i2]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 abs/1207.1276 (2012) - 2011
- [c14]Pierre-Alain Reynier, Frédéric Servais:
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Petri Nets 2011: 69-88 - [c13]Janusz Malinowski, Peter Niebert, Pierre-Alain Reynier:
A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. ATVA 2011: 198-212 - [c12]Rémi Jaubert, Pierre-Alain Reynier:
Quantitative Robustness Analysis of Flat Timed Automata. FoSSaCS 2011: 229-244 - [c11]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of Nested Word Transductions. FSTTCS 2011: 312-324 - 2010
- [c10]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Properties of Visibly Pushdown Transducers. MFCS 2010: 355-367 - [i1]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
On Functionality of Visibly Pushdown Transducers. CoRR abs/1002.1443 (2010)
2000 – 2009
- 2009
- [j2]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Undecidability Results for Timed Automata with Silent Transitions. Fundam. Informaticae 92(1-2): 1-25 (2009) - [c9]Pierre-Alain Reynier, Arnaud Sangnier:
Weak Time Petri Nets Strike Back!. CONCUR 2009: 557-571 - [c8]Omer Landry Nguena-Timo, Pierre-Alain Reynier:
On Characteristic Formulae for Event-Recording Automata. FICS 2009: 70-78 - [c7]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: 90-104 - 2008
- [j1]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Petri nets and timed automata: On the discriminating power of zeno sequences. Inf. Comput. 206(1): 73-107 (2008) - [c6]Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Analysis of Timed Automata via Channel Machines. FoSSaCS 2008: 157-171 - 2006
- [c5]Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad:
Extended Timed Automata and Time Petri Nets. ACSD 2006: 91-100 - [c4]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Unfoldings for Networks of Timed Automata. ATVA 2006: 292-306 - [c3]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. ICALP (2) 2006: 420-431 - [c2]Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Model-Checking of Linear-Time Properties in Timed Automata. LATIN 2006: 238-249 - 2005
- [c1]Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier:
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS 2005: 112-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
