Process algebra
Graph transformation for specification and programming
Science of Computer Programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Advanced topics in term rewriting
Advanced topics in term rewriting
Introduction to Process Algebra
Introduction to Process Algebra
Handbook of Process Algebra
Distributed and Parallel Databases
Measuring the Distance to Series-Parallelity by Path Expressions
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
A new algorithm for the recognition of series parallel graphs
A new algorithm for the recognition of series parallel graphs
Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach
Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach
Business artifacts: An approach to operational specification
IBM Systems Journal
Large Scale Order Processing through Navigation Plan Concept
SCC '06 Proceedings of the IEEE International Conference on Services Computing
Using control-flow patterns for specifying business processes in cooperative environments
Proceedings of the 2007 ACM symposium on Applied computing
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Artifact-centered operational modeling: lessons from customer engagements
IBM Systems Journal
A New Paradigm for the Enactment and Dynamic Adaptation of Data-Driven Process Structures
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Applying Patterns during Business Process Modeling
BPM '08 Proceedings of the 6th International Conference on Business Process Management
COREPROSim: A Tool for Modeling, Simulating and Adapting Data-Driven Process Structures
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
On algebraic expressions of series-parallel and Fibonacci graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Soundness verification of business processes specified in the Pi-calculus
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Data-driven modeling and coordination of large process structures
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
BPM and SOA: synergies and challenges
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Process representation and reasoning using a logic formalism with object-oriented features
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Confluence of graph transformation revisited
Processes, Terms and Cycles
Hi-index | 0.00 |
Recently, a lot of work has been done on formalization of business process specification, in particular, using Petri nets and process algebra. However, these efforts usually do not explicitly address complex business process development, which necessitates the specification, coordination, and synchronization of a large number of business steps. It is imperative that these atomic tasks are associated correctly and monitored for countless dependencies. Moreover, as these business processes grow, they become critically reliant on a large number of split and merge points, which additionally increases modeling complexity. Therefore, one of the central challenges in complex business process modeling is the composition of dependent business steps. We address this challenge and introduce a formally correct method for automated composition of algebraic expressions in complex business process modeling based on acyclic directed graph reductions. We show that our method generates an equivalent algebraic expression from an appropriate acyclic directed graph if the graph is well-formed and series-parallel. Additionally, we encapsulate the reductions in an algorithm that transforms business step dependencies described by users into digraphs, recognizes structural conflicts, identifies Wheatstone bridges, and finally generates algebraic expressions.