Follow
Béatrice Bérard
Béatrice Bérard
professeur émérite d'informatique, Sorbonne Université
Verified email at lip6.fr
Title
Cited by
Cited by
Year
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
12342013
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
2371998
Vérification de logiciels: techniques et outils du model-checking
B Berard, M Bidoit, F Laroussinie
Vuibert, 1999
1511999
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
1332005
Comparison of different semantics for time Petri nets
B Bérard, F Cassez, S Haddad, D Lime, OH Roux
Automated Technology for Verification and Analysis: Third International …, 2005
1132005
Quantifying opacity
B Bérard, J Mullins, M Sassolas
Mathematical Structures in Computer Science 25 (2), 361-403, 2015
942015
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
862010
Reachability analysis of (timed) Petri nets using real arithmetic
B Bérard, L Fribourg
International Conference on Concurrency Theory, 178-193, 1999
661999
Probabilistic opacity for Markov decision processes
B Bérard, K Chatterjee, N Sznajder
Information Processing Letters 115 (1), 52-59, 2015
602015
Timed automata and additive clock constraints
B Bérard, C Dufourd
Information Processing Letters 75 (1-2), 1-7, 2000
592000
Automated verification of a parametric real-time program: the ABR conformance protocol
B Béerard, L Fribourg
Computer Aided Verification: 11th International Conference, CAV’99 Trento …, 1999
561999
On the power of non-observable actions in timed automata
B Bérard, P Gastin, A Petit
STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science …, 1996
561996
The expressive power of time Petri nets
B Berard, F Cassez, S Haddad, D Lime, OH Roux
Theoretical Computer Science 474, 1-20, 2013
492013
Formal verification of mobile robot protocols
B Bérard, P Lafourcade, L Millet, M Potop-Butucaru, Y Thierry-Mieg, ...
Distributed Computing 29, 459-487, 2016
412016
Analysing the PGM protocol with UPPAAL
B Bérard*, P Bouyer, A Petit
International journal of production research 42 (14), 2773-2791, 2004
312004
Interrupt timed automata: verification and expressiveness
B Bérard, S Haddad, M Sassolas
Formal Methods in System Design 40, 41-87, 2012
282012
An introduction to timed automata
B Bérard
Control of Discrete-Event Systems: Automata and Petri Net Perspectives, 169-187, 2013
272013
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
272005
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
262008
Systèmes d'exploitation: concepts et algorithmes
J Beauquier, B Bérard
McGraw-Hill, 1990
251990
The system can't perform the operation now. Try again later.
Articles 1–20