Béatrice Bérard

76 papers A* 1A 2B 13C 2Journal 38Unranked 16

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