Compound Petri nets and alternatives aggregation Petri nets: Two formalisms for decision-making support

  1. Latorre-Biel, J.-I. 1
  2. Jiménez-Macías, E. 2
  3. Pérez-De-La-Parte, M. 2
  4. Sáenz-Díez, J.C. 2
  5. Martínez-Cámara, E. 2
  6. Blanco-Fernández, J. 2
  1. 1 Universidad Pública de Navarra
    info

    Universidad Pública de Navarra

    Pamplona, España

    ROR https://ror.org/02z0cah89

  2. 2 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Journal:
Advances in Mechanical Engineering 

ISSN: 1687-8132

Year of publication: 2016

Volume: 8

Issue: 11

Pages: 1-12

Type: Article

DOI: 10.1177/1687814016680516 SCOPUS: 2-s2.0-85002170833 WoS: WOS:000389440400052 GOOGLE SCHOLAR

More publications in: Advances in Mechanical Engineering 

Institutional repository: lock_openOpen access Editor

Abstract

Decision-making in technological systems, such as communication networks, manufacturing facilities and supply chains, constitutes a common requirement able to lead companies galore to success or failure. This article presents a decision-making methodology, where the feasible structural configurations to be analysed are chosen heuristically in the frame of a single optimization problem. For stating the optimization problem and solving it efficiently, appropriate formalisms would be used. Compound Petri nets, a particular kind of parametric Petri nets, and alternatives aggregation Petri nets, are two Petri net-based formalisms able to integrate in the same model different alternative structural configurations. Moreover, even having different characteristics that might make them useful for different applications, both formalisms present common features, such as including a set of exclusive entities and the possibility of developing compact Petri net models, by the removal of redundant information. This article is also focused on the transformation algorithm between compound Petri nets and alternatives aggregation Petri nets. This algorithm is devoted to transform a model described by one of the formalisms into an equivalent model, that is, with the same behaviour, represented using the other formalism. Finally, several application examples are given for illustrating the steps of the transformation algorithm. © 2016 The Author(s).