The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Antoine Petit: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Gastin, Antoine Petit
    A survey of recognizable languages with infinite traces. [Citation Graph (0, 0)][DBLP]
    Advances in Petri Nets: The DEMON Project, 1992, pp:392-409 [Conf]
  2. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Are Timed Automata Updatable? [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:464-479 [Conf]
  3. Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit
    Timed Control with Partial Observability. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:180-192 [Conf]
  4. Patricia Bouyer, Antoine Petit, Denis Thérien
    An Algebraic Characterization of Data and Timed Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:248-261 [Conf]
  5. Volker Diekert, Paul Gastin, Antoine Petit
    Recent Developments in Trace Theory. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:373-385 [Conf]
  6. Béatrice Bérard, Paul Gastin, Antoine Petit
    Intersection of Regular Signal-Event (Timed) Languages. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:52-66 [Conf]
  7. Béatrice Bérard, Paul Gastin, Antoine Petit
    Refinements and Abstractions of Signal-Event (Timed) Languages. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:67-81 [Conf]
  8. Patricia Bouyer, Antoine Petit
    Decomposition and Composition of Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:210-219 [Conf]
  9. Paul Gastin, Antoine Petit
    Asynchronous Cellular Automata for Infinite Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:583-594 [Conf]
  10. Paul Gastin, Antoine Petit, Wieslaw Zielonka
    A Kleene Theorem for Infinite Trace Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:254-266 [Conf]
  11. Joffroy Beauquier, Antoine Petit
    Distribution of Sequential Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:180-189 [Conf]
  12. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Expressiveness of Updatable Timed Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:232-242 [Conf]
  13. Christophe Cérin, Antoine Petit
    Speedup of Recognizable Trace Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:332-341 [Conf]
  14. Volker Diekert, Paul Gastin, Antoine Petit
    Recognizable Complex Trace Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:131-140 [Conf]
  15. Paul Gastin, Raphaël Meyer, Antoine Petit
    A (Non-elementary) Modular Decision Procedure for LTrL. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:356-365 [Conf]
  16. Paul Gastin, Antoine Petit
    Poset Properties of Complex Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:255-263 [Conf]
  17. Sébastien Huguet, Antoine Petit
    Modular Constructions of Distributing Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:467-478 [Conf]
  18. Raphaël Meyer, Antoine Petit
    Decomposition of TrPTL Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:418-427 [Conf]
  19. Antoine Petit
    Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:418-430 [Conf]
  20. Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
    Detection of Deadlocks in an Infinite Family of Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:334-347 [Conf]
  21. Béatrice Bérard, Paul Gastin, Antoine Petit
    On the Power of Non-Observable Actions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:257-268 [Conf]
  22. Luc Boasson, Antoine Petit
    Deterministic Languages and Non-Generators. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:39-46 [Conf]
  23. Volker Diekert, Paul Gastin, Antoine Petit
    Removing epsilon-Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:583-594 [Conf]
  24. Anne-Cécile Fabret, Antoine Petit
    On the Undecidability of Deadlock Detection in Families of Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:479-490 [Conf]
  25. Raphaël Meyer, Antoine Petit
    Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:533-543 [Conf]
  26. Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
    Syntactical Properties of Unbounded Nets of Processors. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:119-133 [Conf]
  27. Antoine Petit
    Recognizable Trace Languages, Distributed Automata and the Distribution Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:1, pp:89-101 [Journal]
  28. Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
    Characterization of the Expressive Power of Silent Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:36, n:2-3, pp:145-182 [Journal]
  29. Patricia Bouyer, Antoine Petit, Denis Thérien
    An algebraic approach to data languages and timed languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:2, pp:137-162 [Journal]
  30. Volker Diekert, Paul Gastin, Antoine Petit
    Rational and Recognizable Complex Trace Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:1, pp:134-153 [Journal]
  31. Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy
    Decidability of the Star Problem in A* x {b}*. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:2, pp:65-71 [Journal]
  32. Giovanna Guaiana, Raphaël Meyer, Antoine Petit, Pascal Weil
    An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:6, pp:277-282 [Journal]
  33. Luc Boasson, Antoine Petit
    Langages Algébriques Déterministes Non Générateurs. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:1, pp:41-57 [Journal]
  34. Bernadette Charron-Bost, Robert Cori, Antoine Petit
    Introduction à l'algorithmique des objets partagés. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:2, pp:97-148 [Journal]
  35. Patricia Bouyer, Antoine Petit
    A Kleene/Büchi-like Theorem for Clock Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:167-186 [Journal]
  36. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Updatable timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:291-345 [Journal]
  37. Paul Gastin, Antoine Petit, Wieslaw Zielonka
    An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:2, pp:167-204 [Journal]
  38. Antoine Petit
    Distribution and Synchronized Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:76, n:2-3, pp:285-308 [Journal]
  39. Béatrice Bérard, Paul Gastin, Antoine Petit
    Timed substitutions for regular signal-event languages. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2007, v:31, n:2, pp:101-134 [Journal]

Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002