Antoine Petit

Publication Activity (10 Years)

Years Active: 1985-2017
Publications (10 Years): 1

Publications

Pierre-Louis Curien, Gérard P. Huet, Antoine Petit
Obituary Maurice Nivat (1937-2017). Bull. EATCS 123 (2017)
Béatrice Bérard, Paul Gastin, Antoine Petit
Timed substitutions for regular signal-event languages. Formal Methods Syst. Des. 31 (2) (2007)
Béatrice Bérard, Paul Gastin, Antoine Petit
Intersection of Regular Signal-Event (Timed) Languages. FORMATS (2006)
Béatrice Bérard, Paul Gastin, Antoine Petit
Refinements and Abstractions of Signal-Event (Timed) Languages. FORMATS (2006)
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
Updatable timed automata. Theor. Comput. Sci. 321 (2-3) (2004)
Patricia Bouyer, Antoine Petit, Denis Thérien
An algebraic approach to data languages and timed languages. Inf. Comput. 182 (2) (2003)
Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit
Timed Control with Partial Observability. CAV (2003)
Patricia Bouyer, Antoine Petit
A Kleene/Büchi-like Theorem for Clock Languages. J. Autom. Lang. Comb. 7 (2) (2002)
Patricia Bouyer, Antoine Petit, Denis Thérien
An Algebraic Characterization of Data and Timed Languages. CONCUR (2001)
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
Are Timed Automata Updatable? CAV (2000)
Géraud Canet, Sandrine Couffin, Jean-Jacques Lesage, Antoine Petit, Philippe Schnoebelen
Towards the automatic verification of PLC programs written in Instruction List. SMC (2000)
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
Expressiveness of Updatable Timed Automata. MFCS (2000)
Patricia Bouyer, Antoine Petit
Decomposition and Composition of Timed Automata. ICALP (1999)
Paul Gastin, Raphaël Meyer, Antoine Petit
A (Non-elementary) Modular Decision Procedure for LTrL. MFCS (1998)
Raphaël Meyer, Antoine Petit
Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof. STACS (1998)
Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundam. Informaticae 36 (2-3) (1998)
Giovanna Guaiana, Raphaël Meyer, Antoine Petit, Pascal Weil
An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. Inf. Process. Lett. 67 (6) (1998)
Volker Diekert, Paul Gastin, Antoine Petit
Removing epsilon-Transitions in Timed Automata. STACS (1997)
Bernadette Charron-Bost, Robert Cori, Antoine Petit
Introduction à l'algorithmique des objets partagés. RAIRO Theor. Informatics Appl. 31 (2) (1997)
Raphaël Meyer, Antoine Petit
Decomposition of TrPTL Formulas. MFCS (1997)
Béatrice Bérard, Paul Gastin, Antoine Petit
On the Power of Non-Observable Actions in Timed Automata. STACS (1996)
Anne-Cécile Fabret, Antoine Petit
On the Undecidability of Deadlock Detection in Families of Nets. STACS (1995)
Volker Diekert, Paul Gastin, Antoine Petit
Recent Developments in Trace Theory. Developments in Language Theory (1995)
Volker Diekert, Paul Gastin, Antoine Petit
Rational and Recognizable Complex Trace Languages Inf. Comput. 116 (1) (1995)
Sébastien Huguet, Antoine Petit
Modular Constructions of Distributing Automata. MFCS (1995)
Paul Gastin, Antoine Petit, Wieslaw Zielonka
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. Theor. Comput. Sci. 125 (2) (1994)
Antoine Petit
Recognizable Trace Languages, Distributed Automata and the Distribution Problem. Acta Informatica 30 (1) (1993)
Christophe Cérin, Antoine Petit
Speedup of Recognizable Trace Languages. MFCS (1993)
Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy
Decidability of the Star Problem in A* x {b}*. Inf. Process. Lett. 44 (2) (1992)
Paul Gastin, Antoine Petit
Asynchronous Cellular Automata for Infinite Traces. ICALP (1992)
Paul Gastin, Antoine Petit
Poset Properties of Complex Traces. MFCS (1992)
Volker Diekert, Paul Gastin, Antoine Petit
Recognizable Complex Trace Languages. MFCS (1991)
Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
Detection of Deadlocks in an Infinite Family of Nets. STACS (1991)
Paul Gastin, Antoine Petit, Wieslaw Zielonka
A Kleene Theorem for Infinite Trace Languages. ICALP (1991)
Antoine Petit
Distribution and Synchronized Automata. Theor. Comput. Sci. 76 (2-3) (1990)
Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
Syntactical Properties of Unbounded Nets of Processors. TAPSOFT, Vol.1 (1989)
Antoine Petit
Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract). MFCS (1989)
Joffroy Beauquier, Antoine Petit
Distribution of Sequential Processes. MFCS (1988)
Luc Boasson, Antoine Petit
Langages Algébriques Déterministes Non Générateurs. RAIRO Theor. Informatics Appl. 21 (1) (1987)
Luc Boasson, Antoine Petit
Deterministic Languages and Non-Generators. STACS (1985)