Directed Reachability for Infinite-State Systems M Blondin, C Haase, P Offtermatt Tools and Algorithms for the Construction and Analysis of Systems27th …, 2021 | 19 | 2021 |
The complexity of soundness in workflow nets M Blondin, F Mazowiecki, P Offtermatt Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 6 | 2022 |
Continuous one-counter automata M Blondin, T Leys, F Mazowiecki, P Offtermatt, G Pérez ACM Transactions on Computational Logic 24 (1), 1-31, 2023 | 4 | 2023 |
Computing the expected execution time of probabilistic workflow nets PJ Meyer, J Esparza, P Offtermatt International Conference on Tools and Algorithms for the Construction and …, 2019 | 4 | 2019 |
Verifying generalised and structural soundness of workflow nets via relaxations M Blondin, F Mazowiecki, P Offtermatt International Conference on Computer Aided Verification, 468-489, 2022 | 3 | 2022 |
Computing the expected execution time of probabilistic workflow nets PJ Meyer, J Esparza, P Offtermatt arXiv preprint arXiv:1811.06961, 2018 | 2 | 2018 |
Fast Termination and Workflow Nets P Hofman, F Mazowiecki, P Offtermatt International Conference on Computer Aided Verification, 132-155, 2023 | | 2023 |
Verifying linear temporal specifications of constant-rate multi-mode systems M Blondin, P Offtermatt, A Sansfaçon-Buchanan 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023 | | 2023 |
VÉRIFICATION EFFICACE DE SYSTÈMES À COMPTEURS À L’AIDE DE RELAXATIONS P Offtermatt | | |