On the Equivalence of Synchronization Sets. - Joffroy Beauquier; Béatrice Bérard (CAAP, 1986)

Formal properties of literal shuffle. - Béatrice Bérard (Acta Cybern., 1987)

Literal Shuffle. - Béatrice Bérard (Theor. Comput. Sci., 1987)

Global Serializability of Concurrent Programs. - Béatrice Bérard (Theor. Comput. Sci., 1994)

Untiming Timed Languages. - Béatrice Bérard (Inf. Process. Lett., 1995)

On the Power of Non-Observable Actions in Timed Automata. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (STACS, 1996)

Accepting Zeno Words Without Making Time Stand Still. - Béatrice Bérard; Claudine Picaronny (MFCS, 1997)

Characterization of the Expressive Power of Silent Transitions in Timed Automata. - Béatrice Bérard; Antoine Petit 001; Volker Diekert; Paul Gastin (Fundam. Informaticae, 1998)

Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. - Béatrice Bérard; Laurent Fribourg (CAV, 1999)

Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. - Béatrice Bérard; Laurent Fribourg (CONCUR, 1999)

A New Rewrite Method for Convergence of Self-Stabilizing Systems. - Joffroy Beauquier; Béatrice Bérard; Laurent Fribourg (DISC, 1999)

Verifying Performance Equivalence for Timed Basic Parallel Processes. - Béatrice Bérard; Anne Labroue; Philippe Schnoebelen (FoSSaCS, 2000)

Accepting Zeno words: a way toward timed refinements. - Béatrice Bérard; Claudine Picaronny (Acta Informatica, 2000)

Timed automata and additive clock constraints. - Béatrice Bérard; Catherine Dufourd (Inf. Process. Lett., 2000)

Systems and Software Verification, Model-Checking Techniques and Tools. - Béatrice Bérard; Michel Bidoit; Alain Finkel; François Laroussinie; Antoine Petit 001; Laure Petrucci; Philippe Schnoebelen; Pierre McKenzie (Springer, 2001)

Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. - Joffroy Beauquier; Béatrice Bérard; Laurent Fribourg; Frédéric Magniette (Distributed Comput., 2001)

Compared Study of Two Correctness Proofs for the Standardized. - Béatrice Bérard; Laurent Fribourg; Francis Klay; Jean-François Monin (Formal Methods Syst. Des., 2003)

Comparison of Different Semantics for Time Petri Nets. - Béatrice Bérard; Franck Cassez; Serge Haddad; Didier Lime; Olivier H. Roux (ATVA, 2005)

A New Modality for Almost Everywhere Properties in Timed Automata. - Houda Bel Mokadem; Béatrice Bérard; Patricia Bouyer; François Laroussinie (CONCUR, 2005)

Comparison of the Expressiveness of Timed Automata and Time Petri Nets. - Béatrice Bérard; Franck Cassez; Serge Haddad; Didier Lime; Olivier H. Roux (FORMATS, 2005)

Timed Temporal Logics for Abstracting Transient States. - Houda Bel Mokadem; Béatrice Bérard; Patricia Bouyer; François Laroussinie (ATVA, 2006)

Intersection of Regular Signal-Event (Timed) Languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (FORMATS, 2006)

Refinements and Abstractions of Signal-Event (Timed) Languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (FORMATS, 2006)

Timed substitutions for regular signal-event languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (Formal Methods Syst. Des., 2007)

When are Timed Automata weakly timed bisimilar to Time Petri Nets? - Béatrice Bérard; Franck Cassez; Serge Haddad; Didier Lime; Olivier H. Roux (Theor. Comput. Sci., 2008)

Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad (FoSSaCS, 2009)

Real Time Properties for Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Mathieu Sassolas (TIME, 2010)

Automated controllability and synthesis with hierarchical set decision diagrams. - Yan Zhang 017; Béatrice Bérard; Fabrice Kordon; Yann Thierry-Mieg (WODES, 2010)

Verification of a Timed Multitask System With Uppaal. - Houda Bel Mokadem; Béatrice Bérard; V. Gourcuff; O. De Smet; J. Roussel (IEEE Trans Autom. Sci. Eng., 2010)

Concurrent Games on VASS with Inhibition. - Béatrice Bérard; Serge Haddad; Mathieu Sassolas; Nathalie Sznajder (CONCUR, 2012)

Interrupt Timed Automata: verification and expressiveness. - Béatrice Bérard; Serge Haddad; Mathieu Sassolas (Formal Methods Syst. Des., 2012)

Channel Synthesis for Finite Transducers. - Gilles Benattar; Béatrice Bérard; Didier Lime; John Mullins; Olivier H. Roux; Mathieu Sassolas (Int. J. Found. Comput. Sci., 2012)

An Introduction to Timed Automata. - Béatrice Bérard (Control of Discrete-Event Systems, 2013)

Petri Nets with Time. - Béatrice Bérard; Maria Paola Cabasino; Angela Di Febbraro; Alessandro Giua; Carla Seatzu (Control of Discrete-Event Systems, 2013)

Timed Model-Checking. - Béatrice Bérard (Communicating Embedded Systems, 2013)

Semi-automatic controller design of Java-like models. - Yan Zhang 017; Béatrice Bérard; Lom-Messan Hillah; Yann Thierry-Mieg (FTfJP@ECOOP, 2013)

Parametric Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Aleksandra Jovanovic 002; Didier Lime (RP, 2013)

The expressive power of time Petri nets. - Béatrice Bérard; Franck Cassez; Serge Haddad; Didier Lime; Olivier H. Roux (Theor. Comput. Sci., 2013)

Channel Synthesis Revisited. - Béatrice Bérard; Olivier Carton (LATA, 2014)

Verification of Information Flow Properties under Rational Observation. - Béatrice Bérard; John Mullins (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014)

Controllability for discrete event systems modelled in VeriJ. - Yan Zhang 017; Béatrice Bérard; Lom-Messan Hillah; Fabrice Kordon; Yann Thierry-Mieg (Int. J. Crit. Comput. Based Syst., 2014)

Polynomial Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (RP, 2015)

Probabilistic Opacity in Refinement-Based Modeling. - Béatrice Bérard; Olga Kouchnarenko; John Mullins; Mathieu Sassolas (CoRR, 2015)

Probabilistic opacity for Markov decision processes. - Béatrice Bérard; Krishnendu Chatterjee; Nathalie Sznajder (Inf. Process. Lett., 2015)

Quantifying opacity. - Béatrice Bérard; John Mullins; Mathieu Sassolas (Math. Struct. Comput. Sci., 2015)

Preserving opacity on Interval Markov Chains under simulation. - Béatrice Bérard; Olga Kouchnarenko; John Mullins; Mathieu Sassolas (WODES, 2016)

Formal verification of mobile robot protocols. - Béatrice Bérard; Pascal Lafourcade 001; Laure Millet; Maria Potop-Butucaru; Yann Thierry-Mieg; Sébastien Tixeuil (Distributed Comput., 2016)

Interrupt Timed Automata with Auxiliary Clocks and Parameters. - Béatrice Bérard; Serge Haddad; Aleksandra Jovanovic 002; Didier Lime (Fundam. Informaticae, 2016)

Probabilistic Disclosure: Maximisation vs. Minimisation. - Béatrice Bérard; Serge Haddad; Engel Lefaucheux (FSTTCS, 2017)

Analysing timed compatibility of web service choreography. - Maya Souilah Benabdelhafid; Béatrice Bérard; Mahmoud Boufaïda (Int. J. Crit. Comput. Based Syst., 2017)

Non-interference in Partial Order Models. - Béatrice Bérard; Loïc Hélouët; John Mullins (ACM Trans. Embed. Comput. Syst., 2017)

Integrating Simulink Models into the Model Checker Cosmos. - Benoît Barbot; Béatrice Bérard; Yann Duplouy; Serge Haddad (Petri Nets, 2018)

Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. - Béatrice Bérard; Patricia Bouyer; Vincent Jugé (CSL, 2018)

Hyper Partial Order Logic. - Béatrice Bérard; Stefan Haar; Loïc Hélouët (FSTTCS, 2018)

Opacity for linear constraint Markov chains. - Béatrice Bérard; Olga Kouchnarenko; John Mullins; Mathieu Sassolas (Discret. Event Dyn. Syst., 2018)

The Complexity of Diagnosability and Opacity Verification for Petri Nets. - Béatrice Bérard; Stefan Haar; Sylvain Schmitz; Stefan Schwoon (Fundam. Informaticae, 2018)

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. - Béatrice Bérard; Benedikt Bollig; Mathieu Lehaut; Nathalie Sznajder (FoSSaCS, 2020)

Synthesis in Presence of Dynamic Links. - Béatrice Bérard; Benedikt Bollig; Patricia Bouyer; Matthias Függer; Nathalie Sznajder (GandALF, 2020)

Polynomial interrupt timed automata: Verification and expressiveness. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (Inf. Comput., 2021)

Revisiting reachability in Polynomial Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad (Inf. Process. Lett., 2022)

Corrigendum to "Revisiting reachability in polynomial interrupt timed automata" [Information Processing Letters 174 (2022) 106208]. - Béatrice Bérard; Serge Haddad (Inf. Process. Lett., 2022)

Synthesising Asynchronous Automata from Fair Specifications. - Béatrice Bérard; Benjamin Monmege; B. Srivathsan; Arnab Sur (CoRR, 2025)