Antoine Petit

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