Antoine Petit
Antoine Petit
Ens de Cachan
Verified email at ens-cachan.fr - Homepage
Title
Cited by
Cited by
Year
Systems and software verification: model-checking techniques and tools
B Bérard, M Bidoit, A Finkel, F Laroussinie, A Petit, L Petrucci, ...
Springer Science & Business Media, 2013
10802013
Characterization of the expressive power of silent transitions in timed automata
B Bérard, A Petit, V Diekert, P Gastin
Fundamenta Informaticae 36 (2, 3), 145-182, 1998
2051998
Towards the automatic verification of PLC programs written in Instruction List
G Canet, S Couffin, JJ Lesage, A Petit, P Schnoebelen
Smc 2000 conference proceedings. 2000 ieee international conference on …, 2000
1492000
Updatable timed automata
P Bouyer, C Dufourd, E Fleury, A Petit
Theoretical Computer Science 321 (2-3), 291-345, 2004
1262004
Are timed automata updatable?
P Bouyer, C Dufourd, E Fleury, A Petit
International Conference on Computer Aided Verification, 464-479, 2000
1132000
Timed control with partial observability
P Bouyer, D D’Souza, P Madhusudan, A Petit
International Conference on Computer Aided Verification, 180-192, 2003
982003
An algebraic approach to data languages and timed languages
P Bouyer, A Petit, D Thérien
Information and Computation 182 (2), 137-162, 2003
862003
Asynchronous cellular automata for infinite traces
P Gastin, A Petit
International Colloquium on Automata, Languages, and Programming, 583-594, 1992
631992
Expressiveness of updatable timed automata
P Bouyer, C Dufourd, E Fleury, A Petit
International Symposium on Mathematical Foundations of Computer Science, 232-242, 2000
612000
Infinite traces
P Gastin
LITP Spring School on Theoretical Computer Science, 277-308, 1990
601990
A Kleene/Büchi-like theorem for clock languages
P Bouyer, A Petit
Journal of Automata, Languages and Combinatorics 7 (2), 167-186, 2001
582001
Removing ε-transitions in timed automata
V Diekert, P Gastin, A Petit
Annual Symposium on Theoretical Aspects of Computer Science, 583-594, 1997
551997
On the power of non-observable actions in timed automata
B Bérard, P Gastin, A Petit
Annual Symposium on Theoretical Aspects of Computer Science, 255-268, 1996
521996
Decomposition and composition of timed automata
P Bouyer, A Petit
International Colloquium on Automata, Languages, and Programming, 210-219, 1999
491999
An algebraic characterization of data and timed languages
P Bouyer, A Petit, D Thérien
International Conference on Concurrency Theory, 248-261, 2001
372001
Analysing the PGM protocol with UPPAAL
B Bérard*, P Bouyer, A Petit
International journal of production research 42 (14), 2773-2791, 2004
302004
Schnoebelen Ph. McKenzie P. Systems and Software verification: model checking techniques and tools
B Bérard, M Bidoit, A Finkel, F Laroussinie, A Petit, L Petrucci
Springer, 2001
292001
Decidability of the Star problem in A∗×{b}∗
P Gastin, E Ochmanski, A Petit, B Rozoy
Information Processing Letters 44 (2), 65-71, 1992
251992
An extension of Kleene's and Ochmański's theorems to infinite traces
P Gastin, A Petit, W Zielonka
Theoretical Computer Science 125 (2), 167-204, 1994
241994
Rational and recognizable complex trace languages
V Diekert, P Gastin, A Petit
Information and Computation 116 (1), 134-153, 1995
231995
The system can't perform the operation now. Try again later.
Articles 1–20