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
Analyzing process models using graph reduction techniques
Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
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
From BPMN Process Models to BPEL Web Services
ICWS '06 Proceedings of the IEEE International Conference on Web Services
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
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
WorkflowNet2BPEL4WS: a tool for translating unstructured workflow processes to readable BPEL
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Applying Patterns during Business Process Modeling
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Automatic Workflow Graph Refactoring and Completion
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
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
Business Process Models as a Showcase for Syntax-Based Assistance in Diagram Editors
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Resolution of Compliance Violation in Business Process Models: A Planning-Based Approach
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
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 ICoP Framework: identification of correspondences between process models
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Journal of Visual Languages and Computing
Towards the ontology-based transformation of business process models
Proceedings of the 4th International Workshop on Semantic Business Process Management
Analysis on demand: Instantaneous soundness checking of industrial business process models
Data & Knowledge Engineering
Making task modeling suitable for stakeholder-driven workflow specifications
UAHCI'11 Proceedings of the 6th international conference on Universal access in human-computer interaction: design for all and eInclusion - Volume Part I
A semantic approach for business process model abstraction
CAiSE'11 Proceedings of the 23rd international conference on Advanced information systems engineering
Towards a compiler for business-IT systems: a vision statement complemented with a research agenda
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
Business process model abstraction: a definition, catalog, and survey
Distributed and Parallel Databases
BPMN process views construction
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
A comparative survey of business process similarity measures
Computers in Industry
Structuring acyclic process models
Information Systems
Efficient computation of causal behavioural profiles using structural decomposition
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
State propagation in abstracted business processes
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
From fine-grained to abstract process models: A semantic approach
Information Systems
Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
GiN: a graphical language and tool for defining itask workflows
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Matching business process workflows across abstraction levels
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Modeling and executing ConcurTaskTrees using a UML and SOIL-based metamodel
Proceedings of the 12th Workshop on OCL and Textual Modelling
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
Towards the next generation intelligent BPM: in the era of big data
BPM'13 Proceedings of the 11th international conference on Business Process Management
Hi-index | 0.00 |
We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a process modeled in a graph-based language such as BPMN into a process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modularand as fine as possible, where modularmeans that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes [11]. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan [3] that finds the triconnected components of a biconnected graph.