Antoine Petit
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Antoine Petit has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Patricia Bouyer
Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles
2 shared publications Béatrice
1 shared publicationBérard
1 shared publication- Catherine Dufourd
EDF-R&D-Dépt. OSIRIS-1, Av. du Général de Gaulle, 92141 Clamart Cedex, France
1 shared publication - Denis Thérien
School of Computer Science, McGill University, 3480 rue University, Montréal, Québec, H3A 2A7, Canada
1 shared publication - Emmanuel Fleury
BRICS, Aalborg University, Fredrik Bajers Vej 7, 9220 Aalborg Ø, Denmark
1 shared publication
Latest Publications
- Open Access
- 1 May 2004
- Published by Elsevier in Theoretical Computer Science
Updatable timed automata*1
- 1 May 2004
- Published by Elsevier in Theoretical Computer Science
Open AccessUpdatable timed automata*1
- 1 May 2003
- Published by Elsevier in Information and Computation
- Vol. 182 (2) , 137-162
An algebraic approach to data languages and timed languages
- 1 May 2003
- Published by Elsevier in Information and Computation
- Vol. 182 (2) , 137-162
An algebraic approach to data languages and timed languages
- 1 January 1998
- Published by Springer Nature
- p. 356-365
A (non-elementary) modular decision procedure for LTrL
- 1 January 1998
- Published by Springer Nature
- p. 356-365
A (non-elementary) modular decision procedure for LTrL
- 1 January 1998
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 36 (2-3) , 145-182
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Timed automata are among the most widely studied models for real-time systems. Silent transitions, i.e., ϵ-transitions, have already been proposed in the original paper on timed automata by Alur and Dill [3]. We show that the class TLϵ of timed languages recognized by automata with ϵ-transitions, is more robust and more expressive than the corresponding class TL without ϵ-transitions. We then focus on ϵ-transitions without reset, i.e. ϵ-transitions which do not reset clocks. We propose an algorithm to construct, given a timed automaton, an equivalent one without such transitions. This algorithm is in two steps, it first suppresses the cycles of ϵ-transitions without reset and then the remaining ones. Then, we prove that a timed automaton such that no ϵ-transition which resets clocks lies on any directed cycle, can be effectively transformed into a timed automaton without ϵtransitions. Interestingly, this main result holds under the assumption of non-Zenoness and it is false otherwise. To complete the picture, we exhibit a simple timed automaton with an ϵ-transition, which resets some clock, on a cycle and which is not equivalent to any ϵ-free timed automaton. To show this, we develop a promising new technique based on the notion of precise action. This paper presents a synthesis of the two conference communications [9] and [13].
- 1 January 1998
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 36 (2-3) , 145-182
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Timed automata are among the most widely studied models for real-time systems. Silent transitions, i.e., ϵ-transitions, have already been proposed in the original paper on timed automata by Alur and Dill [3]. We show that the class TLϵ of timed languages recognized by automata with ϵ-transitions, is more robust and more expressive than the corresponding class TL without ϵ-transitions. We then focus on ϵ-transitions without reset, i.e. ϵ-transitions which do not reset clocks. We propose an algorithm to construct, given a timed automaton, an equivalent one without such transitions. This algorithm is in two steps, it first suppresses the cycles of ϵ-transitions without reset and then the remaining ones. Then, we prove that a timed automaton such that no ϵ-transition which resets clocks lies on any directed cycle, can be effectively transformed into a timed automaton without ϵtransitions. Interestingly, this main result holds under the assumption of non-Zenoness and it is false otherwise. To complete the picture, we exhibit a simple timed automaton with an ϵ-transition, which resets some clock, on a cycle and which is not equivalent to any ϵ-free timed automaton. To show this, we develop a promising new technique based on the notion of precise action. This paper presents a synthesis of the two conference communications [9] and [13].