default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Petit 0001
Person information
- affiliation: LSV, CNRS & ENS de Cachan
Other persons with the same name
- Antoine Petit 0002
![[0000-0002-5444-7970]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5444-7970")
— IRISA / INRIA Rennes - Antoine Petit 0003 — INRIA, Strasbourg, France
- Antoine Petit 0004 — Hôpitaux Universitaires Paris Seine, France (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j14]Pierre-Louis Curien, Gérard P. Huet, Antoine Petit:
Obituary Maurice Nivat (1937-2017). Bull. EATCS 123 (2017)
2000 – 2009
- 2007
- [j13]Béatrice Bérard, Paul Gastin, Antoine Petit:
Timed substitutions for regular signal-event languages. Formal Methods Syst. Des. 31(2): 101-134 (2007) - 2006
- [c26]Béatrice Bérard, Paul Gastin, Antoine Petit:
Intersection of Regular Signal-Event (Timed) Languages. FORMATS 2006: 52-66 - [c25]Béatrice Bérard, Paul Gastin, Antoine Petit:
Refinements and Abstractions of Signal-Event (Timed) Languages. FORMATS 2006: 67-81 - 2004
- [j12]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Updatable timed automata. Theor. Comput. Sci. 321(2-3): 291-345 (2004) - 2003
- [j11]Patricia Bouyer, Antoine Petit, Denis Thérien:
An algebraic approach to data languages and timed languages. Inf. Comput. 182(2): 137-162 (2003) - [c24]Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit:
Timed Control with Partial Observability. CAV 2003: 180-192 - 2002
- [j10]Patricia Bouyer, Antoine Petit:
A Kleene/Büchi-like Theorem for Clock Languages. J. Autom. Lang. Comb. 7(2): 167-186 (2002) - 2001
- [b1]Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie:
Systems and Software Verification, Model-Checking Techniques and Tools. Springer 2001, ISBN 978-3-642-07478-3, pp. I-XII, 1-190 - [c23]Patricia Bouyer, Antoine Petit, Denis Thérien:
An Algebraic Characterization of Data and Timed Languages. CONCUR 2001: 248-261 - 2000
- [c22]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Are Timed Automata Updatable? CAV 2000: 464-479 - [c21]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Expressiveness of Updatable Timed Automata. MFCS 2000: 232-242 - [c20]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: 2449-2454
1990 – 1999
- 1999
- [c19]Patricia Bouyer, Antoine Petit:
Decomposition and Composition of Timed Automata. ICALP 1999: 210-219 - 1998
- [j9]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): 145-182 (1998) - [j8]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): 277-282 (1998) - [c18]Paul Gastin, Raphaël Meyer, Antoine Petit:
A (Non-elementary) Modular Decision Procedure for LTrL. MFCS 1998: 356-365 - [c17]Raphaël Meyer, Antoine Petit:
Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof. STACS 1998: 533-543 - 1997
- [j7]Bernadette Charron-Bost, Robert Cori, Antoine Petit:
Introduction à l'algorithmique des objets partagés. RAIRO Theor. Informatics Appl. 31(2): 97-148 (1997) - [c16]Raphaël Meyer, Antoine Petit:
Decomposition of TrPTL Formulas. MFCS 1997: 418-427 - [c15]Volker Diekert, Paul Gastin, Antoine Petit:
Removing epsilon-Transitions in Timed Automata. STACS 1997: 583-594 - 1996
- [c14]Béatrice Bérard, Paul Gastin, Antoine Petit:
On the Power of Non-Observable Actions in Timed Automata. STACS 1996: 257-268 - 1995
- [j6]Volker Diekert, Paul Gastin, Antoine Petit:
Rational and Recognizable Complex Trace Languages. Inf. Comput. 116(1): 134-153 (1995) - [c13]Volker Diekert, Paul Gastin, Antoine Petit:
Recent Developments in Trace Theory. Developments in Language Theory 1995: 373-385 - [c12]Sébastien Huguet, Antoine Petit:
Modular Constructions of Distributing Automata. MFCS 1995: 467-478 - [c11]Anne-Cécile Fabret, Antoine Petit:
On the Undecidability of Deadlock Detection in Families of Nets. STACS 1995: 479-490 - [p2]Paul Gastin, Antoine Petit:
Infinite Traces. The Book of Traces 1995: 393-486 - 1994
- [j5]Paul Gastin, Antoine Petit, Wieslaw Zielonka:
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. Theor. Comput. Sci. 125(2): 167-204 (1994) - 1993
- [j4]Antoine Petit:
Recognizable Trace Languages, Distributed Automata and the Distribution Problem. Acta Informatica 30(1): 89-101 (1993) - [c10]Christophe Cérin, Antoine Petit:
Speedup of Recognizable Trace Languages. MFCS 1993: 332-341 - 1992
- [j3]Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy:
Decidability of the Star Problem in A* x {b}*. Inf. Process. Lett. 44(2): 65-71 (1992) - [c9]Paul Gastin, Antoine Petit:
Asynchronous Cellular Automata for Infinite Traces. ICALP 1992: 583-594 - [c8]Paul Gastin, Antoine Petit:
Poset Properties of Complex Traces. MFCS 1992: 255-263 - [p1]Paul Gastin, Antoine Petit:
A survey of recognizable languages with infinite traces. Advances in Petri Nets: The DEMON Project 1992: 392-409 - 1991
- [c7]Paul Gastin, Antoine Petit, Wieslaw Zielonka:
A Kleene Theorem for Infinite Trace Languages. ICALP 1991: 254-266 - [c6]Volker Diekert, Paul Gastin, Antoine Petit:
Recognizable Complex Trace Languages. MFCS 1991: 131-140 - [c5]Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet:
Detection of Deadlocks in an Infinite Family of Nets. STACS 1991: 334-347 - 1990
- [j2]Antoine Petit:
Distribution and Synchronized Automata. Theor. Comput. Sci. 76(2-3): 285-308 (1990)
1980 – 1989
- 1989
- [c4]Antoine Petit:
Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract). MFCS 1989: 418-430 - [c3]Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet:
Syntactical Properties of Unbounded Nets of Processors. TAPSOFT, Vol.1 1989: 119-133 - 1988
- [c2]Joffroy Beauquier, Antoine Petit:
Distribution of Sequential Processes. MFCS 1988: 180-189 - 1987
- [j1]Luc Boasson, Antoine Petit:
Langages Algébriques Déterministes Non Générateurs. RAIRO Theor. Informatics Appl. 21(1): 41-57 (1987) - 1985
- [c1]Luc Boasson, Antoine Petit:
Deterministic Languages and Non-Generators. STACS 1985: 39-46
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
