Transformation algorithm from an alternatives aggregation Petri net to a compound Petri net. Two representations of an undefined Petri net with a non-empty set of exclusive entities

Resumen

Simulation, analysis, decision making, and control of discrete event systems, are examples of very common applications in industrial and technological fields. All these operations require the representation of the discrete event system in an appropriate formal language, that is to say obtaining the best suited model for the current application. A very common family of formalisms is the paradigm of the Petri nets. Different Petri net-based formalisms present different modelling power and diverse features, which make them especially suited for a given operation. In the field of decision making, where there exist a number of alternative structural configurations, the alternatives aggregation Petri nets and the compound Petri nets, lead to compact models for describing a discrete event system. This paper describes a transformation algorithm between them and an example to illustrate the application of the different steps. This transformation algorithm allows a fast transformation between both formalisms for applications related to decision making, since it is not necessary to perform a previous transformation to an intermediate set of alternative Petri nets to afford the construction of a compound Petri net from an alternatives aggregation Petri net.