H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 35 Citations 4,245 103 World Ranking 5877 National Ranking 141

Overview

What is she best known for?

The fields of study she is best known for:

  • Programming language
  • Algorithm
  • Algebra

Her main research concerns Automaton, Timed automaton, Algorithm, Theoretical computer science and Decidability. Her Automaton study combines topics from a wide range of disciplines, such as Finite-state machine and Reachability. Her studies in Timed automaton integrate themes in fields like Discrete mathematics and Theory of computation.

Her Algorithm study integrates concerns from other disciplines, such as Value, Reactive system, Semantics and Mathematical optimization. Her studies deal with areas such as State, Real-time computing, Range, Optimization problem and Data structure as well as Theoretical computer science. Her Undecidable problem study, which is part of a larger body of work in Decidability, is frequently linked to Abstract family of languages, Comparison of multi-paradigm programming languages and Ontology language, bridging the gap between disciplines.

Her most cited work include:

  • Infinite Runs in Weighted Timed Automata with Energy Constraints (176 citations)
  • Improved undecidability results on weighted timed automata (114 citations)
  • Lower and upper bounds in zone-based abstractions of timed automata (103 citations)

What are the main themes of her work throughout her whole career to date?

Patricia Bouyer mostly deals with Automaton, Theoretical computer science, Timed automaton, Decidability and Discrete mathematics. The various areas that she examines in her Automaton study include Algorithm, Model checking, Reachability and Petri net. Patricia Bouyer focuses mostly in the field of Theoretical computer science, narrowing it down to matters related to State and, in some cases, Protocol and Timed game automata.

Her biological study spans a wide range of topics, including Deterministic automaton, Semantics, Mobile automaton, Automata theory and ω-automaton. Patricia Bouyer interconnects Control theory and Hybrid system in the investigation of issues within Decidability. Her Discrete mathematics research is multidisciplinary, relying on both Nash equilibrium and Combinatorics.

She most often published in these fields:

  • Automaton (50.98%)
  • Theoretical computer science (43.14%)
  • Timed automaton (31.37%)

What were the highlights of her more recent work (between 2015-2021)?

  • Theoretical computer science (43.14%)
  • Reachability (22.06%)
  • Decidability (31.37%)

In recent papers she was focusing on the following fields of study:

Her scientific interests lie mostly in Theoretical computer science, Reachability, Decidability, Automaton and Discrete mathematics. Her work on Model checking as part of general Theoretical computer science study is frequently linked to Abstraction, bridging the gap between disciplines. The study incorporates disciplines such as Undirected graph, Undecidable problem and Constant in addition to Reachability.

Patricia Bouyer works mostly in the field of Decidability, limiting it down to topics relating to Mathematical optimization and, in certain cases, Theory of computation. In the field of Automaton, her study on Timed automaton overlaps with subjects such as Formalism. Her Discrete mathematics research includes themes of Reduction and Combinatorics.

Between 2015 and 2021, her most popular works were:

  • Average-energy games (22 citations)
  • Model Checking Real-Time Systems (17 citations)
  • Reachability in Networks of Register Protocols under Stochastic Schedulers (9 citations)

In her most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Algebra

Patricia Bouyer mainly investigates Theoretical computer science, Automaton, Decidability, Reachability and Mathematical optimization. Her Theoretical computer science study incorporates themes from Algorithm and Formal methods. Her work in the fields of Algorithm, such as Timed automaton, intersects with other areas such as Forward algorithm.

The Automaton study combines topics in areas such as Control theory and State. Patricia Bouyer studied Decidability and Countable set that intersect with Petri net. Patricia Bouyer usually deals with Reachability and limits it to topics linked to Undecidable problem and PSPACE, Multi-agent system and Game semantics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Infinite Runs in Weighted Timed Automata with Energy Constraints

Patricia Bouyer;Uli Fahrenberg;Kim G. Larsen;Nicolas Markey.
formal modeling and analysis of timed systems (2008)

203 Citations

Improved undecidability results on weighted timed automata

Patricia Bouyer;Thomas Brihaye;Nicolas Markey.
data and knowledge engineering (2006)

170 Citations

Lower and upper bounds in zone-based abstractions of timed automata

Gerd Behrmann;Patricia Bouyer;Kim G. Larsen;Radek Pelánek.
International Journal on Software Tools for Technology Transfer (2006)

170 Citations

Optimal strategies in priced timed game automata

Patricia Bouyer;Franck Cassez;Emmanuel Fleury;Kim G. Larsen.
Lecture Notes in Computer Science (2004)

147 Citations

Forward Analysis of Updatable Timed Automata

Patricia Bouyer.
formal methods (2004)

144 Citations

Updatable timed automata

Patricia Bouyer;Catherine Dufourd;Emmanuel Fleury;Antoine Petit.
Theoretical Computer Science (2004)

135 Citations

Fault diagnosis using timed automata

Patricia Bouyer;Fabrice Chevalier;Deepak D'Souza.
foundations of software science and computation structure (2005)

122 Citations

The power of reachability testing for timed automata

Luca Aceto;Patricia Bouyer;Augusto Burgueño;Kim G. Larsen.
Theoretical Computer Science (2003)

106 Citations

Timed Control with Partial Observability

Patricia Bouyer;Deepak D'souza;P. Madhusudan;Antoine Petit.
computer aided verification (2003)

104 Citations

Static guard analysis in timed automata verification

Gerd Behrmann;Patricia Bouyer;Emmanuel Fleury;Kim G. Larsen.
tools and algorithms for construction and analysis of systems (2003)

102 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Patricia Bouyer

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 82

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 45

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 40

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 36

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 29

James Worrell

James Worrell

University of Oxford

Publications: 22

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 21

Parosh Aziz Abdulla

Parosh Aziz Abdulla

Uppsala University

Publications: 19

Gethin Norman

Gethin Norman

University of Glasgow

Publications: 18

Joël Ouaknine

Joël Ouaknine

Max Planck Society

Publications: 15

Martin Leucker

Martin Leucker

University of Lübeck

Publications: 14

Sandeep Kulkarni

Sandeep Kulkarni

Michigan State University

Publications: 13

David Parker

David Parker

University of Birmingham

Publications: 13

Michael Wooldridge

Michael Wooldridge

University of Oxford

Publications: 11

Thomas Schwentick

Thomas Schwentick

TU Dortmund University

Publications: 11

André Platzer

André Platzer

Carnegie Mellon University

Publications: 10

Something went wrong. Please try again later.