Petri net

Petri net
Part 1
In Figure 1 :
1. What is the state of the Petri Net?
2. From the initial marking, is the choice of transitions deterministic or not? Explain
in detail your answer.
3. From the initial marking, if we fire the following sequence: <t3, t1>, what is the
next state of the Petri Net?
4. From the initial marking, what happens if we try to fire the following sequence: <t3,
t4, t3>?
5. Give all the transitions that can be executed in parallel.
6. Do you have transitions that are in conflict? Explain in detail your answer.
7. Do you have deadlock? Explain in detail your answer.
8. Do you have starvation? Explain in detail your answer.
Part 2
In Figure 2:
1. Do you have deadlock? Explain in detail your answer.
2. Do you have starvation? Explain in detail your answer.
1
t2 t3 t4 t1
p1
p2
p3
p5 p4
Figure 1
t1 t3
t2 t4
P1
P2
P3
P4
P5
P6
Figure 2
2
Part 3
Model the following algorithm (to wash cloths) with the Petri Net formalism.
1. Put Water in Tub
2. Put Cloths in Tub
3. Wash Cloths with Soap
4. Rinse Cloths
Part 4
Using the Petri Net formalism, specify the following requirements of a vending machine:
1. Returns only two drinks: 20 or 15 cents.
2. Accepts only two types of coins: 10c coin and 5c coin.
3. Does not return any change.
Part 5
1. Choose a concurrent problem and identify its functional requirements.
2. Specify the problem with the Petri Net formalism.
3. Describe in detail your Petri Net tool. What are the supporting and missing capabilities?
For examples, checking the concurrency properties (deadlock and starvation),
searching for parallel and conflicting transitions, firing a given sequence of transitions
(moving the tokens).3

PLACE THIS ORDER OR A SIMILAR ORDER WITH US TODAY AND GET A GOOD DISCOUNT