PETRINET

By
Ekta Kumari(14300212008)
Pramiti Das(14300212010)
Rishiraj Sengupta(14300212012)
 INTRODUCTION
 Graphical and mathematical tool.
 Consisting of places(a),
transitions(b) ,arcs(c) and token(d).
 Promising tool for
describing and
studing system.
 HISTORY
Petri net
Introduced by Carl Adam Petri
 (12 July1926-2 July2010)

 Useful for modeling asynchronous and

concurrent and asynchronous system .
 Used for systems like computer
network,communication systems etc.
 DEFINITION
 defined as a 5 tupple
N=(P,T,I,O,M0)
 P=finite set of places
 T=finite set of transitions.
 I=input functions
defining arcs from place to transitions
 O=output functions defining arcs from
transition to place.
 M0=initial marking
BEHAVIORAL PROPERTY
Reachability: fundamental
basis forstudying the dynamic
property of a system.
 Boundedness: property identifying the
existence of overflow.
 Liveness: a concept closedly related to the
complete absence of deadlock in operating
systems.
SYSTEM MODELLING
 Parralel Activity: modelled by two
transitions run concurrently.
 Conflict Operation: two resources
working parallely, but connected to the
same resource.
 Sequential Activity: producer producing
objects stored in a buffer and consumed
by consumer.
PRODUCER AND CONSUMER
PROBLEM
 In this model each token in the buffer is an
object
 The object has been produced but not yet
consumed
 TIMED PETRINET
 marked PN in which a set of
specifications are provided and a set of
rules are defined such that to each legal
execution sequence E a timed execution
sequence TE can be univocally associated.
STOCHASTIC PETRINET
 Petri net where each transition is
associated with an exponentially
distributed random variable that expresses
the delay from the enabling to firing of the
transition.
 FUZZY PETRINET
 Fuzzy Petri net is a decision support
system based on specific rules of the
form: IF condition THEN action, for which
the condition is consumed and the action
is produced each time the rule is used.
 COLORED PETRI NETS
 Introduced by Kurt Jensen in 1981
 Each token is attached with a color
 Each place and each transition has attached
colors
 A functional dependency is specified
between the color of the transition and color
of the involved tokens
 Sets of places ,transitions and arcs are
pairwise disjoint P ∩ T=P ∩ A=T ∩ A=∅