Scribd
Upload
3 views1 page

Problem Based Learning-Petrinets

The document describes a Petri Net model with three places representing task states and two transitions controlling the flow of tokens. In the first scenario, with one token in P1, firing T1 moves the token to P2, and firing T2 moves it to P3. In the second scenario, starting with two tokens in P1, firing T1 moves one token to P2, and firing T2 moves that token to P3, while the second token remains in P1 until T1 is fired again.

Uploaded by

strange2580369
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Problem Based Learning-Petrinets

The document describes a Petri Net model with three places representing task states and two transitions controlling the flow of tokens. In the first scenario, with one token in P1, firing T1 moves the token to P2, and firing T2 moves it to P3. In the second scenario, starting with two tokens in P1, firing T1 moves one token to P2, and firing T2 moves that token to P3, while the second token remains in P1 until T1 is fired again.

Uploaded by

strange2580369
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Problem Based Learning-Petrinets

1.​ A system has three places: P1 (Task Ready), P2 (Task Processing), and
P3 (Task Completed). Two transitions T1 (Start Task) and T2 (Finish
Task) connect them as P1 → T1 → P2 → T2 → P3. If P1 initially has 1
token, explain how the tokens move when transitions fire.
2.​ In a Petri Net model of a printer system, P1 represents “Print Request”,
P2 represents “Printing”, and P3 represents “Printed”. Transitions T1
(Start Printing) and T2 (Finish Printing) control the flow. If two tokens are
in P1 initially, describe the state of the system after each transition fires.

You might also like