List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A lazy query scheme for reachability analysis in Petri nets | 2022-03-21 | Paper |
| Pomset bisimulation and unfolding for reset Petri nets Information and Computation | 2022-03-14 | Paper |
| An algorithm for single-source shortest paths enumeration in parameterized weighted graphs | 2021-10-04 | Paper |
| Distributed computation of vector clocks in Petri net unfoldings for test selection Discrete Event Dynamic Systems | 2020-09-01 | Paper |
| Pomsets and unfolding of reset Petri nets | 2018-06-26 | Paper |
| Lazy reachability analysis in distributed systems | 2018-03-21 | Paper |
| Let's be lazy, we have time -- or, lazy reachability analysis for timed automata | 2017-12-01 | Paper |
| Computation of summaries using net unfoldings (available as arXiv preprint) | 2017-02-21 | Paper |
| Factored cost-optimal planning using message passing algorithms Fundamenta Informaticae | 2016-05-11 | Paper |
| Message-passing algorithms for the verification of distributed protocols Lecture Notes in Computer Science | 2015-01-13 | Paper |
Research outcomes over time
This page was built for person: Loïg Jezequel
