| 2004 |
|---|
| 9 | EE | Patricia Bouyer,
Catherine Dufourd,
Emmanuel Fleury,
Antoine Petit:
Updatable timed automata.
Theor. Comput. Sci. 321(2-3): 291-345 (2004) |
| 2000 |
|---|
| 8 | | Patricia Bouyer,
Catherine Dufourd,
Emmanuel Fleury,
Antoine Petit:
Are Timed Automata Updatable?
CAV 2000: 464-479 |
| 7 | EE | Patricia Bouyer,
Catherine Dufourd,
Emmanuel Fleury,
Antoine Petit:
Expressiveness of Updatable Timed Automata.
MFCS 2000: 232-242 |
| 6 | EE | Béatrice Bérard,
Catherine Dufourd:
Timed automata and additive clock constraints.
Inf. Process. Lett. 75(1-2): 1-7 (2000) |
| 1999 |
|---|
| 5 | EE | Catherine Dufourd,
Petr Jancar,
Ph. Schnoebelen:
Boundedness of Reset P/T Nets.
ICALP 1999: 301-310 |
| 4 | EE | Catherine Dufourd,
Alain Finkel:
A Polynomial-Bisimilar Normalization for Reset Petri Nets.
Theor. Comput. Sci. 222(1-2): 187-194 (1999) |
| 1998 |
|---|
| 3 | EE | Catherine Dufourd,
Alain Finkel,
Ph. Schnoebelen:
Reset Nets Between Decidability and Undecidability.
ICALP 1998: 103-115 |
| 1997 |
|---|
| 2 | EE | Catherine Dufourd,
Alain Finkel:
Polynomial-Time Manz-One Reductions for Petri Nets.
FSTTCS 1997: 312-326 |
| 1993 |
|---|
| 1 | | Christophe Cérin,
Catherine Dufourd,
Jean Frédéric Myoupo:
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem.
ICCI 1993: 220-224 |
