TY - GEN
T1 - ExRORU
T2 - Confederated International Conference On the Move to Meaningful Internet Systems, OTM 2016 held in conjunction with Conferences on CoopIS, CandTC and ODBASE 2016
AU - Wang, Shuhao
AU - Wen, Lijie
AU - Kumar, Akhil
AU - Wang, Jianmin
AU - Su, Jianwen
N1 - Publisher Copyright:
© Springer International Publishing AG 2016.
PY - 2016
Y1 - 2016
N2 - A recent paper has proposed new ordering relations with uncertainty between the executions of tasks in acyclic process models. However, this approach cannot work for cyclic process models and those with silent transitions and non-free-choice constructs. In practice most non-trivial process models contain cycles and about 10% to 20% have also non-free-choice constructs. In this paper, we show how to overcome these problems by a refinement of the relations (i.e., extended refined ordering relations with uncertainty, ExRORU for short). All these relations can uniquely detect the behavioral differences between any pair of process models and can also be computed efficiently based on the complete prefix unfolding of a process model. Experiments on real-life and synthesized process models show that ExRORU is both effective and scalable.
AB - A recent paper has proposed new ordering relations with uncertainty between the executions of tasks in acyclic process models. However, this approach cannot work for cyclic process models and those with silent transitions and non-free-choice constructs. In practice most non-trivial process models contain cycles and about 10% to 20% have also non-free-choice constructs. In this paper, we show how to overcome these problems by a refinement of the relations (i.e., extended refined ordering relations with uncertainty, ExRORU for short). All these relations can uniquely detect the behavioral differences between any pair of process models and can also be computed efficiently based on the complete prefix unfolding of a process model. Experiments on real-life and synthesized process models show that ExRORU is both effective and scalable.
UR - http://www.scopus.com/inward/record.url?scp=84995873390&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84995873390&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-48472-3_18
DO - 10.1007/978-3-319-48472-3_18
M3 - Conference contribution
AN - SCOPUS:84995873390
SN - 9783319484716
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 318
EP - 326
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
Y2 - 24 October 2016 through 28 October 2016
ER -