-
Activities
I am currently a post-doctoral researcher at Laboratory for Analysis and Architecture of Systems (LAAS-CNRS) in Toulouse, team Verification of Time Critical Systems (VERTICS).
I am interested in the efficient modeling, analysis and synthesis of concurrent and distributed systems, with and without time, so as to ensure qualitative and quantitative properties desired for real-world applications. Non-exhaustively, I investigate:
- 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 2014Supervisors:
Alix Munier-Kordon LIP6, Univ. Paris 6
Jean-Marc Delosme IBISC, Univ. Evry-val-d'EssonnePublications
Submitted articles
On the Petri Nets with a Single Shared Place and Beyond. 43 pages. Get document on arXiv
with Bernard Berthomieu, Silvano Dal Zilio and Didier Le Botlan.
Checking marking reachability with the state equation in Petri net subclasses. 44 pages : Get document on arXiv
with Bernard Berthomieu, Silvano Dal Zilio and Didier Le Botlan.
International peer-reviewed journals
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. ToPNoC 2020, accepted, 26 pages,
with Raymond Devillers and Evgeny Erofeev.
Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. Fundamenta Informaticae 2019, p. 1-30,
with Raymond Devillers.
Final version: https://content.iospress.com/articles/fundamenta-informaticae/fi1837
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. ToPNoC 2019, p. 172-191,
with Raymond Devillers and Evgeny Erofeev.
Final version: https://link.springer.com/chapter/10.1007%2F978-3-662-60651-3_7
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/Teaching
Part-time lecturer, INSA Toulouse, 2019 - 2020 : level M1, totalling circa 40 hours equiv. TC (Tutorial Classes)
Model-checking: PC (Practical Classes).
Temporal models: PC.
Modeling of concurrent systems: PC.
Assistant professor in Germany, Univ. Oldenburg, 2015-17, in English / German: level B2 / B3 / M1, totalling circa 256 hours equiv. TC
Complexity theory: level M1, TC.
Petri nets: level B3, TC.
Seminars of functional programming: management of the students for studying existing research articles: level B3.
Basics of theoretical Computer science: level B2, amphitheatre.
Supervising the internship of a Bachelor student of the university, level B3.
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.
Instructor at Paris 6 University, 2011-14, level L2 in Computer science, totalling circa 192 hours equiv. TCMachine and representation : TC and PC.Elementary Algorithmics: TC.Contact
Awards