Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Free choice Petri nets
Optimizing compilers for modern architectures: a dependence-based approach
Optimizing compilers for modern architectures: a dependence-based approach
Conversion of control dependence to data dependence
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed and Parallel Databases
A Novel Graph Reduction Algorithm to Identify Structural Conflicts
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Applying Propositional Logic to Workflow Verification
Information Technology and Management
PGWFT: a petri net based grid workflow verification and optimization toolkit
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
An algorithm of automatic workflow optimization
Programming and Computing Software
| Hi-index | 0.00 |
Based on the workflow analysis graphs proposed in [1] and the well-known if-conversion method [2], a new algorithm of workflow verification is developed. This algorithm is based on the Boolean algebra principles, which is reflected in its name--Boolean Verification Algorithm (BVA). The BVA operates with arbitrary overlapping structures of the graph and with cycles. In the case of dense graphs, the time complexity of the algorithm does not exceed that of most other algorithms of workflow verification [3---6]. In the course of verification, the BVA determines an execution condition for each node of the graph, which makes it possible to create an additional algorithm of workflow optimization. Unlike the well-known algorithms of structural workflow optimization based on pattern transformations [7, 8], the proposed optimization algorithm allows for maximum (within a cycle) parallelization of workflows containing arbitrary overlapping structures.