Pierre-Alain Reynier
Laboratoire d'Informatique Fondamentale de Marseille

Je suis actuellement maître de conférences en informatique à l'Université d'Aix-Marseille.

J'effectue mon enseignement au sein du departement d'informatique et ma recherche au sein du LIF, où je fais partie de l'équipe MOVE.

Contact :

Laboratoire d’Informatique Fondamentale
Parc Scientifique de Luminy
163 avenue de Luminy - Case 901
F-13288 Marseille Cedex 9, France

Office : 612 (batiment TPR1, 6eme etage)
Phone : +33 (0)4 91 82 93 13
Fax : +33 (0)4 91 82 92 75

E-mail : pierre-alain.reynier[@]lif.univ-mrs.fr

• Accueil
• Enseignement
• Recherche
• Publications
• Divers

Chapitres de livres

• An Introduction to Automatic Synthesis of Discrete and Timed Controllers. Franck Cassez, Kim Larsen, Jean-François Raskin et Pierre-Alain Reynier.
  In Quantitative Model-Based Analysis of Real-Time Embedded Systems. Springer. 2012. To appear
  ISBN: 978-94-007-1368-0
  
  
• Timed Controller Synthesis: An Industrial Case Study. Franck Cassez, Kim Larsen, Jean-François Raskin et Pierre-Alain Reynier.
  In Quantitative Model-Based Analysis of Real-Time Embedded Systems. Springer. 2012. To appear
  ISBN: 978-94-007-1368-0
  
  
• Verification of Timed Systems. Pierre-Alain Reynier.
  In Models and Analysis in Distributed Systems, pages 271–306. Wiley. 2011.
  ISBN: 978-18-482-1314-2

Journaux

• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Pierre-Alain Reynier et Frédéric Servais.
  In Fundamenta Informaticae, volume 122 (1-2), pages 1–30. IOS Press. 2013.
  
  
  
• On Characteristic Formulae for Event-Recording Automata. Omer-Landry Nguena-Timo et Pierre-Alain Reynier.
  In RAIRO - Theoretical Informatics and Applications, volume 47 (1), pages 69–96. EDP Sciences. 2013.
  
  
  
• Undecidability Results for Timed Automata with Silent Transitions. Patricia Bouyer, Serge Haddad et Pierre-Alain Reynier.
  In Fundamenta Informaticae, volume 92 (1-2), pages 1–25. IOS Press. 2009.
  DOI: 10.3233/FI-2009-0063
  
  
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. Patricia Bouyer, Serge Haddad et Pierre-Alain Reynier.
  In Information and Computation, volume 206 (1), pages 73–107. Elsevier. 2008.
  DOI: 10.1016/j.ic.2007.10.004

Conférences internationales

• From Two-Way to One-Way Finite State Transducers. Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier et Frédéric Servais.
  In Proc. 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13). IEEE. 2013. To appear.
  
  
  
• Robustness of Time Petri Nets under Guard Enlargement. S. Akshay, Loic Hélouet, Claude Jard et Pierre-Alain Reynier.
  In Proc. 6th International Workshop on Reachability Problems (RP'12), pages 92–106, volume 7550 of Lecture Notes in Computer Science. Springer. 2012.
  DOI: 10.1007/978-3-642-33512-9_9
  
  
• Controllers with Minimal Observation Power (Application to Timed Systems). Peter Bulychev, Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Jean-Francois Raskin et Pierre-Alain Reynier.
  In Proc. 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), pages 223–237, volume 7561 of Lecture Notes in Computer Science. Springer. 2012.
  DOI: 10.1007/978-3-642-33386-6_19
  
  
• Visibly Pushdown Automata with multiplicities: Finiteness and K-Boundedness. Mathieu Caralp, Pierre-Alain Reynier et Jean-Marc Talbot.
  In Proc. 16th International Conference on Developments in Language Theory (DLT'12), pages 226–238, volume 7410 of Lecture Notes in Computer Science. Springer. 2012.
  DOI: 10.1007/978-3-642-31653-1_21
  
  
• Streamability of Nested Word Transductions. Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier et Frédéric Servais.
  In Proc. 31st Annual International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), pages 312–324, volume 13 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. 2011.
  DOI: 10.4230/LIPIcs.FSTTCS.2011.312
  
  
• A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. Janusz Malinowski, Peter Niebert et Pierre-Alain Reynier.
  In Proc. 9th International Symposium on Automated Technology for Verification and Analysis (ATVA'11), pages 198–212, volume 6996 of Lecture Notes in Computer Science. Springer. 2011.
  DOI: 10.1007/978-3-642-24372-1_15
  
  
• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Pierre-Alain Reynier et Frédéric Servais.
  In Proc. 32nd International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN'11), pages 69–88, volume 6709 of Lecture Notes in Computer Science. Springer. 2011.
  DOI: 10.1007/978-3-642-21834-7_5
  
  
• Quantitative Robustness Analysis of Flat Timed Automata. Rémi Jaubert et Pierre-Alain Reynier.
  In Proc. 14th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'11), pages 229–244, volume 6604 of Lecture Notes in Computer Science. Springer. 2011.
  DOI: 10.1007/978-3-642-19805-2_16
  
  
• Properties of Visibly Pushdown Transducers. Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier Reynier, Frédéric Servais et Jean-Marc Talbot.
  In Proc. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), pages 355–367, volume 6281 of Lecture Notes in Computer Science. Springer. 2010.
  DOI: 10.1007/978-3-642-15155-2_32
  
  
• Weak Time Petri Nets strike back!. Pierre-Alain Reynier et Arnaud Sangnier.
  In Proc. 20th International Conference on Concurrency Theory (CONCUR'09), pages 557–571, volume 5710 of Lecture Notes in Computer Science. Springer. 2009.
  DOI: 10.1007/978-3-642-04081-8_37
  
  
• Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study. Franck Cassez, Jan J. Jessen, Kim G. Larsen, Jean-François Raskin et Pierre-Alain Reynier.
  In Proc. 12th International Conference on Hybrid Systems: Computation and Control (HSCC'09), pages 90–104, volume 5469 of Lecture Notes in Computer Science. Springer. 2009.
  DOI: 10.1007/978-3-642-00602-9_7
  
  
• Robust Analysis of Timed Automata via Channel Machines. Patricia Bouyer, Nicolas Markey et Pierre-Alain Reynier.
  In Proc. 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), pages 157–171, volume 4962 of Lecture Notes in Computer Science. Springer. 2008.
  DOI: 10.1007/978-3-540-78499-9_12
  
  
• Timed Unfoldings for Networks of Timed Automata. Patricia Bouyer, Serge Haddad et Pierre-Alain Reynier.
  In Proc. 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), pages 292–306, volume 4218 of Lecture Notes in Computer Science. Springer. 2006.
  DOI: 10.1007/11901914_23
  
  
• Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. Patricia Bouyer, Serge Haddad et Pierre-Alain Reynier.
  In Proc. 33rd International Colloquium on Automata, Languages and Programming (ICALP'06), pages 420–431, volume 4052 of Lecture Notes in Computer Science. Springer. 2006.
  DOI: 10.1007/11787006_36
  
  
• Extended Timed Automata and Time Petri Nets. Patricia Bouyer, Serge Haddad et Pierre-Alain Reynier.
  In Proc. 6th International Conference on Application of Concurrency to System Design (ACSD'06), pages 91–100. IEEE Computer Society Press. 2006.
  DOI: 10.1109/ACSD.2006.6
  
  
• Robust Model-Checking of Linear-Time Properties in Timed Automata. Patricia Bouyer, Nicolas Markey et Pierre-Alain Reynier.
  In Proc. 7th Latin American Symposium on Theoretical Informatics (LATIN'06), pages 238–249, volume 3887 of Lecture Notes in Computer Science. Springer. 2006.
  DOI: 10.1007/11682462_25
  
  
• Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. Patricia Bouyer, François Laroussinie et Pierre-Alain Reynier.
  In Proc. 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05), pages 112–126, volume 3829 of Lecture Notes in Computer Science. Springer. 2005.
  DOI: 10.1007/11603009_10
  
  

Contributions invitées

• Implémentabilité des automates temporisés. Karine Altisen, Nicolas Markey, Pierre-Alain Reynier et Stavros Tripakis.
  In Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05), pages 395–406. Hermès. 2005. Invited paper
  
  

Conférences internationales sans actes

• On Characteristic Formulae for Event-Recording Automata. Omer-Landry Nguena-Timo et Pierre-Alain Reynier.
  In Proc. Workshop on Fixpoints In Computer Science (FICS'09), pages 70–78. 2009.
  
  
  
• Forward Analysis of Timed Automata. Pierre-Alain Reynier.
  In Proc. 5th Winter School on Modelling and Verifying Parallel Processes (MOVEP'04), pages 52–57. 2004.
  
  

Thèses

• Vérification de systèmes temporisés et distribués : modèles, algorithmes et implémentabilité. Pierre-Alain Reynier.
  Thèse de doctorat. Laboratoire Spécification et Vérification, ENS Cachan, France. 2007.
  
  
  
• Analyse en avant des automates temporisés. Pierre-Alain Reynier.
  Master Thesis. DEA Algorithmique, Paris. 2004.
  
  

Autres publications

• Diagonal constraints handled efficiently in UppAal. Pierre-Alain Reynier.
  Research Report. Numéro LSV-07-02. Laboratoire Spécification et Vérification, ENS Cachan, France. 2007.