Publications : Antoine PETIT
-
[BP09]
-
P. Bouyer and A. Petit.
On extensions of timed automata.
In Perspectives in Concurrency Theory, IARCS-Universities, pages
35--63. Universities Press, January 2009.
[ BibTex ]
-
[BGP07]
-
B. Bérard, P. Gastin, and A. Petit.
Timed substitutions for regular signal-event languages.
Formal Methods in System Design, 31(2):101--134, October 2007.
doi:
10.1007/s10703-007-0034-5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BGP06b]
-
B. Bérard, P. Gastin, and A. Petit.
Refinements and abstractions of signal-event (timed) languages.
In Proceedings of the 4th International Conference on Formal
Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202
of Lecture Notes in Computer Science, pages 67--81, Paris, France, September
2006. Springer.
doi:
10.1007/11867340_6.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BGP06a]
-
B. Bérard, P. Gastin, and A. Petit.
Intersection of regular signal-event (timed) languages.
In Proceedings of the 4th International Conference on Formal
Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202
of Lecture Notes in Computer Science, pages 52--66, Paris, France, September
2006. Springer.
doi:
10.1007/11867340_5.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BDFP04]
-
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit.
Updatable Timed Automata.
Theoretical Computer Science, 321(2-3):291--345, August 2004.
doi:
10.1016/j.tcs.2004.04.003.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BBP04]
-
B. Bérard, P. Bouyer, and A. Petit.
Analysing the PGM Protocol with Uppaal.
International Journal of Production Research, 42(14):2773--2791, July
2004.
[ BibTex |
Web page |
PS |
PDF ]
-
[BPP04]
-
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.
[ BibTex |
Web page |
PS ]
-
[BBP03]
-
B. Bérard, P. Bouyer, and A. Petit.
Une analyse du protocole PGM avec UPPAAL.
In Actes du 4ème Colloque sur la Modélisation des
Systèmes Réactifs (MSR'03), pages 415--430, Metz, France,
October 2003. Hermès.
[ BibTex |
Web page |
PS ]
-
[BDMP03]
-
P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit.
Timed Control with Partial Observability.
In Proceedings of the 15th International Conference on
Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in
Computer Science, pages 180--192, Boulder, Colorado, USA, July 2003.
Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[BPT03]
-
P. Bouyer, A. Petit, and D. Thérien.
An Algebraic Approach to Data Languages and Timed Languages.
Information and Computation, 182(2):137--162, May 2003.
[ BibTex |
Web page |
PS |
PDF ]
-
[BBP02]
-
B. Bérard, P. Bouyer, and A. Petit.
Analysing the PGM Protocol with UPPAAL.
In Proceedings of the 2nd Workshop on Real-Time Tools
(RT-TOOLS'02), Copenhagen, Denmark, August 2002. Uppsala University.
[ BibTex |
Web page |
PS ]
-
[BP02]
-
P. Bouyer and A. Petit.
A KleeneashBüchi-like Theorem for Clock Languages.
Journal of Automata, Languages and Combinatorics, 7(2):167--186,
2002.
[ BibTex |
Web page |
PS ]
-
[BBP01]
-
B. Bérard, P. Bouyer, and A. Petit.
Modélisation du protocole PGM et de certaines de ses
propriétés en UPPAAL.
Contract Report 4.4, projet RNRT Calife, November 2001.
18 pages.
[ BibTex ]
-
[BPT01]
-
P. Bouyer, A. Petit, and D. Thérien.
An Algebraic Characterization of Data and Timed Languages.
In Proceedings of the 12th International Conference on
Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in
Computer Science, pages 248--261, Aalborg, Denmark, August 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[Pet01]
-
A. Petit.
About Extensions of Timed Automata.
Invited talk, 8th International Workshop on Expressiveness in
Concurrency (EXPRESS'01), Aalborg, Denmark, August 2001.
[ BibTex ]
-
[BBF+01]
-
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.
[ BibTex |
Web page ]
-
[BBD+01]
-
É. Badouel, S. Boucheron, A. Dicky, A. Petit, M. Santha,
P. Weil, and M. Zeitoun.
Problèmes d'informatique fondamentale, volume 13 of Scopos.
Springer, 2001.
[ BibTex |
Web page ]
-
[CCL+00]
-
G. Canet, S. Couffin, J.-J. Lesage, A. Petit, and
Ph. Schnoebelen.
Towards the Automatic Verification of PLC Programs Written in
Instruction List.
In Proceedings of the IEEE International Conference on
Systems, Man and Cybernetics (SMC 2000), pages 2449--2454, Nashville,
Tennessee, USA, October 2000. Argos Press.
doi:
10.1109/ICSMC.2000.884359.
[ BibTex |
DOI |
Web page |
PS ]
-
[BDFP00b]
-
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit.
Expressiveness of Updatable Timed Automata.
In Proceedings of the 25th International Symposium on
Mathematical Foundations of Computer Science (MFCS 2000), volume
1893 of Lecture Notes in Computer Science, pages 232--242, Bratislava,
Slovakia, August 2000. Springer.
[ BibTex |
Web page |
PS ]
-
[BDFP00a]
-
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit.
Are Timed Automata Updatable?
In Proceedings of the 12th International Conference on
Computer Aided Verification (CAV 2000), volume 1855 of Lecture Notes
in Computer Science, pages 464--479, Chicago, Illinois, USA, July 2000.
Springer.
[ BibTex |
Web page |
PS ]
-
[CDP+00]
-
G. Canet, B. Denis, A. Petit, O. Rossi, and
Ph. Schnoebelen.
Un cadre pour la vérification automatique de
programmes IL.
In Actes de la 1ère Conférence Internationale
Francophone d'Automatique (CIFA 2000), pages 693--698, Lille, France,
July 2000. Union des Chercheurs Ingénieurs et Scientifiques, Villeneuve
d'Ascq, France.
[ BibTex |
Web page |
PS ]
-
[BCF+00]
-
B. Bérard, P. Castéran, E. Fleury, L. Fribourg, J.-F.
Monin, Ch. Paulin, A. Petit, and D. Rouillard.
Document de spécification du modèle commun.
Fourniture 1.1 du projet RNRT Calife, April 2000.
[ BibTex ]
-
[BFP00]
-
P. Bouyer, E. Fleury, and A. Petit.
Document de synthèse sur les procédures de
vérification des systèmes temps réel : Les automates
temporisés.
Fourniture 4.2 du projet RNRT Calife, January 2000.
[ BibTex ]
-
[BP99]
-
P. Bouyer and A. Petit.
Decomposition and Composition of Timed Automata.
In Proceedings of the 26th International Colloquium on
Automata, Languages and Programming (ICALP'99), volume 1644 of
Lecture Notes in Computer Science, pages 210--219, Prague, Czech Republic,
July 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[SBB+99]
-
Ph. Schnoebelen, B. Bérard, M. Bidoit,
F. Laroussinie, and A. Petit.
Vérification de logiciels : techniques et outils du
model-checking.
Vuibert, April 1999.
[ BibTex |
Web page ]
-
[BDGP98]
-
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):145--182, November 1998.
[ BibTex |
Web page |
PS ]
-
[Pet98]
-
A. Petit.
Le model-checking, une technique de vérification en plein
essor. Introduction.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[LPS98]
-
F. Laroussinie, A. Petit, and Ph. Schnoebelen.
Le model-checking, une technique de vérification en plein
essor. I --- Principes et techniques.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[BCD+98]
-
B. Bérard, G. Cécé, C. Dufourd, A. Finkel,
F. Laroussinie, A. Petit, Ph. Schnoebelen, and G. Sutre.
Le model-checking, une technique de vérification en plein
essor. II --- Quelques outils.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[GMPW98]
-
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):277--282, September 1998.
[ BibTex |
Web page |
PS ]
-
[GMP98]
-
P. Gastin, R. Meyer, and A. Petit.
A (non-elementary) modular decision procedure for LTrL.
In Proceedings of the 23rd International Symposium on
Mathematical Foundations of Computer Science (MFCS'98), volume 1450
of Lecture Notes in Computer Science, pages 356--365, Brno, Czech Republic,
August 1998. Springer.
[ BibTex |
Web page |
PS ]
-
[AGP+98]
-
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, June 1998.
[ BibTex ]
-
[MP98]
-
R. Meyer and A. Petit.
Expressive Completeness of LTrL on Finite Traces: An
Algebraic Proof.
In Proceedings of the 15th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes
in Computer Science, pages 533--543, Paris, France, February 1998. Springer.
[ BibTex ]
-
[BBP98]
-
B. Bérard, M. Bidoit, and A. Petit.
Recommandations sur le cahier des charges SRC.
Contract report, EDF/DER/MOS - LSV, 1998.
[ BibTex ]
-
[CP98]
-
Ch. Cérin and A. Petit.
Application of Algebraic Techniques to Compute the Efficiency
Measure for Multithreaded Architecture.
In Proceedings of the Workshop on Multithreaded Execution,
Architecture and Compilation (MTEAC'98), Las Vegas, Nevada, USA,
January 1998.
[ BibTex |
Web page |
PS ]
-
[MP97]
-
R. Meyer and A. Petit.
Decomposition of TrPTL Formulas.
In Proceedings of the 22nd International Symposium on
Mathematical Foundations of Computer Science (MFCS'97), volume 1295
of Lecture Notes in Computer Science, pages 418--427, Bratislava, Slovakia,
August 1997. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[DGP97]
-
V. Diekert, P. Gastin, and A. Petit.
Removing ε-Transitions in Timed Automata.
In Proceedings of the 14th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'97), volume 1200 of Lecture Notes
in Computer Science, pages 583--594, Lübeck, Germany, February 1997.
Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[CCP97]
-
B. Charron-Bost, R. Cori, and A. Petit.
Introduction à l'algorithmique en mémoire partagée.
RAIRO Informatique Théorique et Applications, 31(2):97--148,
1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[BCK+97]
-
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, January 1997.
[ BibTex ]
-
[BGP96]
-
B. Bérard, P. Gastin, and A. Petit.
On the Power of Non-Observable Actions in Timed Automata.
In Proceedings of the 13th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'96), volume 1046 of Lecture Notes
in Computer Science, pages 257--268, Grenoble, France, February 1996.
Springer.
[ BibTex |
Web page |
PS ]
-
[DGP96]
-
V. Diekert, P. Gastin, and A. Petit.
Recent Developments in Trace Theory.
In Proceedings of the 2nd International Conference on
Developments in Language Theory (DLT'95), pages 373--385, Magdeburg,
Germany, 1996. World Scientific.
[ BibTex |
Web page |
PS ]
-
[HP95]
-
S. Huguet and A. Petit.
Modular Constructions of Distributing Automata.
In Proceedings of the 20th International Symposium on
Mathematical Foundations of Computer Science (MFCS'95), volume 969
of Lecture Notes in Computer Science, pages 467--478, Prague, Czech Republic,
August 1995. Springer.
[ BibTex ]
-
[FP95]
-
A.-C. Fabret and A. Petit.
On the Undecidability of Deadlock Detection in Families of
Nets.
In Proceedings of the 12th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'95), volume 900 of Lecture Notes
in Computer Science, pages 479--490, Munich, Germany, March 1995. Springer.
[ BibTex ]
-
[GP95]
-
P. Gastin and A. Petit.
Infinite traces.
In The Book of Traces, chapter 11, pages 393--486. World Scientific,
1995.
[ BibTex ]
-
[DGP95]
-
V. Diekert, P. Gastin, and A. Petit.
Rational and Recognizable Complex Trace Languages.
Information and Computation, 116(1):134--153, January 1995.
[ BibTex |
Web page |
PS ]
-
[GPZ94]
-
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):167--204, March 1994.
[ BibTex |
Web page |
PS ]
-
[CP93]
-
Ch. Cérin and A. Petit.
Speed-Up of Recognizable Trace Languages.
In Proceedings of the 18th International Symposium on
Mathematical Foundations of Computer Science (MFCS'93), volume 711
of Lecture Notes in Computer Science, pages 332--341, Gdansk, Poland, August
1993. Springer-Verlag.
[ BibTex ]
-
[Pet93b]
-
A. Petit.
Recognizable Trace Languages, Distributed Automata and the
Distribution Problem.
Acta Informatica, 30(1):89--101, January 1993.
[ BibTex ]
-
[Pet93a]
-
A. Petit.
Mémoire d'habilitation à diriger des recherches.
Mémoire d'habilitation, Université Paris-Sud 11, Orsay,
France, 1993.
[ BibTex ]
-
[GOPR92]
-
P. Gastin, E. Ochmański, A. Petit, and B. Rozoy.
Decidability of the star problem in
A^*×{b}^*.
Information Processing Letters, 44(2):65--71, November 1992.
[ BibTex |
Web page |
PS ]
-
[GP92b]
-
P. Gastin and A. Petit.
PoSet properties of complex traces.
In Proceedings of the 17th International Symposium on
Mathematical Foundations of Computer Science (MFCS'92), volume 629
of Lecture Notes in Computer Science, pages 255--263, Prague, Czechoslovakia,
August 1992. Springer-Verlag.
[ BibTex |
Web page |
PS ]
-
[GP92a]
-
P. Gastin and A. Petit.
Asynchronous Cellular Automata for Infinite Traces.
In Proceedings of the 19th International Colloquium on
Automata, Languages and Programming (ICALP'92), volume 623 of Lecture
Notes in Computer Science, pages 583--594, Vienna, Austria, July 1992.
Springer-Verlag.
[ BibTex |
Web page |
PS ]
-
[PP92]
-
G. Paun and A. Petit.
Generalized Reduced Languages.
Studii Si Cercetări Matematice, 44(4):309--318, 1992.
[ BibTex ]
-
[GP92c]
-
P. Gastin and A. Petit.
A Survey of Recognizable Languages of Infinite Traces.
In Advances in Petri Nets 1992: The DEMON Project, volume
609 of Lecture Notes in Computer Science, pages 392--409. Springer-Verlag,
1992.
[ BibTex |
Web page |
PS ]
-
[DGP91]
-
V. Diekert, P. Gastin, and A. Petit.
Recognizable Complex Trace Languages.
In Proceedings of the 16th International Symposium on
Mathematical Foundations of Computer Science (MFCS'91), volume 520
of Lecture Notes in Computer Science, pages 131--140, Kazimierz Dolny,
Poland, September 1991. Springer-Verlag.
[ BibTex |
Web page |
PS ]
-
[GPZ91]
-
P. Gastin, A. Petit, and W. Zielonka.
A Kleene Theorem for Infinite Trace Languages.
In Proceedings of the 18th International Colloquium on
Automata, Languages and Programming (ICALP'91), volume 510 of Lecture
Notes in Computer Science, pages 254--266, Madrid, Spain, July 1991.
Springer-Verlag.
[ BibTex |
Web page |
PS ]
-
[BCPVN91]
-
J. Beauquier, A. Choquet, A. Petit, and G. Vidal-Naquet.
Detection of Deadlocks in an Infinite Family of Nets.
In Proceedings of the 8th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'91), volume 480 of Lecture Notes
in Computer Science, pages 334--347, Hamburg, Germany, February 1991.
Springer-Verlag.
[ BibTex ]
This file was generated by
bibtex2html 1.98.