Download presentation

Presentation is loading. Please wait.

Published byJack Stewart Modified over 3 years ago

1
What is Petri nets? A bipartite graph G(V,E) – V = P U T P is the set of places (represented with circles) T is the set of transitions (represented with vertical bars) E is the set of edges between P and T

2
What is Petri nets ? (cont …) Marking function M. Given µ ε M each µ is a function which assigns a positive integer value to each element of P. µ is the marking of the graph µ is a function from P to the non-negative numbers giving the marking of the net The marking is a vector µ = (µ1, µ2,... µn), where µi is the marking for the place p f(p) is the marking of the place p Petri Net is a 5 tuple - PN = (P,T,F,W,Mº)

Similar presentations

OK

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on computer viruses and worms Ppt on standing order 2-99 Ppt on nitrogen cycle and nitrogen fixation cycle Ppt on carl friedrich gauss formula Ppt on world book day ideas Ppt on cash flow analysis Ppt on international financial markets Ppt on different solid figures worksheets Ppt on types of distribution channels Ppt on dressing etiquettes pour