====== A Layout algorithm for workflow nets ======

==== Facts ====


^ Type           | master project  |
^ Place          | internal        |
^ Supervisor     | Eric Verbeek (AIS), Huub v.d. Wetering (VIS) |
^ Student        | Maik Teurlings               |
^ Thesis         | [[http://alexandria.tue.nl/extra1/afstversl/wsk-i/teurlings2012.pdf|download]]      |
^ start/end date | 15/2/2011-  15/2/2012             |
{{ :open:maik.png |}}

==== Description ====
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.

==== Additional information ====
  * http://www.processmining.org
  * [[http://www.win.tue.nl/ais|AIS]]
  * [[http://prom.win.tue.nl/tools/prom6/|ProM]]