| Systems and software verification: model-checking techniques and tools B Bérard, M Bidoit, A Finkel, F Laroussinie, A Petit, L Petrucci, ... Springer Science & Business Media, 2013 | 1146 | 2013 |
| Characterization of the expressive power of silent transitions in timed automata B Bérard, A Petit, V Diekert, P Gastin Fundamenta Informaticae 36 (2, 3), 145-182, 1998 | 229 | 1998 |
| Vérification de logiciels B Berard, M Bidoit, F Laroussinie, G Cécé, C Dufourd, P Schnoebelen Vuibert, 1999 | 147 | 1999 |
| Comparison of the expressiveness of timed automata and time Petri nets B Bérard, F Cassez, S Haddad, D Lime, OH Roux International conference on formal modeling and analysis of timed systems …, 2005 | 128 | 2005 |
| Comparison of different semantics for time Petri nets B Bérard, F Cassez, S Haddad, D Lime, OH Roux International Symposium on Automated Technology for Verification and …, 2005 | 96 | 2005 |
| Quantifying opacity B Bérard, J Mullins, M Sassolas Mathematical Structures in Computer Science 25 (2), 361-403, 2015 | 83 | 2015 |
| Verification of a timed multitask system with UPPAAL HB Mokadem, B Berard, V Gourcuff, O De Smet, JM Roussel IEEE Transactions on Automation Science and Engineering 7 (4), 921-932, 2010 | 82 | 2010 |
| Reachability analysis of (timed) Petri nets using real arithmetic B Bérard, L Fribourg International Conference on Concurrency Theory, 178-193, 1999 | 63 | 1999 |
| On the power of non-observable actions in timed automata B Bérard, P Gastin, A Petit Annual Symposium on Theoretical Aspects of Computer Science, 255-268, 1996 | 56 | 1996 |
| Timed automata and additive clock constraints B Bérard, C Dufourd Information Processing Letters 75 (1-2), 1-7, 2000 | 54 | 2000 |
| Automated verification of a parametric real-time program: the ABR conformance protocol B Béerard, L Fribourg International Conference on Computer Aided Verification, 96-107, 1999 | 53 | 1999 |
| Probabilistic opacity for Markov decision processes B Bérard, K Chatterjee, N Sznajder Information Processing Letters 115 (1), 52-59, 2015 | 48 | 2015 |
| The expressive power of time Petri nets B Berard, F Cassez, S Haddad, D Lime, OH Roux Theoretical Computer Science 474, 1-20, 2013 | 43 | 2013 |
| Formal verification of mobile robot protocols B Bérard, P Lafourcade, L Millet, M Potop-Butucaru, Y Thierry-Mieg, ... Distributed Computing 29 (6), 459-487, 2016 | 38 | 2016 |
| Analysing the PGM protocol with UPPAAL B Bérard*, P Bouyer, A Petit International journal of production research 42 (14), 2773-2791, 2004 | 32 | 2004 |
| Schnoebelen Ph. McKenzie P. Systems and Software verification: model checking techniques and tools B Bérard, M Bidoit, A Finkel, F Laroussinie, A Petit, L Petrucci Springer, 2001 | 31 | 2001 |
| Interrupt timed automata: verification and expressiveness B Bérard, S Haddad, M Sassolas Formal Methods in System Design 40 (1), 41-87, 2012 | 27 | 2012 |
| When are timed automata weakly timed bisimilar to time Petri nets? B Bérard, F Cassez, S Haddad, D Lime, OH Roux International Conference on Foundations of Software Technology and …, 2005 | 27 | 2005 |
| When are timed automata weakly timed bisimilar to time Petri nets? B Bérard, F Cassez, S Haddad, D Lime, OH Roux Theoretical Computer Science 403 (2-3), 202-220, 2008 | 25 | 2008 |
| An introduction to timed automata B Bérard Control of discrete-event systems, 169-187, 2013 | 24 | 2013 |
