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]
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]
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]
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]
| 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 |
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely. The theory is computably axiomatizable; the axioms include a schema of induction.
The École normale supérieure Paris-Saclay, formerly ENS Cachan, is a grande école and a constituent member of Paris-Saclay University. It was established in 1892. It is located in Gif-sur-Yvette within the Essonne department near Paris, Île-de-France, France.
Paris-Saclay University is a combined technological research institute and public research university in Paris, France. Paris-Saclay was established in 2019 after the merger of four technical grandes écoles, as well as several technological institutes, engineering schools, and research facilities; giving it fifteen constituent colleges with over 48,000 students combined.
The École normale supérieure de Rennes, also called ENS Rennes is a French scientific grande école, belonging to the network of écoles normales supérieures established according to the model of the École normale supérieure in Paris. Like its sister universities, its mandate lies in training students with a view to careers in academia, engineering and government.
Claire Mathieu is a French computer scientist and mathematician, known for her research on approximation algorithms, online algorithms, and auction theory. She works as a director of research at the Centre national de la recherche scientifique.
Mikołaj Bojańczyk is a Polish theoretical computer scientist and logician known for settling open problems on tree walking automata jointly with Thomas Colcombet, and for contributions to logic in automata theory. He is a professor at Warsaw University.
Jean-Éric Pin is a French mathematician and theoretical computer scientist known for his contributions to the algebraic automata theory and semigroup theory. He is a CNRS research director.
Joseph Zyss is a French physicist who specialises in molecular photonics and nonlinear optics. He is the author or co-author of more than 600 articles in the field.
Marie-Claude Gaudel is a French computer scientist. She is a professor emerita at the University of Paris-Sud. She helped develop PLUSS language for software specifications and was involved in both theoretical and applied computer science. Gaudel is still active in professional societies.
Mila Nikolova was a Bulgarian applied mathematician, known for her research in image processing, inverse problems, and compressed sensing.
Isabelle Ledoux-Rak is a French physicist and Professor at the École Normale Supérieure Paris-Saclay, where she is director of the Quantum and Molecular Photonics Laboratory and coordinator of the Erasmus Mundus Master's degree. Her research interests focus on the study of the non-linear optical properties of molecules and nanomaterials.
Martine-Michèle Sebag is a French computer scientist, primarily focused on machine learning. She has over 6,000 citations.
Mai Gehrke is a Danish mathematician who studies the theory of lattices and their applications to mathematical logic and theoretical computer science. She is a director of research for the French Centre national de la recherche scientifique (CNRS), affiliated with the Laboratoire J. A. Dieudonné (LJAD) at the University of Nice Sophia Antipolis.
Véronique Cortier is a French mathematician and computer scientist specializing in cryptography. Her research has applied mathematical logic in the formal verification of cryptographic protocols, and has included the development of secure electronic voting systems. She has also contributed to the public dissemination of knowledge about cryptography through a sequence of posts on the binaire blog of Le Monde. She is a director of research with CNRS, associated with the Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) at the University of Lorraine in Nancy.
The Paris-Saclay Faculty of Sciences or Orsay Faculty of Sciences, in French : Faculté des sciences d'Orsay, is the mathematics and physics school within Paris-Saclay University, founded in 1956. It offers undergraduate and graduate degrees in mathematics, physics and chemistry.
Anca Muscholl is a Romanian-German mathematical logician and theoretical computer scientist known for her work on formal verification, model checking, and two-variable logic. She is a researcher at the Laboratoire bordelais de recherche en informatique (LaBRI), a professor at the University of Bordeaux, and a former junior member of the Institut Universitaire de France.
Sylvie Boldo is a French mathematician and computer scientist. Her research combines automated theorem proving and computer arithmetic, focusing on the formal verification of floating-point arithmetic operations and of algorithms based on them. She is a director of research for the French Institute for Research in Computer Science and Automation (INRIA), affiliated with the Formal Methods Laboratory at Paris-Saclay University and the INRIA Saclay-Île-de-France Research Centre, where she co-leads the Toccata project for formally verified programs, certified tools and numerical computations. She is also the founding jury president for the French agrégation in computer science.
Véronique Bruyère is a Belgian computer scientist working in automata theory, temporal logic, and combinatorics on words, among other topics. She is a professor of computer science at the University of Mons in Belgium.
Principles of Model Checking is a textbook on model checking, an area of computer science that automates the problem of determining if a machine meets specification requirements. It was written by Christel Baier and Joost-Pieter Katoen, and published in 2008 by MIT Press.
The Institut de recherche en informatique fondamentale is a French research institute supporting advanced research in computer science. It is located in Paris. It is a public research institute in a partnership with the Université Paris Cité.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
