BUSI 2710 Study Guide - Final Guide: Workflow, Petri Net, Soundness

• School: Memorial University
• Department: Business Administration
• Course: BUSI 2710
• Professor: Josh Taylor

Document Summary

Technique for the description and analysis of concurrent systems. Based of a few simple concepts, yet expressive. Many extensions and variants have been defined over the years. There are two main uses of petri nets for workflows: Formal analysis of workflows (semantics, analysis of important properties) Petri nets consist of places and transitions. Places and transitions are connected by arrows (arcs) and must alternate each other. Places are represented by circles, transitions by thick bars or boxes. Formally, a petri net n is a triple (p, t, f) where. P is a finite set of places. T is a finite set of transitions. Markings assign tokens (graphically represented as black dots) to places; they represent the state of the system. Formally, a marking m of a petri net n=(p, t, f) is the assignments of the number of tokens for each place in the petri net. Transitions can change a marking by firing.