Monitoring the state of currently running processes and reacting to ad-hoc situations during runtime is a key challenge in Business Process Management (BPM). This is especially the case in cyber-physical environments that are characterized by high context sensitivity. MAPE-K control loops are widely used for self-management in these environments and describe four phases for approaching this challenge: Monitor, Analyze, Plan, and Execute. In this paper, we present an architectural solution as well as implementation proposals for using MAPE-K control loops for adaptive workflow management in smart factories. We use Complex Event Processing (CEP) techniques and the process execution states of a Workflow Management System (WfMS) in the monitoring phase. In addition, we apply automated planning techniques to resolve detected exceptional situations and to continue process execution. The experimental evaluation with a physical smart factory shows the potential of the developed approach that is able to detect failures by using IoT sensor data and to resolve them autonomously in near real time with considerable results.

Similarity-based retrieval of semantic graphs is a core task of Process-Oriented Case-Based Reasoning (POCBR) with applications in real-world scenarios, e.g., in smart manufacturing. The involved similarity computation is usually complex and time-consuming, as it requires some kind of inexact graph matching. To tackle these problems, we present an approach to modeling similarity measures based on embedding semantic graphs via Graph Neural Networks (GNNs). Therefore, we first examine how arbitrary semantic graphs, including node and edge types and their knowledge-rich semantic annotations, can be encoded in a numeric format that is usable by GNNs. Given this, the architecture of two generic graph embedding models from the literature is adapted to enable their usage as a similarity measure for similarity-based retrieval. Thereby, one of the two models is more optimized towards fast similarity prediction, while the other model is optimized towards knowledge-intensive, more expressive predictions. The evaluation examines the quality and performance of these models in preselecting retrieval candidates and in approximating the ground-truth similarities of a graph-matching-based similarity measure for two semantic graph domains. The results show the great potential of the approach for use in a retrieval scenario, either as a preselection model or as an approximation of a graph similarity measure.

The accelerated growth of available data causes case bases of increasing sizes and thus lowers efficiency during the case retrieval phase in Case-Based Reasoning (CBR) systems. Even though, many complex and data-intensive tasks are solved by using Graphic Processing Units (GPUs), its application in CBR research has yet to advance past the early stage phase. In this paper, we present an approach to use CUDA-compatible GPUs for similarity assessment of structural, feature vector based cases. Our approach supports several syntactic and semantic similarity measures and is implemented in the open-source case-based reasoning framework ProCAKE. When comparing to current retrieval techniques that calculate similarities on the CPU, our GPU-based approach outperforms them by a factor of up to 37. In addition, our evaluation indicates that the performance gains increase with higher case complexity.