• the modeling with weighted Petri nets and their various extensions : time/d, stochastic ... ;
  
  
• the modeling with automata and their timed extensions ;
  
  
• the design of efficient sufficient conditions ensuring qualitatives properties that are fundamental for numerous real systems such as embedded systems ; I tackle problems that  are often expspace-hard, while the sufficient conditions are ensured in polynomial time and apply to a large amount of cases ;
  
  
• the scheduling of timed systems and the analysis of their performance, typically via the model of weighted Petri nets ;
  
  
• the temporal logics, in relation to abstraction and classification techniques ;
  
  
• the simulation of systems.

Formerly,  I was:

• a post-doctoral researcher at ONERA Toulouse, DTIS, team Embedded, autonomous and safe systems – 2018
  
  
• an assistant professor in Germany at Oldenburg University, Department of Computing science, team Parallel systems – Oct. 2015 to Sept. 2017
  
  
• an ATER (assistant professor) at Paris 7 University, IRIF – Oct. 2014 to Aug. 2015.
  
  
  

PhD thesis

Contribution to the study of generalized Petri nets  

Paris 6 University, LIP6, October 2014

Supervisors:
                       Alix Munier-Kordon         LIP6, Univ. Paris 6
                       Jean-Marc Delosme       IBISC, Univ. Evry-val-d'Essonne

Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. Fundamenta Informaticae 2019, 30 pages,
with Raymond Devillers.

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. TopNoc 2019, accepted, 21 pages,
with Raymond Devillers and Evgeny Erofeev.


Sufficient conditions for the marked graph realisability of labelled transition systems. Theoretical Computer Science 2018: 750: p. 101-116 
with Eike Best and Harro Wimmel
Final version: https://www.sciencedirect.com/science/article/pii/S0304397517307181


On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets. Fundamenta Informaticae 2018: 161(4): p. 383-421 
with Raymond Devillers
Final version: https://content.iospress.com/articles/fundamenta-informaticae/fi1708


On Liveness and Reversibility of Equal-Conflict Petri Nets. Fundamenta Informaticae 2016: 146(1):  p. 83-119  
with Jean-Marc Delosme and Alix Munier-Kordon
Final version: https://content.iospress.com/articles/fundamenta-informaticae/fi1376


Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets. TECS 2014: 141: p. 1-25  
with Jean-Marc Delosme and Alix Munier-Kordon
Final version: https://dl.acm.org/citation.cfm?doid=2601432.2627349



International peer-reviewed conferences:

Synthesis of Weighted Marked Graphs from CIrcular Labelled Transition Systems. ATAED@Petri Nets/ACSD 2019: p. 6-22 
with Raymond Devillers and Evgeny Erofeev.


Analysis and Synthesis of Weighted Marked Graph Petri Nets. Petri Nets 2018: p. 19-39 
with Raymond Devillers.
Final version:  https://link.springer.com/chapter/10.1007%2F978-3-319-91268-4_2


Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. ATAED@Petri Nets/ACSD 2018: p. 75-90 
with Raymond Devillers and Evgeny Erofeev.


Proposition of an Action Layer for Electrum. ABZ 2018: p. 397-402 
with Julien Brunel, David Chemouil, Alcino Cunha, Nuno Macedo and Jeanne Tawa.
Final version: https://link.springer.com/chapter/10.1007%2F978-3-319-91271-4_30


On Liveness and Deadlockability in Subclasses of Weighted Petri Nets. Petri Nets 2017: p. 267-287 
with Raymond Devillers
Final version: https://link.springer.com/chapter/10.1007%2F978-3-319-57861-3_16


On the Reversibility of Live Equal-Conflict Petri Nets. Petri Nets 2015: p. 234-253 
with Jean-Marc Delosme and Alix Munier-Kordon
Final version: https://link.springer.com/chapter/10.1007%2F978-3-319-19488-2_12


On the Reversibility of Well-Behaved Weighted Choice-Free Systems. Petri nets 2014: p. 334-353 
with Jean-Marc Delosme and Alix Munier-Kordon
Final version: https://link.springer.com/chapter/10.1007%2F978-3-319-07734-5_18


Liveness evaluation of a cyclo-static DataFlow graph. DAC 2013: 3: p. 1-7
with Mohamed Benazouz, Alix Munier-Kordon and Bruno Bodin
Final version: https://dl.acm.org/citation.cfm?doid=2463209.2488736


Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems. ACSD 2013: p. 90-99 
with Jean-Marc Delosme and Alix Munier-Kordon
Best Paper Award
Final version: https://ieeexplore.ieee.org/document/6598344/

ATER (assistant professor) full time at Paris 7 University, 2014-15, levels B1 / B3 / M2 in Comp.Sc./Mathematics, totalling circa 192 hours equiv. TC

Introduction to operating systems, basics of UNIX systems : level B1, Course and PC (Practical Classes).

Introduction to object-oriented programming and graphical interfaces, Java, Swing and a project: level B3, TC and PC.

Synchronous programming (Scade environment), co-supervising the project: level M2 in Computer science engineering, PC.

Initiation to programming 2, Java : level B1, TC and PC.

http://homepages.laas.fr/thujsa