Transition Adjacency Relation Computation Based on Unfolding: Potentials and Challenges
Transition Adjacency Relation (TAR) has provided a useful perspective for process model similarity measurement. Motivated by recent developments of other similarity metrics, this article puts TAR computation in the context of Petri net unfolding. Apart from being significantly faster than existing TAR computation algorithms, unfolding-based TAR computation also provides the potentials of enhancement through combination with other metrics that can be obtained from unfolding, especially the popular Behavior Profiles. We show that TAR computation can generally be reduced to coverability problem and solved using unfolding. However, there are also questions to be answered regarding how to further exploit unfolding information for optimal efficiency and handle silent transitions. In this article, we discuss what has been learned from our research, and also point out the open issues.
KeywordsBusiness process model Transition Adjacency Relation Petri net Complete finite prefix Cut-off events
This work was supported by the General Program of National Natural Science Foundation of China (No. 61472207) and Key Program of Research and Development of MOST (No. 2016YFB1001101).
- 5.Aalst, W.M.P.: Inheritance of business processes: a journey visiting four notorious problems. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 383–408. Springer, Heidelberg (2003). doi: 10.1007/978-3-540-40022-6_19 CrossRefGoogle Scholar
- 6.Dumas, M., Garcia-Banuelos, L., Dijkman, R.M.: Similarity search of business process models. IEEE Data Eng. Bull. 32(3), 23–28 (2009)Google Scholar
- 8.Prescher, J., Mendling, J., Weidlich, M.: The projected TAR and its application to conformance checking. In: Enterprise Modelling and Information Systems Architectures (EMISA) (2012)Google Scholar
- 11.Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., Völzer, H., Wolf, K.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 278–293. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-03848-8_19 CrossRefGoogle Scholar
- 12.Pei, J., Wen, L., Ye, X.: Computation of Transition Adjacency Relations Based on complete finite prefix (Technical Report) arXiv preprint (2015). arXiv:1506.01428
- 16.Armas-Cervantes, A., Baldan, P., Dumas, M., García-Bañuelos, L.: Behavioral comparison of process models based on canonically reduced event structures. In: Sadiq, S., Soffer, P., Völzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 267–282. Springer, Heidelberg (2014). doi: 10.1007/978-3-319-10172-9_17 Google Scholar