Showing 2018 · cs.LOShow all
2 papers · 2 filters
cs.LO2018
Computing the Expected Execution Time of Probabilistic Workflow Nets
Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Free-Choice Workflow Petri nets, also known as Workflow Graphs, are a popular model in Business Process Modeling. In this paper we introduce Timed Probabilistic Workflow Nets (TPWN…
cs.LO2018
Computing the concurrency threshold of sound free-choice workflow nets
Philipp J. Meyer, Javier Esparza, Hagen Völzer
Workflow graphs extend classical flow charts with concurrent fork and join nodes. They constitute the core of business processing languages such as BPMN or UML Activity Diagrams. T…