Philip Offtermatt

According to our database, Philip Offtermatt authored at least 8 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Soundness of reset workflow nets.

Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

Verifying linear temporal specifications of constant-rate multi-mode systems.

Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Fast Termination and Workflow Nets.

Piotr Hofman, Filip Mazowiecki, Philip Offtermatt

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

The complexity of soundness in workflow nets.

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations.

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

Directed Reachability for Infinite-State Systems.

Michael Blondin, Christoph Haase, Philip Offtermatt

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

Continuous One-Counter Automata.

Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2019

Computing the Expected Execution Time of Probabilistic Workflow Nets.

Philipp J. Meyer, Javier Esparza, Philip Offtermatt

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019