Computing the Expected Execution Time of Probabilistic Workflow Nets. - Philipp J. Meyer; Javier Esparza; Philip Offtermatt (TACAS (2), 2019)

Directed Reachability for Infinite-State Systems. - Michael Blondin; Christoph Haase; Philip Offtermatt (TACAS (2), 2021)

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (CAV (2), 2022)

The complexity of soundness in workflow nets. - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (LICS, 2022)

Fast Termination and Workflow Nets. - Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (CAV (1), 2023)

Verifying linear temporal specifications of constant-rate multi-mode systems. - Michael Blondin; Philip Offtermatt; Alex Sansfaçon-Buchanan (LICS, 2023)

Continuous One-counter Automata. - Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo A. Pérez 001 (ACM Trans. Comput. Log., 2023)

Soundness of reset workflow nets. - Michael Blondin; Alain Finkel; Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (LICS, 2024)