Petri Nets I .


54 views
Uploaded on:
Category: Product / Service
Description
2. Meaning of Petri Net. C = ( P, T, I, O)Places P = { p1, p2, p3,
Transcripts
Slide 1

Petri Nets I Friday, October 21, 2005

Slide 2

Definition of Petri Net C = ( P, T, I, O) Places P = { p 1 , p 2 , p 3 , … , p n } Transitions T = { t 1 , t 2 , t 3 , … , t n } Input I : T ��  P (r = number of spots) Output O : T ��  P (q = number of spots) stamping µ : task of tokens to the spots of Petri net µ = µ 1 , µ 2 , µ 3 , … µ n

Slide 3

Applications of Petri Net Petri net is principally utilized for concentrate the element simultaneous conduct of system based frameworks where there is a discrete stream. Petri Nets are connected by and by industry, the scholarly world, and different spots. - reference

Slide 4

Basics of Petri Nets Petri net comprise two sorts of hubs: places and moves . What\'s more, bend exists just from a place to a move or from a move to a place. A place may have at least zero tokens . Graphically, places, moves, circular segments, and tokens are spoken to separately by: circles, bars, bolts, and spots. p 1 t 1 p 2

Slide 5

Basics of Petri Nets - proceeded Below is a case Petri net with two spots and one exchange. Move hub is prepared to flame if and just if there is no less than one token at each of its information places state move of frame (1, 0) ��  (0, 1) p 1 : input place p 2 : yield put p 1 t 1 p 2

Slide 6

Properties of Petri Nets Sequential Execution Transition t 2 can fire simply after the terminating of t 1 . This force the priority of imperatives "t 2 after t 1 ." Synchronization Transition t 1 will be empowered just when a token there are no less than one token at each of its information places. Blending Happens when tokens from a few spots touch base for administration at a similar move. p 1 t 1 p 2 t 2 p 3 t 1

Slide 7

Properties of Petri Nets Concurrency t 1 and t 2 are simultaneous. - with this property, Petri net can show frameworks of disseminated control with different procedures executing simultaneously in time. - proceeded with t 1 t 2

Slide 8

Properties of Petri Nets Conflict t 1 and t 2 are both prepared to flame however the terminating of any prompts to the incapacitating of alternate moves. - proceeded with t 1 t 2 t 1 t 2

Slide 9

Properties of Petri Nets Conflict - proceeded with the subsequent clash might be settled in a simply non-deterministic path or probabilistically, by relegating suitable probabilities to the clashing moves. there is a decision of either t 1 and t 2 , or t 3 and t 4 t 1 t 2 t 3 t 4 - proceeded with

Slide 10

Example: In a Restaurant (A Petri Net) Waiter free Customer 1 Customer 2 Take arrange Take arrange hold up Order taken hold up eating Tell kitchen Serve sustenance Serve nourishment

Slide 11

Example: In a Restaurant (Two Scenarios) Scenario 1: Waiter takes arrange from client 1; serves client 1; takes arrange from client 2; serves client 2. Situation 2: Waiter takes arrange from client 1; takes arrange from client 2; serves client 2; serves client 1.

Slide 12

Waiter free Customer 1 Customer 2 Take arrange Take arrange hold up Order taken hold up eating Tell kitchen Serve nourishment Serve sustenance Example: In a Restaurant (Scenario 1)

Slide 13

Waiter free Customer 1 Customer 2 Take arrange Take arrange hold up Order taken hold up eating Tell kitchen Serve nourishment Serve sustenance Example: In a Restaurant (Scenario 2)

Slide 14

Take 15c bar Deposit 10c 15c 5c Deposit 5c Deposit 5c Deposit 5c Deposit 5c 0c Deposit 10c 20c 10c Deposit 10c Take 20c bar Example: Vending Machine (A Petri net)

Slide 15

Example: Vending Machine (3 Scenarios) Scenario 1: Deposit 5c, store 5c, store 5c, store 5c, take 20c lunch room. Situation 2: Deposit 10c, store 5c, take 15c cafe. Situation 3: Deposit 5c, store 10c, store 5c, take 20c cafe.

Slide 16

Take 15c bar Deposit 10c 15c 5c Deposit 5c Deposit 5c Deposit 5c Deposit 5c 0c Deposit 10c 20c 10c Deposit 10c Take 20c bar Example: Vending Machine (Token Games)

Slide 17

Petri Net cases

Slide 18

Petri Net cases (Dining Philosophers) Five savants then again think and eating Chopsticks: p 0 , p 2 , p 4 , p 6 , p 8 Philosophers eating: p 10 , p 11 , p 12 , p 13 , p 14 Philosophers considering/contemplating: p 1 , p 3 , p 5 , p 7 , p 9

Slide 19

Petri Net with Time 1962 - Carl Adam Petri initially proposed Petri with no thought of time. Idea of time was deliberately maintained a strategic distance from on the grounds that expansion of time confines the conduct of the net. 1970s ~ - Addition of time has been talked about keeping in mind the end goal to break down the execution of the demonstrated framework. Numerous properties are still undecided for Petri nets reached out with information and time.

Slide 20

References Fishwick, Paul(1995) – Simulation Model Design and Execution Petri Nets World Ling,Chris(2001) – Lecture on Petri Nets Method Chapman, Nick(1997) – Surprise97 diary on Petri Nets Models

Recommended
View more...