| 2009 |
|---|
| 26 | EE | Béatrice Bérard,
Serge Haddad:
Interrupt Timed Automata.
FOSSACS 2009: 197-211 |
| 2008 |
|---|
| 25 | EE | 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): 202-220 (2008) |
| 2007 |
|---|
| 24 | EE | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
Timed substitutions for regular signal-event languages.
Formal Methods in System Design 31(2): 101-134 (2007) |
| 2006 |
|---|
| 23 | EE | Houda Bel Mokadem,
Béatrice Bérard,
Patricia Bouyer,
François Laroussinie:
Timed Temporal Logics for Abstracting Transient States.
ATVA 2006: 337-351 |
| 22 | EE | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
Intersection of Regular Signal-Event (Timed) Languages.
FORMATS 2006: 52-66 |
| 21 | EE | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
Refinements and Abstractions of Signal-Event (Timed) Languages.
FORMATS 2006: 67-81 |
| 2005 |
|---|
| 20 | EE | Béatrice Bérard,
Franck Cassez,
Serge Haddad,
Didier Lime,
Olivier H. Roux:
Comparison of Different Semantics for Time Petri Nets.
ATVA 2005: 293-307 |
| 19 | EE | Houda Bel Mokadem,
Béatrice Bérard,
Patricia Bouyer,
François Laroussinie:
A New Modality for Almost Everywhere Properties in Timed Automata.
CONCUR 2005: 110-124 |
| 18 | EE | 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: 211-225 |
| 17 | EE | 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: 273-284 |
| 2003 |
|---|
| 16 | | Béatrice Bérard,
Laurent Fribourg,
Francis Klay,
Jean-François Monin:
Compared Study of Two Correctness Proofs for the Standardized.
Formal Methods in System Design 22(1): 59-86 (2003) |
| 2001 |
|---|
| 15 | EE | 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 Computing 14(2): 83-95 (2001) |
| 2000 |
|---|
| 14 | EE | Béatrice Bérard,
Anne Labroue,
Ph. Schnoebelen:
Verifying Performance Equivalence for Timed Basic Parallel Processes.
FoSSaCS 2000: 35-47 |
| 13 | EE | Béatrice Bérard,
Claudine Picaronny:
Accepting Zeno words: a way toward timed refinements.
Acta Inf. 37(1): 45-81 (2000) |
| 12 | EE | Béatrice Bérard,
Catherine Dufourd:
Timed automata and additive clock constraints.
Inf. Process. Lett. 75(1-2): 1-7 (2000) |
| 1999 |
|---|
| 11 | EE | Béatrice Bérard,
Laurent Fribourg:
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol.
CAV 1999: 96-107 |
| 10 | EE | Béatrice Bérard,
Laurent Fribourg:
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.
CONCUR 1999: 178-193 |
| 9 | EE | Joffroy Beauquier,
Béatrice Bérard,
Laurent Fribourg:
A New Rewrite Method for Convergence of Self-Stabilizing Systems.
DISC 1999: 240-253 |
| 1998 |
|---|
| 8 | | Béatrice Bérard,
Antoine Petit,
Volker Diekert,
Paul Gastin:
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform. 36(2-3): 145-182 (1998) |
| 1997 |
|---|
| 7 | | Béatrice Bérard,
Claudine Picaronny:
Accepting Zeno Words Without Making Time Stand Still.
MFCS 1997: 149-158 |
| 1996 |
|---|
| 6 | | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
On the Power of Non-Observable Actions in Timed Automata.
STACS 1996: 257-268 |
| 1995 |
|---|
| 5 | EE | Béatrice Bérard:
Untiming Timed Languages.
Inf. Process. Lett. 55(3): 129-135 (1995) |
| 1994 |
|---|
| 4 | | Béatrice Bérard:
Global Serializability of Concurrent Programs.
Theor. Comput. Sci. 124(1): 41-70 (1994) |
| 1987 |
|---|
| 3 | | Béatrice Bérard:
Formal properties of literal shuffle.
Acta Cybern. 8: 27-39 (1987) |
| 2 | | Béatrice Bérard:
Literal Shuffle.
Theor. Comput. Sci. 51: 281-299 (1987) |
| 1986 |
|---|
| 1 | | Joffroy Beauquier,
Béatrice Bérard:
On the Equivalence of Synchronization Sets.
CAAP 1986: 17-29 |
