Deterministic Languages and Non-Generators. - Luc Boasson; Antoine Petit 001 (STACS, 1985)

Langages Algébriques Déterministes Non Générateurs. - Luc Boasson; Antoine Petit 001 (RAIRO Theor. Informatics Appl., 1987)

Distribution of Sequential Processes. - Joffroy Beauquier; Antoine Petit 001 (MFCS, 1988)

Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract). - Antoine Petit 001 (MFCS, 1989)

Syntactical Properties of Unbounded Nets of Processors. - Joffroy Beauquier; Annie Choquet; Antoine Petit 001; Guy Vidal-Naquet (TAPSOFT, Vol.1, 1989)

Distribution and Synchronized Automata. - Antoine Petit 001 (Theor. Comput. Sci., 1990)

A Kleene Theorem for Infinite Trace Languages. - Paul Gastin; Antoine Petit 001; Wieslaw Zielonka (ICALP, 1991)

Recognizable Complex Trace Languages. - Volker Diekert; Paul Gastin; Antoine Petit 001 (MFCS, 1991)

Detection of Deadlocks in an Infinite Family of Nets. - Joffroy Beauquier; Annie Choquet; Antoine Petit 001; Guy Vidal-Naquet (STACS, 1991)

A survey of recognizable languages with infinite traces. - Paul Gastin; Antoine Petit 001 (Advances in Petri Nets: The DEMON Project, 1992)

Asynchronous Cellular Automata for Infinite Traces. - Paul Gastin; Antoine Petit 001 (ICALP, 1992)

Poset Properties of Complex Traces. - Paul Gastin; Antoine Petit 001 (MFCS, 1992)

Decidability of the Star Problem in A* x {b}*. - Paul Gastin; Edward Ochmanski; Antoine Petit 001; Brigitte Rozoy (Inf. Process. Lett., 1992)

Speedup of Recognizable Trace Languages. - Christophe Cérin; Antoine Petit 001 (MFCS, 1993)

Recognizable Trace Languages, Distributed Automata and the Distribution Problem. - Antoine Petit 001 (Acta Informatica, 1993)

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. - Paul Gastin; Antoine Petit 001; Wieslaw Zielonka (Theor. Comput. Sci., 1994)

Infinite Traces. - Paul Gastin; Antoine Petit 001 (The Book of Traces, 1995)

Recent Developments in Trace Theory. - Volker Diekert; Paul Gastin; Antoine Petit 001 (Developments in Language Theory, 1995)

Modular Constructions of Distributing Automata. - Sébastien Huguet; Antoine Petit 001 (MFCS, 1995)

On the Undecidability of Deadlock Detection in Families of Nets. - Anne-Cécile Fabret; Antoine Petit 001 (STACS, 1995)

Rational and Recognizable Complex Trace Languages - Volker Diekert; Paul Gastin; Antoine Petit 001 (Inf. Comput., 1995)

On the Power of Non-Observable Actions in Timed Automata. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (STACS, 1996)

Decomposition of TrPTL Formulas. - Raphaël Meyer; Antoine Petit 001 (MFCS, 1997)

Removing epsilon-Transitions in Timed Automata. - Volker Diekert; Paul Gastin; Antoine Petit 001 (STACS, 1997)

Introduction à l'algorithmique des objets partagés. - Bernadette Charron-Bost; Robert Cori; Antoine Petit 001 (RAIRO Theor. Informatics Appl., 1997)

A (Non-elementary) Modular Decision Procedure for LTrL. - Paul Gastin; Raphaël Meyer; Antoine Petit 001 (MFCS, 1998)

Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof. - Raphaël Meyer; Antoine Petit 001 (STACS, 1998)

Characterization of the Expressive Power of Silent Transitions in Timed Automata. - Béatrice Bérard; Antoine Petit 001; Volker Diekert; Paul Gastin (Fundam. Informaticae, 1998)

An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. - Giovanna Guaiana; Raphaël Meyer; Antoine Petit 001; Pascal Weil (Inf. Process. Lett., 1998)

Decomposition and Composition of Timed Automata. - Patricia Bouyer; Antoine Petit 001 (ICALP, 1999)

Are Timed Automata Updatable? - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (CAV, 2000)

Expressiveness of Updatable Timed Automata. - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (MFCS, 2000)

Towards the automatic verification of PLC programs written in Instruction List. - Géraud Canet; Sandrine Couffin; Jean-Jacques Lesage; Antoine Petit 001; Philippe Schnoebelen (SMC, 2000)

Systems and Software Verification, Model-Checking Techniques and Tools. - Béatrice Bérard; Michel Bidoit; Alain Finkel; François Laroussinie; Antoine Petit 001; Laure Petrucci; Philippe Schnoebelen; Pierre McKenzie (Springer, 2001)

An Algebraic Characterization of Data and Timed Languages. - Patricia Bouyer; Antoine Petit 001; Denis Thérien (CONCUR, 2001)

A Kleene/Büchi-like Theorem for Clock Languages. - Patricia Bouyer; Antoine Petit 001 (J. Autom. Lang. Comb., 2002)

Timed Control with Partial Observability. - Patricia Bouyer; Deepak D'Souza; P. Madhusudan; Antoine Petit 001 (CAV, 2003)

An algebraic approach to data languages and timed languages. - Patricia Bouyer; Antoine Petit 001; Denis Thérien (Inf. Comput., 2003)

Updatable timed automata. - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (Theor. Comput. Sci., 2004)

Intersection of Regular Signal-Event (Timed) Languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (FORMATS, 2006)

Refinements and Abstractions of Signal-Event (Timed) Languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (FORMATS, 2006)

Timed substitutions for regular signal-event languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (Formal Methods Syst. Des., 2007)

Obituary Maurice Nivat (1937-2017). - Pierre-Louis Curien; Gérard P. Huet; Antoine Petit 001 (Bull. EATCS, 2017)