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