The evolutionary systems (ES) include software applications that solve problems using heuristic methods instead of the deterministic ones. The classical computing used for ES development involves random methods to improve different kinds of genomes. The mappings of these genomes lead to individuals that correspond to the searched solutions. The individual evaluations by simulations serve for the improvement of their genotypes. Quantum computations, unlike the classical computations, can describe and simulate a large set of individuals simultaneously. This feature is used to diminish the time for finding the solutions. Quantum Petri Nets (QPNs) can model dynamical systems with probabilistic features that make them appropriate for the development of ES. Some examples of ES applications using the QPNs are given to show the benefits of the current approach.

Since their introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a (mathematical) tree-based model of a process, in which internal vertices represent behavioral control-flow relations and leaves represent process activities. Translation of a process tree into a sound Workflow net is trivial; however, the reverse is not the case. Simultaneously, an algorithm that translates a WF-net into a process tree is of great interest, e.g., the explicit knowledge of the control-flow hierarchy in a WF-net allows one to reason on its behavior more easily. Hence, in this paper, we present such an algorithm, i.e., it detects whether a WF-net corresponds to a process tree, and, if so, constructs it. We prove that, when the algorithm finds a process tree, the language of the process tree is equal to the language of the original WF-net. The experiments conducted show that the algorithm’s corresponding implementation has a quadratic time complexity in the size of the WF-net. Furthermore, the experiments show strong evidence of process tree re-discoverability.

Industrial discrete event dynamic systems (DEDSs) are commonly modelled by means of Petri nets (PNs). PNs have the capability to model behaviours such as concurrency, synchronization, and resource sharing, compared to a GRAphe Fonctionnel de Commande Etape Transition (GRAFCET) which is a particular case of a PN. However, there is not a systematic way to implement a PN in a programmable logic controller (PLC), and so it is very common the implementation of such a controller outside a PLC, in some external software that will communicate with the PLC. There have been some attempts to implement PNs within a PLC, but they are dependent on how the logic of places and transitions is programmed for each application. This work proposes a novel application-independent and platform-independent PN implementation methodology. This methodology is a systematic way to implement a PN controller within industrial PLCs. A great portion of the code will be validated automatically prior to PLC implementation. Net structure and marking evolution will be checked on the basis of PN model structural analysis, and only net interpretation will be manually coded and error-prone. Thus, this methodology represents a systematic and semi-compiled PN implementation method. A use case supported by a digital twin (DT) is shown where the automated solution required by a manufacturing system is carried out and executed in two different devices for portability testing, and the scan cycle periods are compared for both approaches.

Studying concurrent systems is to sort the read/write and control events in the concurrent system according to the order, or in partial order, or in strict order. Because of the concurrency of events and the timeliness of writing events, there will be overlap between events, which requires interval order analysis. A single start and end sequence to represent the entire hierarchical order structure as well as all equivalent spaced order observations.a single sequence of beginnings and endings to represent the entire stratified order structures as well as all equivalent interval order observations. Mazurkiewicz traces and Comtracks are hierarchical traces, but they cannot describe interval traces. In a few sentences of this summary, we can tell the problems (petri interval traces with data), the previous work (Mazurkiewicz traces, Comtracks), the reasons that cannot be solved, and our own solutions (DPN: Petri nets with data, interval traces). This paper focuses on a BE (Beginnings and Endings) sequence representing an equivalent class of runs, or targets. Our goal is to have a BE sequence to represent the entire hierarchical order structure, that is, all equivalent observable interval orders.

Scheduling of real time tasks are very important aspect in systems as processes should complete its task at a specific time. There is a need of high energy efficiency and low response time in large data stream so for this energy efficient resources and optimized frameworks are needed. Both hard real time and mixed critically systems are targeted. Soft deadline can be handled while hard deadlines are difficult to cater. Different algorithms are used to schedule tasks like rate monotonic, earliest deadline first, deadline monotonic etc.

This article makes a general analysis of the supply chain of photovoltaic systems in Colombia, taking as a starting point a conceptual base and the current situation of the country in this sector. This article especially will contemplate the non-interconnected areas (ZNI) to the electricity grid in the national, due to its complexity in the logistics issues. Likewise, the work performs a graphical representation of the stages and processes of the supply chain using a powerful-modeled tool such as the Petri Nets (PNs). Finally, it identifies some of the flaws in the operation and the joint of all the links of the logistic part and from there it is based the importance of the strategy of orientation to the supply chain (SCO) as a possible alternative to improve and to enhance the logistic processes of this type of systems.

Manufacturing systems need to meet I4.0 guidelines to deal with uncertainty in scenarios of turbulent demand for products. The engineering concepts to define the service’s resources to manufacture the products will be more flexible, ensuring the possibility of re-planning in operation. These can follow the engineering paradigm based on capabilities. The virtualization of industry components and assets achieves the RAMI 4.0 guidelines and (I4.0C), which describes the Asset Administration Shell (AAS). However, AAS are passive components that provide information about I4.0 assets. The proposal of specific paradigms is exposed for managing these components, as is the case of multi-agent systems (MAS) that attribute intelligence to objects. The implementation of resource coalitions with evolutionary architectures (EAS) applies cooperation and capabilities’ association. Therefore, this work focuses on designing a method for modeling the asset administration shell (AAS) as virtual elements orchestrating intelligent agents (MAS) that attribute cooperation and negotiation through contracts to coalitions based on the engineering capabilities concept. The systematic method suggested in this work is partitioned for the composition of objects, AAS elements, and activities that guarantee the relationship between entities. Finally, Production Flow Schema (PFS) refinements are applied to generate the final Petri net models (PN) and validate them with Snoopy simulations. The results achieved demonstrate the validation of the procedure, eliminating interlocking and enabling liveliness to integrate elements behavior.