This document discusses the Petri net method. Petri nets are a diagramming tool used to model concurrent and synchronized systems. They consist of places and transitions, with places representing states and transitions representing changes between states. Places are circles and transitions are thick bars. Transitions fire to change the state of a Petri net, following a set of mathematical rules. The document provides examples of using Petri nets to model queuing systems.

1. The Petri Net Method
By
The Explorers Ltd
Computer Science & Engineering
Daffodil international University

2. MEMBERS
M M Rayhan Parvez
143-15-4617
Asif Ahmed
143-15-4664
Badhan Saha
143-15-4594
Tuhin suad
143-15-4614
Jiya Uddin Ahmed
143-15-4593

3. INTRODUCTION
First introduced by Carl Adam Petri in 1939
.
A diagrammatic tool to model concurrency
and synchronization in distributed systems.
Very similar to State Transition Diagrams.
Used as a visual communication aid to
model the system behavior.
Based on strong mathematical foundation.

4. PETRI NETS: DEFINITION
Petri Nets consist of places and transitions
Places can be input/output of transitions
Places represent states, transitions represent
state changes
Places are represented by circles, transitions by
thick bars

5. PETRI NETS: GRAPHICAL
SYMBOLS
Place ArcArc

6. FIRING OF TRANSITIONS

7. FIRING TRANSITIONS: FURTHER
EXAMPLES

8. STATE EQUATION

9. STATE EQUATION

10. PETRI NET MODELS OF
QUEUING SYSTEMS
T = {a, s, c}
P = {Q, I, B}

11. PETRI NET MODELS OF
QUEUING SYSTEMS 1
Secquence ={a, s, a, a, c, s, a}
Initial stateInitial state Final stateFinal state

12. PETRI NET MODELS OF
QUEUING SYSTEMS 2
Secquence ={a, s, a, a, c, s, a}
Fire aFire a

13. PETRI NET MODELS OF
QUEUING SYSTEMS 3
Secquence ={a, s, a, a, c, s, a}
Fire sFire s

14. PETRI NET MODELS OF
QUEUING SYSTEMS 4
Secquence ={a, s, a, a, c, s, a}
Fire aFire a

15. PETRI NET MODELS OF
QUEUING SYSTEMS 5
Secquence ={a, s, a, a, c, s, a}
Fire aFire a

16. PETRI NET MODELS OF
QUEUING SYSTEMS 6
Secquence ={a, s, a, a, c, s, a}
Fire cFire c

17. PETRI NET MODELS OF
QUEUING SYSTEMS 7
Secquence ={a, s, a, a, c, s, a}
Fire sFire s

18. PETRI NET MODELS OF
QUEUING SYSTEMS 8
Secquence ={a, s, a, a, c, s, a}
Fire aFire a

19. PETRI NET MODELS OF QUEUING
SYSTEMS FINAL STATE
Secquence ={a, s, a, a, c, s, a}
Final StateFinal State