Béatrice Bérard

Publication Activity (10 Years)

Years Active: 1986-2022
Publications (10 Years): 19

Top Topics

Markov Decision Process

Top Venues

Inf. Process. Lett.

Fundam. Informaticae

Publications

Béatrice Bérard, Serge Haddad
Corrigendum to "Revisiting reachability in polynomial interrupt timed automata" [Information Processing Letters 174 (2022) 106208]. Inf. Process. Lett. 175 (2022)
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder
Synthesis in presence of dynamic links. Inf. Comput. 289 (Part) (2022)
Béatrice Bérard, Serge Haddad
Revisiting reachability in Polynomial Interrupt Timed Automata. Inf. Process. Lett. 174 (2022)
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
Polynomial interrupt timed automata: Verification and expressiveness. Inf. Comput. 277 (2021)
Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS (2020)
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder
Synthesis in Presence of Dynamic Links. GandALF (2020)
Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Parameterized Synthesis for Fragments of First-Order Logic over Data Words. CoRR (2019)
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundam. Informaticae 161 (4) (2018)
Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas
Opacity for linear constraint Markov chains. Discret. Event Dyn. Syst. 28 (1) (2018)
Benoît Barbot, Béatrice Bérard, Yann Duplouy, Serge Haddad
Integrating Simulink Models into the Model Checker Cosmos. Petri Nets (2018)
Béatrice Bérard, Patricia Bouyer, Vincent Jugé
Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. CSL (2018)
Béatrice Bérard, Stefan Haar, Loïc Hélouët
Hyper Partial Order Logic. FSTTCS (2018)
Béatrice Bérard, Serge Haddad, Engel Lefaucheux
Probabilistic Disclosure: Maximisation vs. Minimisation. FSTTCS (2017)
Béatrice Bérard, Loïc Hélouët, John Mullins
Non-interference in Partial Order Models. ACM Trans. Embed. Comput. Syst. 16 (2) (2017)
Maya Souilah Benabdelhafid, Béatrice Bérard, Mahmoud Boufaïda
Analysing timed compatibility of web service choreography. Int. J. Crit. Comput. Based Syst. 7 (3) (2017)
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Petri Nets (2017)
Béatrice Bérard, Pascal Lafourcade, Laure Millet, Maria Potop-Butucaru, Yann Thierry-Mieg, Sébastien Tixeuil
Formal verification of mobile robot protocols. Distributed Comput. 29 (6) (2016)
Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime
Interrupt Timed Automata with Auxiliary Clocks and Parameters. Fundam. Informaticae 143 (3-4) (2016)
Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas
Preserving opacity on Interval Markov Chains under simulation. WODES (2016)
Béatrice Bérard, Loïc Hélouët, John Mullins
Non-interference in Partial Order Models. ACSD (2015)
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
Polynomial Interrupt Timed Automata. CoRR (2015)
Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas
Probabilistic Opacity in Refinement-Based Modeling. CoRR (2015)
Béatrice Bérard, John Mullins, Mathieu Sassolas
Quantifying opacity. Math. Struct. Comput. Sci. 25 (2) (2015)
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
Polynomial Interrupt Timed Automata. RP (2015)
Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder
Probabilistic opacity for Markov decision processes. Inf. Process. Lett. 115 (1) (2015)
Yan Zhang, Béatrice Bérard, Lom-Messan Hillah, Fabrice Kordon, Yann Thierry-Mieg
Controllability for discrete event systems modelled in VeriJ. Int. J. Crit. Comput. Based Syst. 5 (3/4) (2014)
Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime
Interrupt Timed Automata with Auxiliary Clocks and Parameters. CoRR (2014)
Béatrice Bérard, Olivier Carton
Channel Synthesis Revisited. LATA (2014)
Béatrice Bérard, John Mullins
Verification of Information Flow Properties under Rational Observation. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014)
Béatrice Bérard, John Mullins
Verification of Information Flow Properties under Rational Observation. CoRR (2014)
Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder
Probabilistic Opacity for Markov Decision Processes. CoRR (2014)
Yan Zhang, Béatrice Bérard, Lom-Messan Hillah, Yann Thierry-Mieg
Semi-automatic controller design of Java-like models. FTfJP@ECOOP (2013)
Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
The expressive power of time Petri nets. Theor. Comput. Sci. 474 (2013)
Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime
Parametric Interrupt Timed Automata. RP (2013)
Béatrice Bérard, John Mullins, Mathieu Sassolas
Quantifying Opacity CoRR (2013)
Béatrice Bérard, Serge Haddad, Mathieu Sassolas
Interrupt Timed Automata: verification and expressiveness CoRR (2012)
Béatrice Bérard, Serge Haddad, Mathieu Sassolas
Interrupt Timed Automata: verification and expressiveness. Formal Methods Syst. Des. 40 (1) (2012)
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas
Channel Synthesis for Finite Transducers. Int. J. Found. Comput. Sci. 23 (6) (2012)
Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder
Concurrent Games on VASS with Inhibition. CONCUR (2012)
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas
Channel Synthesis for Finite Transducers. AFL (2011)
Béatrice Bérard, Serge Haddad, Mathieu Sassolas
Real Time Properties for Interrupt Timed Automata. TIME (2010)
Houda Bel Mokadem, Béatrice Bérard, V. Gourcuff, O. De Smet, J. Roussel
Verification of a Timed Multitask System With Uppaal. IEEE Trans Autom. Sci. Eng. 7 (4) (2010)
Béatrice Bérard, John Mullins, Mathieu Sassolas
Quantifying Opacity. QEST (2010)
Yan Zhang, Béatrice Bérard, Fabrice Kordon, Yann Thierry-Mieg
Automated controllability and synthesis with hierarchical set decision diagrams. WODES (2010)
Béatrice Bérard, Serge Haddad
Interrupt Timed Automata. FoSSaCS (2009)
Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
When are Timed Automata weakly timed bisimilar to Time Petri Nets? Theor. Comput. Sci. 403 (2-3) (2008)
Béatrice Bérard, Paul Gastin, Antoine Petit
Timed substitutions for regular signal-event languages. Formal Methods Syst. Des. 31 (2) (2007)
Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
Timed Temporal Logics for Abstracting Transient States. ATVA (2006)
Béatrice Bérard, Paul Gastin, Antoine Petit
Intersection of Regular Signal-Event (Timed) Languages. FORMATS (2006)
Béatrice Bérard, Paul Gastin, Antoine Petit
Refinements and Abstractions of Signal-Event (Timed) Languages. FORMATS (2006)
Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
Comparison of Different Semantics for Time Petri Nets. ATVA (2005)
Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
Comparison of the Expressiveness of Timed Automata and Time Petri Nets. FORMATS (2005)
Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? FSTTCS (2005)
Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
A New Modality for Almost Everywhere Properties in Timed Automata. CONCUR (2005)
Béatrice Bérard, Laurent Fribourg, Francis Klay, Jean-François Monin
Compared Study of Two Correctness Proofs for the Standardized. Formal Methods Syst. Des. 22 (1) (2003)
Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg, Frédéric Magniette
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. Distributed Comput. 14 (2) (2001)
Béatrice Bérard, Claudine Picaronny
Accepting Zeno words: a way toward timed refinements. Acta Informatica 37 (1) (2000)
Béatrice Bérard, Catherine Dufourd
Timed automata and additive clock constraints. Inf. Process. Lett. 75 (1-2) (2000)
Béatrice Bérard, Anne Labroue, Philippe Schnoebelen
Verifying Performance Equivalence for Timed Basic Parallel Processes. FoSSaCS (2000)
Béatrice Bérard, Laurent Fribourg
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. CONCUR (1999)
Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg
A New Rewrite Method for Convergence of Self-Stabilizing Systems. DISC (1999)
Béatrice Bérard, Laurent Fribourg
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. CAV (1999)
Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundam. Informaticae 36 (2-3) (1998)
Béatrice Bérard, Claudine Picaronny
Accepting Zeno Words Without Making Time Stand Still. MFCS (1997)
Béatrice Bérard, Paul Gastin, Antoine Petit
On the Power of Non-Observable Actions in Timed Automata. STACS (1996)
Béatrice Bérard
Untiming Timed Languages. Inf. Process. Lett. 55 (3) (1995)
Béatrice Bérard
Global Serializability of Concurrent Programs. Theor. Comput. Sci. 124 (1) (1994)
Béatrice Bérard
Literal Shuffle. Theor. Comput. Sci. 51 (1987)
Béatrice Bérard
Formal properties of literal shuffle. Acta Cybern. 8 (1) (1987)
Joffroy Beauquier, Béatrice Bérard
On the Equivalence of Synchronization Sets. CAAP (1986)