Reference no: EM132371773

Assignment -

This is an assignment about some properties of the Petri Nets. Use Petri Nets Wikipedia link to know what is the definition of Petri Nets. One of the classes of Petri Nets is Asymmetric Choice (look at the link-Restrictions ).

It is required to write a pseudocode algorithm to chech whether a Petri net model satisfies the property of Asymmetric choice.

For a Petri nets model that satisfies an Asymmetric choice property the post-sets of each two places have to be a subset of each other or the intersection of their post-sets should be empty.

The circles are the places {S0,S1,S2,S3,S4}

Transitions are the squares {t0,t1,t2,t3}

The post-set of S1 = {t1,t2}

The post-set of S2 = {t1,t2,t3}

The post-set of S3 = {t3}

This model satisfies the Asymmetric choice property because the post-set of S1 is a sub-set of the post-set of S2, also, the post-set of S3 is sub-set of S2. S1,S3 the intersection of their post-sets is empty set.

How to write algorithm to check the model of a Petri net whether the property of Asymmetric choice hold or not.

Attachment:- Assignment File.rar