An algorithm of automatic workflow optimization
PROGRAMMING AND COMPUTER SOFTWARE | PLEIADES PUBLISHING INC | Published : 2012
This paper considers an algorithm of automatic workflow optimization that, unlike well-known redesign algorithms for workflows [1,2], can analyze arbitrary structures containing conditional branches and cycles. This algorithm operates with workflows without structural conflicts and, in the course of operation, uses execution conditions obtained as a result of application of the Boolean verification algorithm (BYA) proposed earlier in . A modified BYA is proposed and its computational complexity is estimated. © Pleiades Publishing, Ltd., 2012.