First Exercises Series
Dr. Nourredine OUKAS
October 19, 2024
Exercise 1: Reachability Graph Exercise 5: Deadlock Detection
Given the following Petri net: Consider the following Petri net:
• Places: P1 , P2 , P3
• Places: P1 , P2 , P3
• Transitions: T1 , T2
• Transitions: T1 , T2
• Initial marking: M0 = (1, 0, 0)
The transitions have the following arcs: • Arcs:
• T1 : input from P1 , output to P2
– T1 : input from P1 , output to P2
• T2 : input from P2 , output to P3
– T2 : input from P2 , output to P3
Draw the reachability graph and determine if the sys-
tem is bounded. • Initial marking: M0 = (1, 0, 0)
Is there a deadlock in this Petri net? If so, at what
Exercise 2: Place Invariants marking?
Consider the following Petri net:
• Places: P1 , P2 , P3 Exercise 6: Boundedness
• Transitions: T1 , T2
Consider the following Petri net:
• Arcs:
• Places: P1 , P2
– T1 : input from P1 , output to P2
– T2 : input from P2 , output to P3 • Transitions: T1 , T2
Find a place invariant for the system.
• Arcs:
Exercise 3: Incidence Matrix – T1 : input from P1 , output to P2
For the Petri net described below, determine the inci- – T2 : input from P2 , output to P1
dence matrix:
• Initial marking: M0 = (1, 0)
• Places: P1 , P2 , P3
• Transitions: T1 , T2 Is this Petri net bounded? Justify your answer.
• Arcs:
– T1 : input from P1 , output to P2 Exercise 7: Liveness
– T2 : input from P2 , output to P3
Consider the following Petri net:
Exercise 4: Transition Invariants • Places: P1 , P2
Consider the Petri net with the following transitions and • Transitions: T1 , T2
places:
• Places: P1 , P2 • Arcs:
1
• Transitions: T1 , T2
– T1 : input from P1 , output to P2
Exercise 8: Siphons and Traps Exercise 13: Firing Sequences and
Consider the following Petri net: Reachability
• Places: P1 , P2 , P3 Consider the Petri net from Exercise 1 with initial mark-
ing M0 = (1, 0, 0). List all possible markings reachable
• Transitions: T1 , T2 from M0 .
• Arcs:
– T1 : input from P1 , output to P2
– T2 : input from P2 , output to P3
• Initial marking: M0 = (1, 0, 0)
Identify if there are any siphons or traps in this Petri
net. article amsmath tikz
Exercises on Pre and Post Matrix of Petri Nets Your
Name October 19, 2024
Exercise 9: Constructing Pre and
Post Matrices
Consider the following Petri net:
• Places: P1 , P2 , P3
• Transitions: T1 , T2 , T3
• Arcs:
– T1 : input from P1 , output to P2
– T2 : input from P2 , output to P3
– T3 : input from P3 , output to P1
• Initial marking: M0 = (1, 0, 0)
Construct the pre-matrix and post-matrix for this
Petri net.
Exercise 10: Incidence Matrix
Using the Petri net from Exercise 1, compute the inci-
dence matrix C.
Exercise 11: Marking Equation
Consider the Petri net with the incidence matrix from
Exercise 2. If the initial marking is M0 = (1, 0, 0) and
the firing vector is σ = (1, 1, 0), compute the marking
after the firing sequence.
Exercise 12: Boundedness from In-
cidence Matrix
Consider the Petri net from Exercise 1. Analyze whether
the Petri net is bounded based on the incidence matrix.
