Selected publications by Antoine Petit
Books
-
É. Badouel, S. Boucheron, A. Dicky, A. Petit, M. Santha, P. Weil and M. Zeitoun. Problèmes d'informatique fondamentale, Scopos 13. Springer, 2001. ( Web page | BibTeX )
-
B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci and Ph. Schnoebelen. Systems and Software Verification. Model-Checking Techniques and
Tools. Springer, 2001. ( Web page | BibTeX )
-
Ph. Schnoebelen, B. Bérard, M. Bidoit, F. Laroussinie and A. Petit. Vérification de logiciels : techniques et outils du
model-checking. Vuibert, 1999. ( Web page | BibTeX )
-
L. Albert, P. Gastin, B. Petazzoni, A. Petit, N. Puech and P. Weil. Cours et exercices d'informatique, Classes préparatoires, premier
et second cycles universitaires. Vuibert, 1998. ( BibTeX )
-
J.-C. Bajard, H. Comon, C. Kenyon, D. Krob, M. Morvan, J.-M. Muller, A. Petit and Y. Robert. Exercices d'algorithmique (oraux d'ENS). Vuibert, 1997. ( BibTeX )
Chapters in Books
Journals
-
B. Bérard, P. Gastin and A. Petit. Timed substitutions for regular signal-event languages. Formal Methods in System Design 31(2), pages 101-134, 2007. ( PDF | BibTeX + Abstract )
-
P. Bouyer, C. Dufourd, E. Fleury and A. Petit. Updatable Timed Automata. Theoretical Computer Science 321(2-3), pages 291-345, 2004. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
B. Bérard, P. Bouyer and A. Petit. Analysing the PGM Protocol with Uppaal. International Journal of Production Research 42(14), pages 2773-2791, 2004. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer, A. Petit and D. Thérien. An Algebraic Approach to Data Languages and Timed Languages. Information and Computation 182(2), pages 137-162, 2003. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer and A. Petit. A Kleene/Büchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics 7(2), pages 167-186, 2002. ( PS | PS.GZ | BibTeX + Abstract )
-
B. Bérard, V. Diekert, P. Gastin and A. Petit. Characterization of the Expressive Power of Silent Transitions in Timed
Automata. Fundamenta Informaticae 36(2), pages 145-182, 1998. ( PS | PS.GZ | BibTeX + Abstract )
-
G. Guaiana, R. Meyer, A. Petit and P. Weil. An Extension of the Wreath Product Principle for Finite Mazurkiewicz
Traces. Information Processing Letters 67(6), pages 277-282, 1998. ( PS | PS.GZ | BibTeX )
-
B. Charron-Bost, R. Cori and A. Petit. Introduction à l'algorithmique en mémoire partagée. RAIRO Informatique Théorique et Applications 31(2), pages 97-148, 1997. ( PS | PS.GZ | BibTeX )
-
V. Diekert, P. Gastin and A. Petit. Rational and Recognizable Complex Trace Languages. Information and Computation 116(1), pages 134-153, 1995. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Gastin, A. Petit and W. Zielonka. An Extension of Kleene's and Ochmański's Theorems to Infinite
Traces. Theoretical Computer Science 125(2), pages 167-204, 1994. ( PS | PS.GZ | BibTeX + Abstract )
-
A. Petit. Recognizable Trace Languages, Distributed Automata and the Distribution
Problem. Acta Informatica 30(1), pages 89-101, 1993. ( BibTeX )
-
G. Paun and A. Petit. Generalized Reduced Languages. Studii Si Cercetări Matematice 44(4), pages 309-318, 1992. ( BibTeX )
-
P. Gastin, E. Ochmański, A. Petit and B. Rozoy. Decidability of the star problem in A* × {b}*. Information Processing Letters 44(2), pages 65-71, 1992. ( PS | PS.GZ | BibTeX + Abstract )
Conferences
-
B. Bérard, P. Gastin and A. Petit. Refinements and abstractions of signal-event (timed) languages. In FORMATS'06, LNCS 4202, pages 67-81. Springer, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
B. Bérard, P. Gastin and A. Petit. Intersection of regular signal-event (timed) languages. In FORMATS'06, LNCS 4202, pages 52-66. Springer, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer, D. D'Souza, P. Madhusudan and A. Petit. Timed Control with Partial Observability. In CAV'03, LNCS 2725, pages 180-192. Springer, 2003. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer, A. Petit and D. Thérien. An Algebraic Characterization of Data and Timed Languages. In CONCUR'01, LNCS 2154, pages 248-261. Springer, 2001. ( PS | PS.GZ | BibTeX + Abstract )
-
G. Canet, S. Couffin, J.-J. Lesage, A. Petit and Ph. Schnoebelen. Towards the Automatic Verification of PLC Programs Written in
Instruction List. In SMC 2000, pages 2449-2454. Argos Press, 2000. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer, C. Dufourd, E. Fleury and A. Petit. Expressiveness of Updatable Timed Automata. In MFCS 2000, LNCS 1893, pages 232-242. Springer, 2000. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer, C. Dufourd, E. Fleury and A. Petit. Are Timed Automata Updatable? In CAV 2000, LNCS 1855, pages 464-479. Springer, 2000. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Bouyer and A. Petit. Decomposition and Composition of Timed Automata. In ICALP'99, LNCS 1644, pages 210-219. Springer, 1999. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Gastin, R. Meyer and A. Petit. A (non-elementary) modular decision procedure for LTrL. In MFCS'98, LNCS 1450, pages 356-365. Springer, 1998. ( PS | PS.GZ | BibTeX + Abstract )
-
R. Meyer and A. Petit. Expressive Completeness of LTrL on Finite Traces: An Algebraic
Proof. In STACS'98, LNCS 1373, pages 533-543. Springer, 1998. ( BibTeX )
-
R. Meyer and A. Petit. Decomposition of TrPTL Formulas. In MFCS'97, LNCS 1295, pages 418-427. Springer, 1997. ( PS | PS.GZ | BibTeX )
-
V. Diekert, P. Gastin and A. Petit. Removing ε-Transitions in Timed Automata. In STACS'97, LNCS 1200, pages 583-594. Springer, 1997. ( PS | PS.GZ | BibTeX + Abstract )
-
V. Diekert, P. Gastin and A. Petit. Recent Developments in Trace Theory. In DLT'95, pages 373-385. World Scientific, 1996. ( PS | PS.GZ | BibTeX + Abstract )
-
B. Bérard, P. Gastin and A. Petit. On the Power of Non-Observable Actions in Timed Automata. In STACS'96, LNCS 1046, pages 257-268. Springer, 1996. ( PS | PS.GZ | BibTeX + Abstract )
-
S. Huguet and A. Petit. Modular Constructions of Distributing Automata. In MFCS'95, LNCS 969, pages 467-478. Springer, 1995. ( BibTeX )
-
A.-C. Fabret and A. Petit. On the Undecidability of Deadlock Detection in Families of Nets. In STACS'95, LNCS 900, pages 479-490. Springer, 1995. ( BibTeX )
-
Ch. Cérin and A. Petit. Speed-Up of Recognizable Trace Languages. In MFCS'93, LNCS 711, pages 332-341. Springer-Verlag, 1993. ( BibTeX )
-
P. Gastin and A. Petit. A Survey of Recognizable Languages of Infinite Traces. In Advances in Petri Nets 1992: The DEMON Project, LNCS 609, pages 392-409. Springer-Verlag, 1992. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Gastin and A. Petit. PoSet properties of complex traces. In MFCS'92, LNCS 629, pages 255-263. Springer-Verlag, 1992. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Gastin and A. Petit. Asynchronous Cellular Automata for Infinite Traces. In ICALP'92, LNCS 623, pages 583-594. Springer-Verlag, 1992. ( PS | PS.GZ | BibTeX + Abstract )
-
V. Diekert, P. Gastin and A. Petit. Recognizable Complex Trace Languages. In MFCS'91, LNCS 520, pages 131-140. Springer-Verlag, 1991. ( PS | PS.GZ | BibTeX + Abstract )
-
P. Gastin, A. Petit and W. Zielonka. A Kleene Theorem for Infinite Trace Languages. In ICALP'91, LNCS 510, pages 254-266. Springer-Verlag, 1991. ( PS | PS.GZ | BibTeX + Abstract )
-
J. Beauquier, A. Choquet, A. Petit and G. Vidal-Naquet. Detection of Deadlocks in an Infinite Family of Nets. In STACS'91, LNCS 480, pages 334-347. Springer-Verlag, 1991. ( BibTeX )
Theses
-
A. Petit. Mémoire d'habilitation à diriger des recherches. Mémoire d'habilitation, Université Paris-Sud 11, Orsay, France, 1993. ( BibTeX )
Other Publications
-
M. Baclet, R. Pacalet and A. Petit. Register Transfer Level Simulation. Research Report LSV-04-10, Laboratoire Spécification et Vérification, ENS Cachan,
France, May 2004. 15 pages. ( PS | PS.GZ | BibTeX )
-
B. Bérard, P. Bouyer and A. Petit. Une analyse du protocole PGM avec UPPAAL. In MSR'03, pages 415-430. Hermès, 2003. ( PS | PS.GZ | BibTeX + Abstract )
-
B. Bérard, P. Bouyer and A. Petit. Analysing the PGM Protocol with UPPAAL. In RT-TOOLS'02. Uppsala University, 2002. Published as Technical Report 2002-025, Department of Information Technology,
Uppsala University, Sweden. ( PS | PS.GZ | BibTeX + Abstract )
-
G. Canet, B. Denis, A. Petit, O. Rossi and Ph. Schnoebelen. Un cadre pour la vérification automatique de programmes IL. In CIFA 2000, pages 693-698. Union des Chercheurs Ingénieurs et Scientifiques,
Villeneuve d'Ascq, France, 2000. ( PS | PS.GZ | BibTeX )
-
Ch. Cérin and A. Petit. Application of Algebraic Techniques to Compute the Efficiency Measure
for Multithreaded Architecture. In MTEAC'98. 1998. Published as Proceedings published as Technical Report CS-98-102, Colorado
State University. ( PS | PS.GZ | BibTeX )