A Layout algorithm for workflow nets

In this thesis we present a layout algorithm for Workflow nets, which are a specific type of Petri net. While much research has been performed on layout algorithms for graphs, there is little known research on layout algorithms for WF-nets. Our layout algorithm is an extended version of the Sugiyama algorithm combined with the Murata reduction rules. We formulate a number of aesthetics that define a good layout. We introduce new contraction rules to contract the WF-net. On this contracted WF-net, a layout is created, while taking the aesthetic requirements into account as much as possible. Via expansion of the contraction nodes, we get a layout for the complete input WF-net. To our knowledge, the layout algorithm proposed in this thesis is currently the only one specifically designed for WF-nets. In a small use case, we demonstrate the benefits of our algorithm.

• http://www.processmining.org
• AIS
• ProM