Béatrice Bérard

1.9k total citations
31 papers, 760 citations indexed

About

Béatrice Bérard is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Béatrice Bérard has authored 31 papers receiving a total of 760 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 15 papers in Artificial Intelligence and 10 papers in Software. Recurrent topics in Béatrice Bérard's work include Formal Methods in Verification (21 papers), Petri Nets in System Modeling (11 papers) and Logic, programming, and type systems (9 papers). Béatrice Bérard is often cited by papers focused on Formal Methods in Verification (21 papers), Petri Nets in System Modeling (11 papers) and Logic, programming, and type systems (9 papers). Béatrice Bérard collaborates with scholars based in France, Canada and Algeria. Béatrice Bérard's co-authors include Antoine Petit, Michel Bidoit, François Laroussinie, Laure Petrucci, Alain Finkel, Ph. Schnoebelen, Philippe Schnoebelen, Pierre McKenzie, Alain Finkel and Volker Diekert and has published in prestigious journals such as International Journal of Production Research, Theoretical Computer Science and IEEE Transactions on Automation Science and Engineering.

In The Last Decade

Béatrice Bérard

28 papers receiving 691 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Béatrice Bérard France 11 521 256 246 172 153 31 760
François Laroussinie France 11 482 0.9× 326 1.3× 260 1.1× 115 0.7× 104 0.7× 27 701
Ph. Schnoebelen France 12 668 1.3× 392 1.5× 286 1.2× 150 0.9× 98 0.6× 26 877
Laure Petrucci France 7 364 0.7× 179 0.7× 191 0.8× 130 0.8× 109 0.7× 38 569
Jonathan S. Ostroff Canada 14 651 1.2× 268 1.0× 286 1.2× 154 0.9× 291 1.9× 44 892
Ursula Goltz Germany 15 364 0.7× 387 1.5× 216 0.9× 178 1.0× 75 0.5× 60 727
Michel Bidoit France 13 535 1.0× 495 1.9× 280 1.1× 141 0.8× 106 0.7× 37 855
Angelo Morzenti Italy 16 691 1.3× 451 1.8× 500 2.0× 128 0.7× 242 1.6× 69 1.0k
Mark Trakhtenbrot Israel 5 340 0.7× 282 1.1× 340 1.4× 92 0.5× 232 1.5× 17 775
Thierry Jéron France 12 399 0.8× 176 0.7× 438 1.8× 140 0.8× 71 0.5× 35 703
Serge Haddad France 14 493 0.9× 197 0.8× 137 0.6× 193 1.1× 97 0.6× 82 740

Countries citing papers authored by Béatrice Bérard

Since Specialization
Citations

This map shows the geographic impact of Béatrice Bérard's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Béatrice Bérard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Béatrice Bérard more than expected).

Fields of papers citing papers by Béatrice Bérard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Béatrice Bérard. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Béatrice Bérard. The network helps show where Béatrice Bérard may publish in the future.

Co-authorship network of co-authors of Béatrice Bérard

This figure shows the co-authorship network connecting the top 25 collaborators of Béatrice Bérard. A scholar is included among the top collaborators of Béatrice Bérard based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Béatrice Bérard. Béatrice Bérard is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bérard, Béatrice, et al.. (2020). Polynomial interrupt timed automata: Verification and expressiveness. Information and Computation. 277. 104580–104580.
2.
Bérard, Béatrice, Stefan Haar, Sylvain Schmitz, & Stefan Schwoon. (2018). The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae. 161(4). 317–349. 13 indexed citations
3.
Bérard, Béatrice, Loı̈c Hélouët, & John Mullins. (2016). Non-interference in Partial Order Models. ACM Transactions on Embedded Computing Systems. 16(2). 1–34. 1 indexed citations
4.
Bérard, Béatrice, et al.. (2016). Formal verification of mobile robot protocols. Distributed Computing. 29(6). 459–487. 9 indexed citations
5.
Bérard, Béatrice, et al.. (2014). Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1). 52–59. 32 indexed citations
6.
Bérard, Béatrice, et al.. (2012). Interrupt Timed Automata: verification and expressiveness. Formal Methods in System Design. 40(1). 41–87. 15 indexed citations
7.
Bérard, Béatrice, Franck Cassez, Serge Haddad, Didier Lime, & Olivier Roux. (2012). The expressive power of time Petri nets. Theoretical Computer Science. 474. 1–20. 16 indexed citations
8.
Zhang, Yingying, Béatrice Bérard, Fabrice Kordon, & Yann Thierry-Mieg. (2010). Automated Controllability and Synthesis with Hierarchical Set Decision Diagrams. IFAC Proceedings Volumes. 43(12). 281–286. 1 indexed citations
9.
Bérard, Béatrice, Paul Gastin, & Antoine Petit. (2007). Timed substitutions for regular signal-event languages. Formal Methods in System Design. 31(2). 101–134.
10.
Bérard, Béatrice, et al.. (2006). Verification of a timed multitask system with UPPAAL. Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine). 2. 347–354. 35 indexed citations
11.
Gaïd, Mohamed El Mongi Ben, Béatrice Bérard, & Olivier de Smet. (2005). Verification of an evaporator system with UPPAAL. Journal Européen des Systèmes Automatisés. 39(9-10). 1079–1098. 6 indexed citations
12.
Bérard, Béatrice, Patricia Bouyer, & Antoine Petit. (2004). Analysing the PGM protocol with UPPAAL. International Journal of Production Research. 42(14). 2773–2791. 8 indexed citations
13.
Bérard, Béatrice, Michel Bidoit, Alain Finkel, et al.. (2001). Systems and Software Verification. 156 indexed citations
14.
Bérard, Béatrice, et al.. (2001). Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. Distributed Computing. 14(2). 83–95. 1 indexed citations
15.
Bérard, Béatrice, et al.. (2000). Accepting Zeno words: a way toward timed refinements. Acta Informatica. 37(1). 45–81. 5 indexed citations
16.
Bérard, Béatrice & Catherine Dufourd. (2000). Timed automata and additive clock constraints. Information Processing Letters. 75(1-2). 1–7. 23 indexed citations
17.
Beauquier, Joffroy, Béatrice Bérard, & Laurent Fribourg. (1999). A New Rewrite Method for Convergence of Self-Stabilizing Systems. 240–253. 2 indexed citations
18.
Bérard, Béatrice, Antoine Petit, Volker Diekert, & Paul Gastin. (1998). Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae. 36(2-3). 145–182. 62 indexed citations
19.
Bérard, Béatrice. (1994). Global serializability of concurrent programs. Theoretical Computer Science. 124(1). 41–70. 1 indexed citations
20.
Bérard, Béatrice. (1987). Formal properties of literal shuffle. Acta Cybernetica. 8(1). 27–39. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026