petri nets

718 Words2 Pages

Extensions
With the addition of certain features to the existing petrinet, several extentions can be formulated, that peform extended functions. There are two major types of extensions of petri nets.
Types of Extensions
1) completely backwards-compatible
Backward compatibility of a petrinet is decided based on whether it can be reverted to the original petri net after the extension or not. These petrinets are usually extended via a mathematical formula, and hence they can be reversed. Coloured Petrinets are examples for backward compatible petrinets. If the properties can be modelled in the original petrinet, they are not real extensions.

2) Non backwards compatible
These are the petrinets whose extensions cannot be reverted to get back the original petriet. For example, timed petrinets cannot be reversed from theoir extended versions since it is a function of time. Non backward compatible Extensions are sometimes very powerful, but they do not possess the full range of mathematical tools that are available for the analysis of normal Petri nets.

Types of important extended petrinets
1) Additional types of arcs
a) Reset arc
This type of arc never imposes any precondition on firing. It also empties the place upon firing of the transition, thus making it difficult of impossible to decide the reachability. However, in the reset arc, properties like termination are decidable.

b) Inhibitor Arc
This type of arc imposes precondition which allows firing of the transition only when the place is empty. Furthermore, it allows arbitrary computations on the number of tokens.
2) Colored Petrinets
Unlike the indistinguishable feature of tokens in standard petrinets, every token carries a value in a Colored Petri net. CPN tools ar...

... middle of paper ...

...ollows

Fig. Example of a Marked Graph
3) Free Choice
Here, an arc from a place to a transition can either be the only arc from that place or the only arc to that transition. Concurrency and conflict can exist, but not at the same time.

4) Extended Free Choice
These petri nets are a super set of free choice that can be transformed into a free choice.
5) Asymmetric Choice Net
Incase of Asymmmetric Choice Net, 'confusion', or concurrency and conflict may occur, but they will not occur symmetrically. Mathematically, it can be represented as follows

extensions, restrictions are also possible and done on petri nets. We obtain restricted petrinet by suppressing certain features of the ordinary petri nets. In ordiary petri nets, all the are weights are one

Works Cited

http://embedded.eecs.berkeley.edu/Respep/Research/hsc/class.F03/ee249/discussionpapers/PetriNets.pdf

Open Document