Thierry Jéron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Thierry Jéron has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
Hervé Marchand
16 shared publications- Srinivas Pinisetty
Indian Institute of Technology Bhubaneswar, Bhubaneswar, India
12 shared publications Claude Jard
ENS Cachan, Campus de Ker Lann, Bruz, France
9 shared publicationsVlad Rusu
9 shared publications- Nicolas Markey
University of Rennes, Inria, CNRS, IRISA
7 shared publications - Hervé Marchand
INRIA
5 shared publications
Latest Publications
- Open Access
- 25 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Compositional Security Enforcement of Timed Properties for Cyber Physical Systems
Many cyber-physical systems (CPSs) used in industries are built on the reactive system architecture. This makes CPSs more flexible and loosely coupled - making them amenable to change and updates. Maintaining the safety and security of a frequently evolving CPS becomes tedious. There has been a recent advancement in incremental security of CPS using the runtime enforcement (RE) approach, where safety and security properties specified as automata can be incrementally patched with the system as it evolves. In the existing approach, two or more enforcers are composed serially, and a new property to be enforced can easily be plugged into the series of enforcers, without affecting the previously enforced properties. The existing frameworks are restricted to untimed safety properties on Boolean input-output channels. However, most CPSs’ input-output channels are valued and encounter timing constraints, which need to be captured by the desired properties to be enforced. In this work, we thus propose a theory of runtime enforcement for properties modelled as Valued-Discrete-Timed-Automata (VDTA), a timed automaton model with valued input and output channels. We define the problem for one single property and develop an RE framework for any safety property modelled as VDTA. We further extend it to a serial compositional framework and exhibit the conditions of its correctness. We then define the enforcement problem for general regular properties modelled as VDTA, show how it reduces to the enforcement of safety properties, and explain the serial composition of their enforcers. This serial composition has a reasonable execution time overhead, as demonstrated by the implementation of the suggested framework and the evaluation of its performance using a few sample scenarios.
- 25 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Open AccessCompositional Security Enforcement of Timed Properties for Cyber Physical Systems
Many cyber-physical systems (CPSs) used in industries are built on the reactive system architecture. This makes CPSs more flexible and loosely coupled - making them amenable to change and updates. Maintaining the safety and security of a frequently evolving CPS becomes tedious. There has been a recent advancement in incremental security of CPS using the runtime enforcement (RE) approach, where safety and security properties specified as automata can be incrementally patched with the system as it evolves. In the existing approach, two or more enforcers are composed serially, and a new property to be enforced can easily be plugged into the series of enforcers, without affecting the previously enforced properties. The existing frameworks are restricted to untimed safety properties on Boolean input-output channels. However, most CPSs’ input-output channels are valued and encounter timing constraints, which need to be captured by the desired properties to be enforced. In this work, we thus propose a theory of runtime enforcement for properties modelled as Valued-Discrete-Timed-Automata (VDTA), a timed automaton model with valued input and output channels. We define the problem for one single property and develop an RE framework for any safety property modelled as VDTA. We further extend it to a serial compositional framework and exhibit the conditions of its correctness. We then define the enforcement problem for general regular properties modelled as VDTA, show how it reduces to the enforcement of safety properties, and explain the serial composition of their enforcers. This serial composition has a reasonable execution time overhead, as demonstrated by the implementation of the suggested framework and the evaluation of its performance using a few sample scenarios.
- Open Access
- 19 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Advancements in Runtime Enforcement Frameworks for Reactive Systems
- 19 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessAdvancements in Runtime Enforcement Frameworks for Reactive Systems
- 11 June 2025
- Published by Springer Nature
- p. 134-153
Towards Efficient Verification of Parallel Applications with Mc SimGrid
- 11 June 2025
- Published by Springer Nature
- p. 134-153
Towards Efficient Verification of Parallel Applications with Mc SimGrid
- Open Access
Towards Efficient Verification of Parallel Applications with Mc SimGrid
Assessing the correctness of distributed and parallel applications is notoriously difficult due to the complexity of the concurrent behaviors and the difficulty to reproduce bugs. In this context, Dynamic Partial Order Reduction (DPOR) techniques have proved successful in exploiting concurrency to verify applications without exploring all their behaviors. However, they may lack of efficiency when tracking non-systematic bugs of real size applications. In this paper, we suggest two adaptations of the Optimal Dynamic Partial Order Reduction (ODPOR) algorithm with a particular focus on bug finding and explanation. The first adaptation is an out-of-order version called RFS ODPOR which avoids being stuck in uninteresting large parts of the state space. Once a bug is found, the second adaptation takes advantage of ODPOR principles to efficiently find the origins of the bug.
Open AccessTowards Efficient Verification of Parallel Applications with Mc SimGrid
Assessing the correctness of distributed and parallel applications is notoriously difficult due to the complexity of the concurrent behaviors and the difficulty to reproduce bugs. In this context, Dynamic Partial Order Reduction (DPOR) techniques have proved successful in exploiting concurrency to verify applications without exploring all their behaviors. However, they may lack of efficiency when tracking non-systematic bugs of real size applications. In this paper, we suggest two adaptations of the Optimal Dynamic Partial Order Reduction (ODPOR) algorithm with a particular focus on bug finding and explanation. The first adaptation is an out-of-order version called RFS ODPOR which avoids being stuck in uninteresting large parts of the state space. Once a bug is found, the second adaptation takes advantage of ODPOR principles to efficiently find the origins of the bug.
- 25 August 2020
- Published by Springer Nature
- p. 111-126
Computing Maximally-Permissive Strategies in Acyclic Timed Automata
- 25 August 2020
- Published by Springer Nature
- p. 111-126
Computing Maximally-Permissive Strategies in Acyclic Timed Automata
- 25 August 2020
- Published by Springer Nature
- p. 249-264
Incremental Methods for Checking Real-Time Consistency
- 25 August 2020
- Published by Springer Nature
- p. 249-264
Incremental Methods for Checking Real-Time Consistency
- 25 August 2020
- Published by Springer Nature
- p. 144-160
Active Learning of Timed Automata with Unobservable Resets
- 25 August 2020
- Published by Springer Nature
- p. 144-160
Active Learning of Timed Automata with Unobservable Resets