Summary of Coursera Process Mining. Week 2 Lectures 2.2-2.

4: Petri Nets
Created by Ariadna73 using a beta version of EASY+

(Please click, and share the video. Thank you, Ari!)

Petri Nets are static, composed of places and transitions

Places hold tokens
You can use tokens to prevent concurrence
Transitions produce / consume tokens
Enabled transition: When each of the input places contains a token
When a transition is enabled, it can fire. When it fires, it produces a token that goes to each one
of the output places
We will assume that the transitions happen in a particular order
Petri Net properties
Boundedness
A place is K-bounded if there is no reachable marking with more than k tokens in P
A Petri Net is K-Bounded if all places are K-bounded
A place / Petri Net is Bounded if there exists such a k
- A safe Petri net is a 1-BoundedPetri Net
Deadlock
A marking is dead if no transition is enabled on it
A Petri Net has a potential deadlok if there is a reachable dead marking
A Petri Net is deadlock free if each reachable marking enables at least one transition
So, if you design your initial markings well, you can avoid deadocks
Liveness
A live transition is one that it is possible to reach
A live Petri Net is one with all its transitions live
A live Petri net is always deadlock free

Transition system=A reachability graph with one initial state (or marking) and no
explicit final marking
Complete traces: Those that go from the initial state to one of the final states
May be exponential in size of Petri Net (or even infinite)
Reachability Graph: Transition system with one initial state and no explicit final marking
The number of arrows represent the number of tokens required and produced by a transition
A reachability graph does not need to be finite
Long exercise with train and stations
The teacher says that there are two "Simple" models: one for the train and one for the
passengers
The teacher says that by merging the two "simple" models, we obtain a graph of the train

____________________________________________________________________________________
Created by Ariadna73 using a beta version of EASY+ (Please click, and share the video. Thank you, Ari!)
Page 1 of 1