We are very happy to announce the acceptance of the paper “Computing the Expected Execution Time of Probabilistic Workflow Nets” by Philipp Meyer, Philip Offtermatt and Javier Esparza at the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’19) of the European Joint Conferences on Theory & Practice of Software. In this paper Timed Probabilistic Workflow Nets as a variation on Free-Choice Workflow Petri nets are introduced and explored. Although discouraging theoretical results regarding the complexity of computing schedulers are obtained an experimental investigation yields positive results for the considered benchmark suite.

Categories: PaperResearch