Transition adjacency relation computation based on unfolding: Potentials and challenges

Jisheng Pei, Lijie Wen, Xiaojun Ye, Akhil Kumar, Zijing Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 cover ability 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.

Original languageEnglish (US)
Title of host publicationOn the Move to Meaningful Internet Systems
Subtitle of host publicationOTM 2016 Conferences - Confederated International Conferences: CoopIS, CandTC, and ODBASE 2016, Proceedings
EditorsTharam Dillon, Christophe Debruyne, Declan Oâ’Sullivan, Herve Panetto, Eva Kuhn, Claudio Agostino Ardagna, Robert Meersman
PublisherSpringer Verlag
Pages61-79
Number of pages19
ISBN (Print)9783319484716
DOIs
StatePublished - Jan 1 2016
EventConfederated International Conference On the Move to Meaningful Internet Systems, OTM 2016 held in conjunction with Conferences on CoopIS, CandTC and ODBASE 2016 - Rhodes, Greece
Duration: Oct 24 2016Oct 28 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10033 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherConfederated International Conference On the Move to Meaningful Internet Systems, OTM 2016 held in conjunction with Conferences on CoopIS, CandTC and ODBASE 2016
CountryGreece
CityRhodes
Period10/24/1610/28/16

Fingerprint

Adjacency
Unfolding
Petri nets
Metric
Petri Nets
Process Model
Enhancement
Cover

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Pei, J., Wen, L., Ye, X., Kumar, A., & Lin, Z. (2016). Transition adjacency relation computation based on unfolding: Potentials and challenges. In T. Dillon, C. Debruyne, D. Oâ’Sullivan, H. Panetto, E. Kuhn, C. A. Ardagna, & R. Meersman (Eds.), On the Move to Meaningful Internet Systems: OTM 2016 Conferences - Confederated International Conferences: CoopIS, CandTC, and ODBASE 2016, Proceedings (pp. 61-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10033 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-48472-3_4
Pei, Jisheng ; Wen, Lijie ; Ye, Xiaojun ; Kumar, Akhil ; Lin, Zijing. / Transition adjacency relation computation based on unfolding : Potentials and challenges. On the Move to Meaningful Internet Systems: OTM 2016 Conferences - Confederated International Conferences: CoopIS, CandTC, and ODBASE 2016, Proceedings. editor / Tharam Dillon ; Christophe Debruyne ; Declan Oâ’Sullivan ; Herve Panetto ; Eva Kuhn ; Claudio Agostino Ardagna ; Robert Meersman. Springer Verlag, 2016. pp. 61-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5b21f70626bd4ec0b5821ce8387f7b0c,
title = "Transition adjacency relation computation based on unfolding: Potentials and challenges",
abstract = "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 cover ability 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.",
author = "Jisheng Pei and Lijie Wen and Xiaojun Ye and Akhil Kumar and Zijing Lin",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-319-48472-3_4",
language = "English (US)",
isbn = "9783319484716",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "61--79",
editor = "Tharam Dillon and Christophe Debruyne and Declan O{\^a}’Sullivan and Herve Panetto and Eva Kuhn and Ardagna, {Claudio Agostino} and Robert Meersman",
booktitle = "On the Move to Meaningful Internet Systems",
address = "Germany",

}

Pei, J, Wen, L, Ye, X, Kumar, A & Lin, Z 2016, Transition adjacency relation computation based on unfolding: Potentials and challenges. in T Dillon, C Debruyne, D Oâ’Sullivan, H Panetto, E Kuhn, CA Ardagna & R Meersman (eds), On the Move to Meaningful Internet Systems: OTM 2016 Conferences - Confederated International Conferences: CoopIS, CandTC, and ODBASE 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10033 LNCS, Springer Verlag, pp. 61-79, Confederated International Conference On the Move to Meaningful Internet Systems, OTM 2016 held in conjunction with Conferences on CoopIS, CandTC and ODBASE 2016, Rhodes, Greece, 10/24/16. https://doi.org/10.1007/978-3-319-48472-3_4

Transition adjacency relation computation based on unfolding : Potentials and challenges. / Pei, Jisheng; Wen, Lijie; Ye, Xiaojun; Kumar, Akhil; Lin, Zijing.

On the Move to Meaningful Internet Systems: OTM 2016 Conferences - Confederated International Conferences: CoopIS, CandTC, and ODBASE 2016, Proceedings. ed. / Tharam Dillon; Christophe Debruyne; Declan Oâ’Sullivan; Herve Panetto; Eva Kuhn; Claudio Agostino Ardagna; Robert Meersman. Springer Verlag, 2016. p. 61-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10033 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Transition adjacency relation computation based on unfolding

T2 - Potentials and challenges

AU - Pei, Jisheng

AU - Wen, Lijie

AU - Ye, Xiaojun

AU - Kumar, Akhil

AU - Lin, Zijing

PY - 2016/1/1

Y1 - 2016/1/1

N2 - 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 cover ability 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.

AB - 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 cover ability 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.

UR - http://www.scopus.com/inward/record.url?scp=84995958712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84995958712&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-48472-3_4

DO - 10.1007/978-3-319-48472-3_4

M3 - Conference contribution

AN - SCOPUS:84995958712

SN - 9783319484716

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 61

EP - 79

BT - On the Move to Meaningful Internet Systems

A2 - Dillon, Tharam

A2 - Debruyne, Christophe

A2 - Oâ’Sullivan, Declan

A2 - Panetto, Herve

A2 - Kuhn, Eva

A2 - Ardagna, Claudio Agostino

A2 - Meersman, Robert

PB - Springer Verlag

ER -

Pei J, Wen L, Ye X, Kumar A, Lin Z. Transition adjacency relation computation based on unfolding: Potentials and challenges. In Dillon T, Debruyne C, Oâ’Sullivan D, Panetto H, Kuhn E, Ardagna CA, Meersman R, editors, On the Move to Meaningful Internet Systems: OTM 2016 Conferences - Confederated International Conferences: CoopIS, CandTC, and ODBASE 2016, Proceedings. Springer Verlag. 2016. p. 61-79. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-48472-3_4