Content deleted Content added
m misspelled name |
basic information about some constructs used |
||
Line 1:
{{Userspace draft|source=ArticleWizard|date=April 2010}}
{{DISPLAYTITLE:α-algorithm}}
{{stub}}
The '''
It was first put forward by [[Wil van der Aalst]] <ref>van der Aalst et al. 2003</ref>. Several extensions or modifications of it have since been presented,
It constructs [[petri nets|P/T nets]] with special properties ([[workflow nets]]) from event logs (as might be collected by an [[ERP]] system). Each transition in the net corresponds to an observed task.
==
The algorithm takes a workflow log as input and results in a [[workflow net]] being constructed.
It does so by examining causal relationships observed between tasks. For example, task A might precede task B in every execution trace.
It can be shown <ref>van der Aalst et al. 2003</ref> that in the case of a complete workflow log generated by a [[sound SWF net]], the net generating it can be reconstructed.
=== Definitions used ===
* A '''workflow trace''' or '''execution trace''' is a string over an alphabet T of '''tasks'''.
* A '''workflow log''' is a set of workflow traces.
* A '''complete workflow log''' of a net N is the set of firing sequences of N.
== Extensions ==
Line 14 ⟶ 25:
== References ==
{{Reflist}}
*van der Aalst, W M P and Weijter, A J M M and Maruster, L (2003). "Workflow Mining: Discovering process models from event logs", ''IEEE Transactions on Knowledge and Data Engineering'', vol 16.
*A. de Medeiros, A K and van Dongen, B F and van der Aalst, W M P and Weijters, A (2004). "Process mining: extending the
<!--- Categories --->
[[Category:Articles created via the Article Wizard]]
[[Category:Algorithms]]
<!--- [[de:Alpha-Algorithmus]] --->
<!--- [[fr:Algorithme alpha]] --->
|