Download presentation

Presentation is loading. Please wait.

Published byJack Stewart Modified over 4 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

Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.

Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google