Catherine Dufourd

According to our database, Catherine Dufourd authored at least 9 papers between 1993 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2004

Updatable timed automata.

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit

Theor. Comput. Sci., 2004

2000

Timed automata and additive clock constraints.

Béatrice Bérard, Catherine Dufourd

Inf. Process. Lett., 2000

Expressiveness of Updatable Timed Automata.

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Are Timed Automata Updatable?

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

A Polynomial-Bisimilar Normalization for Reset Petri Nets.

Catherine Dufourd, Alain Finkel

Theor. Comput. Sci., 1999

Boundedness of Reset P/T Nets.

Catherine Dufourd, Petr Jancar, Philippe Schnoebelen

Proceedings of the Automata, 1999

1998

Reset Nets Between Decidability and Undecidability.

Catherine Dufourd, Alain Finkel, Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Polynomial-Time Manz-One Reductions for Petri Nets.

Catherine Dufourd, Alain Finkel

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1993

An Efficient Parallel Solution for the Longest Increasing Subsequence Problem.

Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo

Proceedings of the Computing and Information, 1993