Adjacent Matrix Based Deduction for Grid Workflow Applications

This paper presents an adjacent matrix based method for verifying and analyzing large scale workflows, which is used to find our three basic prosperities: sequential, parallel and simple mixing. Any workflow with the three characteristics can be grouped and deducted into smaller and even easier workflow. This reduction can also be used to figure out branches in complicated connected workflows. We exemplify our method using a real scientific workflow in our previous work. The analysis of reduced workflow can further facilitate the verification and validating process.