Mostrar el registro sencillo del ítem

dc.creatorLatorre Biel, Juan Ignacioes_ES
dc.creatorJiménez Macías, Emilioes_ES
dc.creatorPérez de la Parte, Mercedeses_ES
dc.date.accessioned2018-10-25T06:11:40Z
dc.date.available2018-10-25T06:11:40Z
dc.date.issued2018
dc.identifier.issn1076-2787 (Print)
dc.identifier.issn1099-0526 (Electronic)
dc.identifier.urihttps://hdl.handle.net/2454/31163
dc.description.abstractDiscrete event systems in applications, such as industry and supply chain,may show a very complex behavior. For this reason, their design and operation may be carried out by the application of optimization techniques for decision making in order to obtain their highest performance. In a general approach, it is possible to implement these optimization techniques by means of the simulation of a Petri net model, which may require an intensive use of computational resources. One key factor in the computational cost of simulation-based optimization is the size of the model of the system; hence, it may be useful to apply techniques to reduce it. This paper analyzes the relationship between two Petri net formalisms, currently used in the design of discrete event systems, where it is usual to count on a set of alternative structural configurations.These formalisms are a particular type of parametric Petri nets, called compound Petri nets, and a set of alternative Petri nets. The development of equivalent models under these formalisms and the formal proof of this equivalence are the main topics of the paper.The basis for this formal approach is the graph of reachable markings, a powerful tool able to represent the behavior of a discrete event system and, hence, to show the equivalence between two different Petri net models. One immediate application of this equivalence is the substitution of a large model of a system by a more compact one, whose simulation may be less demanding in the use of computational resources.en
dc.format.extent14 p.
dc.format.mimetypeapplication/pdfen
dc.language.isoengen
dc.publisherHindawi / Wileyen
dc.relation.ispartofComplexity, Volume 2018, Article ID 5341346en
dc.rights© 2018 Juan-Ignacio Latorre-Biel et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.en
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectDiscrete event systemsen
dc.subjectOptimization techniquesen
dc.subjectPetri net formalismsen
dc.titleEquivalent and efficient optimization models for an industrial discrete event system with alternative structural configurationsen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeArtículo / Artikuluaes
dc.contributor.departmentInstitute of Smart Cities - ISCes_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen
dc.rights.accessRightsAcceso abierto / Sarbide irekiaes
dc.identifier.doi10.1155/2018/5341346
dc.relation.publisherversionhttps://doi.org/10.1155/2018/5341346
dc.type.versioninfo:eu-repo/semantics/publishedVersionen
dc.type.versionVersión publicada / Argitaratu den bertsioaes


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

© 2018 Juan-Ignacio Latorre-Biel et al. This is an open access article distributed under the  Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
La licencia del ítem se describe como © 2018 Juan-Ignacio Latorre-Biel et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

El Repositorio ha recibido la ayuda de la Fundación Española para la Ciencia y la Tecnología para la realización de actividades en el ámbito del fomento de la investigación científica de excelencia, en la Línea 2. Repositorios institucionales (convocatoria 2020-2021).
Logo MinisterioLogo Fecyt