{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:48:08Z","timestamp":1754156888763,"version":"3.41.2"},"reference-count":28,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T00:00:00Z","timestamp":1571356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BPMJ"],"published-print":{"date-parts":[[2019,10,18]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The refined process structure tree (RPST), the hierarchy of non-overlapping single-entry single-exit (SESE) regions of a process model, has been utilized for better comprehension and more efficient analysis of business process models. Existing RPST methods, based on the triconnected components of edges, fail to identify a certain type of SESE region. The purpose of this paper is to introduce an alternative method for generating a complete RPST utilizing rather simple techniques.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The proposed method first focuses on the SESE regions of bonds and rigids, from the innermost ones to the outermost ones, utilizing dominance and post-dominance relations. Then, any SESE region of a series nested in a bond or a rigid is identified with a depth-first search variation. Two-phase algorithms and their completeness proofs, a software tool incorporating visualization of stepwise outcomes, and the experimental results of the proposed method are provided.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The proposed method utilizes simple techniques that allow their straightforward implementation. Visualization of stepwise outcomes helps process analysts to understand the proposed method and the SESE regions. Experiments with 604 SAP reference models demonstrated the limitation of the existing RPST methods. The proposed method, however, completely identified all types of SESE regions, defined with nodes, in less computation time than with the old methods.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>Each triconnected component of the undirected version of a process model is associated with a pair of boundary nodes without discriminating between the entry and the exit. Here, each non-atomic SESE region is associated with two distinct entry and exit nodes from the original model in the form of a directed graph. By specifying the properties of SESE regions in more comprehensible ways, this paper facilitates a deeper understanding of SESE regions rather than relying on the resulting RPST.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/bpmj-11-2018-0319","type":"journal-article","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T05:24:04Z","timestamp":1571376244000},"page":"613-629","source":"Crossref","is-referenced-by-count":5,"title":["An alternative method for refined process structure trees (RPST)"],"prefix":"10.1108","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8605-4055","authenticated-orcid":false,"given":"Yongsun","family":"Choi","sequence":"first","affiliation":[]},{"given":"N. Long","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Pauline","family":"Kongsuwan","sequence":"additional","affiliation":[]},{"given":"Kwan Hee","family":"Han","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"edition":"2nd ed.","volume-title":"Compilers: Principles, Techniques, and Tools","year":"2006","key":"key2020030509312649200_ref001"},{"key":"key2020030509312649200_ref002","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.datak.2018.04.007","article-title":"Automated discovery of structured process models from event logs: the discover-and-structure approach","volume":"117","year":"2018","journal-title":"Data & Knowledge Engineering"},{"key":"key2020030509312649200_ref003","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.datak.2014.11.003","article-title":"Stepwise structural verification of cyclic workflow models with acyclic decomposition and reduction of loops","volume":"95","year":"2015","journal-title":"Data & Knowledge Engineering"},{"issue":"1-10","key":"key2020030509312649200_ref004","first-page":"1","article-title":"A simple, fast dominance algorithm","volume":"4","year":"2001","journal-title":"Software: Practice and Experience"},{"edition":"3rd ed.","volume-title":"Introduction to Algorithms","year":"2009","key":"key2020030509312649200_ref005"},{"volume-title":"SAP R\/3 Business Blueprint: Understanding the Business Process Reference Model","year":"1997","key":"key2020030509312649200_ref006"},{"key":"key2020030509312649200_ref007","doi-asserted-by":"crossref","unstructured":"Di Battista, G. and Tamassia, R. (1990), \u201cOn-line graph algorithms with SPQR-trees\u201d, in Paterson, M.S. (Ed.), Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, Vol. 443, Springer, Berlin, Heidelberg.","DOI":"10.1007\/BFb0032061"},{"issue":"4","key":"key2020030509312649200_ref008","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","article-title":"On-line maintenance of triconnected components with SPQR-trees","volume":"15","year":"1996","journal-title":"Algorithmica"},{"key":"key2020030509312649200_ref009","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.datak.2011.01.004","article-title":"Analysis on demand: instantaneous soundness checking of industrial business process models","volume":"70","year":"2011","journal-title":"Data & Knowledge Engineering"},{"key":"key2020030509312649200_ref010","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/6389567","article-title":"Detecting difference between process models based on the refined process structure tree","volume":"2017","year":"2017","journal-title":"Mobile Information Systems"},{"issue":"1","key":"key2020030509312649200_ref011","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.scico.2006.08.003","article-title":"What business process modelers can learn from programmers","volume":"65","year":"2007","journal-title":"Science of Computer Programming"},{"key":"key2020030509312649200_ref012","doi-asserted-by":"crossref","unstructured":"Gutwenger, C. and Mutzel, P. (2001), \u201cA linear time implementation of SPQR-trees\u201d, in Marks, J. (Ed), Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20-23, Springer, Berlin and Heidelberg, pp. 77-90.","DOI":"10.1007\/3-540-44541-2_8"},{"issue":"3","key":"key2020030509312649200_ref013","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","year":"1973","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"key2020030509312649200_ref014","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1108\/BPMJ-12-2015-0186","article-title":"A methodology for the semantic and structural restructuring of BPMN models","volume":"23","year":"2017","journal-title":"Business Process Management Journal"},{"key":"key2020030509312649200_ref015","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dss.2017.06.002","article-title":"Analyzing control flow information to improve the effectiveness of process model matching techniques","volume":"100","year":"2017","journal-title":"Decision Support Systems"},{"key":"key2020030509312649200_ref016","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.is.2014.11.010","article-title":"Detecting approximate clones in business process model repositories","volume":"49","year":"2015","journal-title":"Information Systems"},{"issue":"8","key":"key2020030509312649200_ref017","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TSE.2014.2327044","article-title":"Supporting process model validation through natural language generation","volume":"40","year":"2014","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"6","key":"key2020030509312649200_ref018","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.is.2011.10.005","article-title":"Structuring acyclic process models","volume":"37","year":"2012","journal-title":"Information Systems"},{"first-page":"110","article-title":"On application of structural decomposition for process model abstraction","year":"2009","key":"key2020030509312649200_ref019"},{"article-title":"Simplified computation and generalization of the refined process structure tree","year":"2010","key":"key2020030509312649200_ref020","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19589-1_2"},{"first-page":"106","article-title":"Towards a compendium of process technologies the jBPT library for process model analysis","year":"2013","key":"key2020030509312649200_ref021"},{"issue":"6","key":"key2020030509312649200_ref022","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1145\/236114.236115","article-title":"Identifying loops using DJ graphs","volume":"18","year":"1996","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"key2020030509312649200_ref023","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/567446.567456","article-title":"Prime subprogram parsing of a program","year":"1980"},{"issue":"9","key":"key2020030509312649200_ref024","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.datak.2009.02.015","article-title":"The refined process structure tree","volume":"68","year":"2009","journal-title":"Data Knowl Eng"},{"first-page":"43","article-title":"Faster and more focused control-flow analysis for business process models through SESE decomposition","year":"2007","key":"key2020030509312649200_ref025"},{"key":"key2020030509312649200_ref026","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/ICWS.2017.71","article-title":"FB-Diff: a feature based difference detection algorithm for process models","year":"2017"},{"first-page":"63","article-title":"Efficient computation of causal behavioural profiles using structural decomposition","year":"2010","key":"key2020030509312649200_ref027"},{"issue":"3-4","key":"key2020030509312649200_ref028","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-2011-614","article-title":"Causal behavioural profiles \u2013 efficient computation, applications, and evaluation","volume":"113","year":"2011","journal-title":"Fundamenta Informaticae"}],"container-title":["Business Process Management Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/BPMJ-11-2018-0319\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/BPMJ-11-2018-0319\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:16:29Z","timestamp":1753398989000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/bpmj\/article\/26\/2\/613-629\/257747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,18]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10,18]]}},"alternative-id":["10.1108\/BPMJ-11-2018-0319"],"URL":"https:\/\/doi.org\/10.1108\/bpmj-11-2018-0319","relation":{},"ISSN":["1463-7154"],"issn-type":[{"type":"print","value":"1463-7154"}],"subject":[],"published":{"date-parts":[[2019,10,18]]}}}