Béatrice Bérard

According to our database, Béatrice Bérard authored at least 61 papers between 1986 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Revisiting reachability in Polynomial Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad

Inf. Process. Lett., 2022

2021

Polynomial interrupt timed automata: Verification and expressiveness.

Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas

Inf. Comput., 2021

2020

Synthesis in Presence of Dynamic Links.

Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder

Proceedings of the Proceedings 11th International Symposium on Games, 2020

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words.

Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder

Proceedings of the Foundations of Software Science and Computation Structures, 2020

2018

The Complexity of Diagnosability and Opacity Verification for Petri Nets.

Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon

Fundam. Informaticae, 2018

Opacity for linear constraint Markov chains.

Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

Discret. Event Dyn. Syst., 2018

Hyper Partial Order Logic.

Béatrice Bérard, Stefan Haar, Loïc Hélouët

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Finite Bisimulations for Dynamical Systems with Overlapping Trajectories.

Béatrice Bérard, Patricia Bouyer, Vincent Jugé

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Integrating Simulink Models into the Model Checker Cosmos.

Benoît Barbot, Béatrice Bérard, Yann Duplouy, Serge Haddad

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017

Non-interference in Partial Order Models.

Béatrice Bérard, Loïc Hélouët, John Mullins

ACM Trans. Embed. Comput. Syst., 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

Probabilistic Disclosure: Maximisation vs. Minimisation.

Béatrice Bérard, Serge Haddad, Engel Lefaucheux

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Interrupt Timed Automata with Auxiliary Clocks and Parameters.

Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime

Fundam. Informaticae, 2016

Formal verification of mobile robot protocols.

Béatrice Bérard, Pascal Lafourcade, Laure Millet, Maria Potop-Butucaru, Yann Thierry-Mieg, Sébastien Tixeuil

Distributed Comput., 2016

Preserving opacity on Interval Markov Chains under simulation.

Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

Proceedings of the 13th International Workshop on Discrete Event Systems, 2016

2015

Quantifying opacity.

Béatrice Bérard, John Mullins, Mathieu Sassolas

Math. Struct. Comput. Sci., 2015

Probabilistic opacity for Markov decision processes.

Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder

Inf. Process. Lett., 2015

Probabilistic Opacity in Refinement-Based Modeling.

Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

CoRR, 2015

Polynomial Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas

Proceedings of the Reachability Problems - 9th International Workshop, 2015

2014

Controllability for discrete event systems modelled in VeriJ.

Yan Zhang, Béatrice Bérard, Lom-Messan Hillah, Fabrice Kordon, Yann Thierry-Mieg

Int. J. Crit. Comput. Based Syst., 2014

Verification of Information Flow Properties under Rational Observation.

Béatrice Bérard, John Mullins

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

Channel Synthesis Revisited.

Béatrice Bérard, Olivier Carton

Proceedings of the Language and Automata Theory and Applications, 2014

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

Parametric Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Semi-automatic controller design of Java-like models.

Yan Zhang, Béatrice Bérard, Lom-Messan Hillah, Yann Thierry-Mieg

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs, 2013

Timed Model-Checking.

Béatrice Bérard

Proceedings of the Communicating Embedded Systems, 2013

Petri Nets with Time.

Béatrice Bérard, Maria Paola Cabasino, Angela Di Febbraro, Alessandro Giua, Carla Seatzu

Proceedings of the Control of Discrete-Event Systems, 2013

An Introduction to Timed Automata.

Béatrice Bérard

Proceedings of the Control of Discrete-Event Systems, 2013

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

Interrupt Timed Automata: verification and expressiveness.

Béatrice Bérard, Serge Haddad, Mathieu Sassolas

Formal Methods Syst. Des., 2012

Concurrent Games on VASS with Inhibition.

Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

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

Automated controllability and synthesis with hierarchical set decision diagrams.

Yan Zhang, Béatrice Bérard, Fabrice Kordon, Yann Thierry-Mieg

Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Real Time Properties for Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad, Mathieu Sassolas

Proceedings of the TIME 2010, 2010

2009

Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad

Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008

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

2007

Timed substitutions for regular signal-event languages.

Béatrice Bérard, Paul Gastin, Antoine Petit

Formal Methods Syst. Des., 2007

2006

Refinements and Abstractions of Signal-Event (Timed) Languages.

Béatrice Bérard, Paul Gastin, Antoine Petit

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Intersection of Regular Signal-Event (Timed) Languages.

Béatrice Bérard, Paul Gastin, Antoine Petit

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Timed Temporal Logics for Abstracting Transient States.

Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie

Proceedings of the Automated Technology for Verification and Analysis, 2006

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

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

A New Modality for Almost Everywhere Properties in Timed Automata.

Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Comparison of Different Semantics for Time Petri Nets.

Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux

Proceedings of the Automated Technology for Verification and Analysis, 2005

2003

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

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

Systems and Software Verification, Model-Checking Techniques and Tools.

Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie

Springer, ISBN: 9783540415237, 2001

2000

Timed automata and additive clock constraints.

Béatrice Bérard, Catherine Dufourd

Inf. Process. Lett., 2000

Accepting Zeno words: a way toward timed refinements.

Béatrice Bérard, Claudine Picaronny

Acta Informatica, 2000

Verifying Performance Equivalence for Timed Basic Parallel Processes.

Béatrice Bérard, Anne Labroue, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2000

1999

A New Rewrite Method for Convergence of Self-Stabilizing Systems.

Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg

Proceedings of the Distributed Computing, 1999

Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.

Béatrice Bérard, Laurent Fribourg

Proceedings of the CONCUR '99: Concurrency Theory, 1999

Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol.

Béatrice Bérard, Laurent Fribourg

Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998

Characterization of the Expressive Power of Silent Transitions in Timed Automata.

Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin

Fundam. Informaticae, 1998

1997

Accepting Zeno Words Without Making Time Stand Still.

Béatrice Bérard, Claudine Picaronny

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

On the Power of Non-Observable Actions in Timed Automata.

Béatrice Bérard, Paul Gastin, Antoine Petit

Proceedings of the STACS 96, 1996

1995

Untiming Timed Languages.

Béatrice Bérard

Inf. Process. Lett., 1995

1994

Global Serializability of Concurrent Programs.

Béatrice Bérard

Theor. Comput. Sci., 1994

1987

Literal Shuffle.

Béatrice Bérard

Theor. Comput. Sci., 1987

Formal properties of literal shuffle.

Béatrice Bérard

Acta Cybern., 1987

1986

On the Equivalence of Synchronization Sets.

Joffroy Beauquier, Béatrice Bérard

Proceedings of the CAAP '86, 1986