id: 06107900
dt: j
an: 06107900
au: Kalenkova, A.A.
ti: An algorithm of automatic workflow optimization.
so: Program. Comput. Softw. 38, No. 1, 43-56 (2012); translation from
    Programmirovanie 38, No. 1 (2012).
py: 2012
pu: MAIK Nauka/Interperiodica Publishing, Moskva; Springer, New York
la: EN
cc: 
ut: automatic workflow optimization; Boolean verification algorithm;
    computational complexity
ci: 
li: doi:10.1134/S0361768812010045
ab: Summary: This paper considers an algorithm for automatic workflow
    optimization that, unlike well-known redesign algorithms for workflows,
    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 (BVA) proposed earlier in [the author, Program. Comput.
    Softw. 36, No. 5, 276‒288 (2010); translation from Programmirovanie
    36, No. 5 (2010; Zbl 06107880)]. A modified BVA is proposed and its
    computational complexity is estimated.
rv: