Simplified computation and generalization of the refined process structure tree

Polyvyanyy, Artem, Vanhatalo, Jussi, & Völzer, Hagen (2011) Simplified computation and generalization of the refined process structure tree. In Bravetti, Mario & Bultan, Tevfik (Eds.) Lecture Notes in Computer Science : Web Services and Formal Methods, Springer Berlin Heidelberg, Hoboken, NJ, USA, pp. 25-41.

View at publisher

Abstract

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

Impact and interest:

10 citations in Scopus
Search Google Scholar™
16 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

10 since deposited on 30 Apr 2014
8 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 70726
Item Type: Conference Paper
Refereed: Yes
Additional Information: Book Subtitle:
7th International Workshop, WS-FM 2010, Hoboken, NJ, USA, September 16-17, 2010. Revised Selected Papers
Additional URLs:
DOI: 10.1007/978-3-642-19589-1_2
ISBN: 9783642195884
ISSN: 0302-9743
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > DISTRIBUTED COMPUTING (080500)
Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600)
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2011 Springer-Verlag Berlin Heidelberg
Copyright Statement: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-19589-1_2
Deposited On: 30 Apr 2014 00:40
Last Modified: 06 Sep 2016 05:10

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page