A History Equivalence Algorithm for Dynamic Process Migration

TL;DR

This paper introduces a history equivalence algorithm for dynamic process migration that leverages workflow history to identify state mappings, ensuring consistent migration between old and new process versions.

Contribution

It presents a trail-based algorithm for finding history equivalent state mappings in process migration, addressing the challenge of maintaining consistency during workflow updates.

Findings

Algorithm successfully finds history equivalent states in Petri Nets

Identifies non-migratable states within change regions

Demonstrated through illustrative examples

Abstract

Dynamic changes in processes necessitate the notion of state equivalence between the old and new workflows. In several cases, the history of the workflow to be migrated provides sufficient context for a meaningful migration. In this paper, we present an algorithm to find the equivalence mapping for states from the old workflow to the new one using a trail-based consistency model called history equivalence. The algorithm finds history equivalent mappings for all migratable states in the reachability graph of the process under migration. It also reports all non-migratable states that fall in the change region for a given pair of old and new Petri Nets. The paper presents the algorithm, its working, and an intuitive proof. The working is demonstrated through a couple of illustrations.