The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Béatrice Bérard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Joffroy Beauquier, Béatrice Bérard
    On the Equivalence of Synchronization Sets. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:17-29 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Béatrice Bérard
    Formal properties of literal shuffle. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1987, v:8, n:, pp:27-39 [Journal]
  17. 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]
  18. 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]
  19. 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]
  20. Béatrice Bérard
    Untiming Timed Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:3, pp:129-135 [Journal]
  21. 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]
  22. Béatrice Bérard
    Literal Shuffle. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:281-299 [Journal]
  23. 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]
  24. 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]

  25. Interrupt Timed Automata. [Citation Graph (, )][DBLP]


Search in 0.161secs, Finished in 0.162secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002