The program structure tree: computing control regions in linear time
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Efficient program analysis using dependence flow graphs
Efficient program analysis using dependence flow graphs
SAP R/3 business blueprint: understanding the business process reference model
SAP R/3 business blueprint: understanding the business process reference model
Prime subprogram parsing of a program
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Parsing flowcharts and series-parallel graphs.
Parsing flowcharts and series-parallel graphs.
Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Applying Patterns during Business Process Modeling
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Detecting and Resolving Process Model Differences in the Absence of a Change Log
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Pattern Identification and Classification in the Translation from BPMN to BPEL
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Automatic Workflow Graph Refactoring and Completion
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
The refined process structure tree
Data & Knowledge Engineering
The Triconnected Abstraction of Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Instantaneous Soundness Checking of Industrial Business Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Unveiling Hidden Unstructured Regions in Process Models
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
The biconnected verification of workflow nets
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Identifying refactoring opportunities in process model repositories
Information and Software Technology
Clone detection in repositories of business process models
BPM'11 Proceedings of the 9th international conference on Business process management
Structuring acyclic process models
Information Systems
Optimization of complex qos-aware service compositions
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Generalized aggregate Quality of Service computation for composite services
Journal of Systems and Software
Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Generating natural language texts from business process models
CAiSE'12 Proceedings of the 24th international conference on Advanced Information Systems Engineering
Matching business process workflows across abstraction levels
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Approximate clone detection in repositories of business process models
BPM'12 Proceedings of the 10th international conference on Business Process Management
Isotactics as a foundation for alignment and abstraction of behavioral models
BPM'12 Proceedings of the 10th international conference on Business Process Management
An optimized derivation of event queries to monitor choreography violations
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Data support in process model abstraction
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Simplifying discovered process models in a controlled manner
Information Systems
Fast detection of exact clones in business process model repositories
Information Systems
Hierarchical conformance checking of process models based on event logs
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Discovering block-structured process models from event logs - a constructive approach
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Conformance checking in the large: partitioning and topology
BPM'13 Proceedings of the 11th international conference on Business Process Management
Decomposing Petri nets for process mining: A generic approach
Distributed and Parallel Databases
Process Discovery and Conformance Checking Using Passages
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
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.