Antoine Petit

According to our database1, Antoine Petit
  • authored at least 40 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Deformed Reality: Proof of Concept and Preliminary Results.
Proceedings of the IEEE International Symposium on Mixed and Augmented Reality, 2017

2007
Timed substitutions for regular signal-event languages.
Formal Methods in System Design, 2007

2006
Refinements and Abstractions of Signal-Event (Timed) Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Intersection of Regular Signal-Event (Timed) Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

2004
Updatable timed automata.
Theor. Comput. Sci., 2004

2003
An algebraic approach to data languages and timed languages.
Inf. Comput., 2003

Timed Control with Partial Observability.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
A Kleene/Büchi-like Theorem for Clock Languages.
Journal of Automata, Languages and Combinatorics, 2002

2001
An Algebraic Characterization of Data and Timed Languages.
Proceedings of the CONCUR 2001, 2001

2000
Expressiveness of Updatable Timed Automata.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Are Timed Automata Updatable?
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Decomposition and Composition of Timed Automata.
Proceedings of the Automata, 1999

1998
An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces.
Inf. Process. Lett., 1998

Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform., 1998

Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof.
Proceedings of the STACS 98, 1998

A (Non-elementary) Modular Decision Procedure for LTrL.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Introduction à l'algorithmique des objets partagés.
ITA, 1997

Removing epsilon-Transitions in Timed Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Decomposition of TrPTL Formulas.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996
On the Power of Non-Observable Actions in Timed Automata.
Proceedings of the STACS 96, 1996

1995
Rational and Recognizable Complex Trace Languages
Inf. Comput., January, 1995

On the Undecidability of Deadlock Detection in Families of Nets.
STACS, 1995

Modular Constructions of Distributing Automata.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Recent Developments in Trace Theory.
Proceedings of the Developments in Language Theory II, 1995

1994
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.
Theor. Comput. Sci., 1994

1993
Recognizable Trace Languages, Distributed Automata and the Distribution Problem.
Acta Inf., 1993

Speedup of Recognizable Trace Languages.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Decidability of the Star Problem in A* x {b}*.
Inf. Process. Lett., 1992

Poset Properties of Complex Traces.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Asynchronous Cellular Automata for Infinite Traces.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

A survey of recognizable languages with infinite traces.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991
Detection of Deadlocks in an Infinite Family of Nets.
Proceedings of the STACS 91, 1991

Recognizable Complex Trace Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

A Kleene Theorem for Infinite Trace Languages.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Distribution and Synchronized Automata.
Theor. Comput. Sci., 1990

1989
Syntactical Properties of Unbounded Nets of Processors.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988
Distribution of Sequential Processes.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
Langages Algébriques Déterministes Non Générateurs.
ITA, 1987

1985
Deterministic Languages and Non-Generators.
Proceedings of the STACS 85, 1985


  Loading...