CPL+: An improved approach for evaluating the local completeness of event logs

Yang, Hu; Wen, Lijie; Wang, Jianmin; Wong, Raymond K.

doi:10.1016/j.ipl.2014.06.001

Cited by 8 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hee et al () overcome the problem of completeness checking by taking a probabilistic point of view, where a probabilistic lower bound for log completeness for three subclasses of Petri‐nets, namely, WF‐nets, T‐WF‐nets and S‐WF‐nets is provided. Yang et al () proposed an approach to evaluate the local completeness of an event log without knowing any information about the original process model and later in Yang, Wen, Wang, and Wong (), the approach was improved for estimating the local completeness of a log that contains a small number of traces precisely. However, in this paper, we do not investigate the completeness checking method for the newly proposed #TAR complete logs.…”

Section: Related Workmentioning

confidence: 99%

A novel completeness definition of event logs and corresponding generation algorithm

Wen

et al. 2020

Expert Systems

Self Cite

View full text Add to dashboard Cite

As the promotion of technologies and applications of Big Data, the research of business process management (BPM) has gradually deepened to consider the impacts and challenges of big business data on existing BPM technologies. Recently, parallel business process mining (e.g. discovering business models from business visual data, integrating runtime business data with interactive business process monitoring visualisation systems and summarising and visualising historical business data for further analysis, etc.) and multi‐perspective business data analytics (e.g. pattern detecting, decision‐making and process behaviour predicting, etc.) have been intensively studied considering the steep increase in business data size and type. However, comprehensive and in‐depth testing is needed to ensure their quality. Testing based solely on existing business processes and their system logs is far from sufficient. Large‐scale randomly generated models and corresponding complete logs should be used in testing. To test parallel algorithms for discovering process models, different log completeness and generation algorithms were proposed. However, they suffer from either state space explosion or non‐full‐covering task dependencies problem. Besides, most existing generation algorithms rely on random executing strategy, which leads to low and unstable efficiency. In this paper, we propose a novel log completeness type, that is, #TAR completeness, as well as its generation algorithm. The experimental results based on a series of randomly generated process models show that the #TAR complete logs outperform the state‐of‐the‐art ones with lower capacity, fuller dependencies covering and higher generating efficiency.

show abstract

Section: Related Workmentioning

confidence: 99%