Patricia Bouyer-Decitre
Patricia Bouyer-Decitre (published as Patricia Bouyer, born 1976) is a French theoretical computer scientist known for her research on timed automata, model checking, and temporal logic.[1] She is a senior researcher for the French National Centre for Scientific Research (CNRS), and director of the Laboratoire Méthodes Formelles (Formal Methods Lab) of CNRS and the École normale supérieure Paris-Saclay.[2]
Education and career edit
Patricia Bouyer was born in 1976.[1] She became a student at ENS Paris-Saclay (known at that time as ENS Cachan) in 1996, earning a maîtrise (master's degree) in mathematics in 1997, a second maîtrise and diplôme d'études approfondies in computer science in 1998, and passing the agrégation in mathematics in 1999.[3]
She completed her Ph.D. in 2002 at the Laboratoire Spécification et Vérification of CNRS and ENS Cachan; her dissertation, Modèles et Algorithmes pour la Vérification des Systèmes Temporisés (Models and Algorithms for the Verification of Timed Systems), was supervised by Antoine Petit.[1][3][4] She completed a habilitation at Paris Diderot University in 2009, with the habilitation thesis From Qualitative to Quantitative Analysis of Timed Systems.[1]
She was a postdoctoral researcher at Aalborg University in 2002, and also in 2002 became a junior researcher for CNRS. She was promoted to senior researcher in 2010.[3]
Contributions edit
Bouyer is known for several significant results on timed automata. In work beginning in 1997, and culminating in a 2003 publication with Luca Aceto, Augusto Burgueno and Kim Larsen, Bouyer characterized the properties that can be described in terms of reachability in timed automata.[1][A] With Petit and Denis Thérien, she found analogues of Kleene's theorem for timed automata, showing their equivalence with certain classes of formal languages.[1][B] With Catherine Dufourd, Emmanuel Fleury and Antoine Petit, she introduced updatable timed automata, extensions of timed automata with operations that update the timing variables rather than merely resetting them to zero, and found several important subclasses of these automata for which the emptiness problem is decidable.[1][C]
In temporal logic, Bouyer worked with Fabrice Chevalier and Nicolas Markey to prove the greater expressiveness of one form of temporal logic, timed propositional temporal logic, over another, metric temporal logic.[1][G] Other topics in her research include the application of timed automata to fault detection,[E] the addition of costs and energy constraints to timed automata,[D][F] and the existence of Nash equilibria in timed versions of game theory.[H]
Recognition edit
Bouyer-Decitre won the CNRS Bronze Medal in 2007. She was the 2011 winner of the Presburger Award of the European Association for Theoretical Computer Science.[1]
Selected publications edit
| A. | Aceto, Luca; Bouyer, Patricia; Burgueño, Augusto; Larsen, Kim G. (2003), "The power of reachability testing for timed automata", Theoretical Computer Science, 300 (1–3): 411–475, doi:10.1016/S0304-3975(02)00334-1, MR 1976188 |
| B. | Bouyer, Patricia; Petit, Antoine; Thérien, Denis (2003), "An algebraic approach to data languages and timed languages", Information and Computation, 182 (2): 137–162, doi:10.1016/S0890-5401(03)00038-5, MR 1971488 |
| C. | Bouyer, Patricia; Dufourd, Catherine; Fleury, Emmanuel; Petit, Antoine (2004), "Updatable timed automata", Theoretical Computer Science, 321 (2–3): 291–345, doi:10.1016/j.tcs.2004.04.003, MR 2076150 |
| D. | Bouyer, Patricia; Cassez, Franck; Fleury, Emmanuel; Larsen, Kim G. (2004), "Optimal strategies in priced timed game automata", FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (PDF), Lecture Notes in Computer Science, vol. 3328, Springer, pp. 148–160, doi:10.1007/978-3-540-30538-5_13, ISBN 978-3-540-24058-7, MR 2140392, S2CID 3252817 |
| E. | Bouyer, Patricia; Chevalier, Fabrice; D'Souza, Deepak (2005), "Fault diagnosis using timed automata", Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science, vol. 3441, Springer, pp. 219–233, doi:10.1007/978-3-540-31982-5_14, ISBN 978-3-540-25388-4, MR 2179118 |
| F. | Bouyer, Patricia; Fahrenberg, Ulrich; Larsen, Kim Guldstrand; Markey, Nicolas; Srba, Jirí (2008), "Infinite Runs in Weighted Timed Automata with Energy Constraints", in Cassez, Franck; Jard, Claude (eds.), Formal Modeling and Analysis of Timed Systems, Lecture Notes in Computer Science, vol. 5215, Springer, pp. 33–47, doi:10.1007/978-3-540-85778-5_4, ISBN 978-3-540-85777-8, S2CID 3064045 |
| G. | Bouyer, Patricia; Chevalier, Fabrice; Markey, Nicolas (2010), "On the expressiveness of TPTL and MTL", Information and Computation, 208 (2): 97–116, doi:10.1016/j.ic.2009.10.004, MR 2597448 |
| H. | Bouyer, Patricia; Brenguier, Romain; Markey, Nicolas; Ummels, Michael (2015), "Pure Nash equilibria in concurrent deterministic games", Logical Methods in Computer Science, 11 (2): 2:9, arXiv:1503.06826, doi:10.2168/LMCS-11(2:9)2015, MR 3368955, S2CID 6948997 |
References edit
- ^ a b c d e f g h i Presburger Award 2011, European Association for Theoretical Computer Science, retrieved 2021-05-24
- ^ "Patricia Bouyer-Decitre", Laboratoire Spécification et Vérification, ENS Paris-Saclay, retrieved 2021-05-24
- ^ a b c Curriculum vitae (PDF), retrieved 2021-05-24
- ^ Patricia Bouyer-Decitre at the Mathematics Genealogy Project
External links edit
- Patricia Bouyer-Decitre publications indexed by Google Scholar