Uniform verification of workflow soundness

The development of work process-oriented applications in various domains leads to workflow systems where a large number of flow instances run concurrently. A challenging problem is to provide methods for the uniform verification of these parameterized workflows, ie, proving the soundness of the workflow for any number of instances. In this paper, we show the ability of structure theory of Petri nets to conduct a uniform verification for large subclasses of parameterized workflow nets modelling control flow patterns associated with complex synchronization mechanisms, routing constructs and resource allocation constraints. We can take advantage of these results in domains where collaborative activities and competition for resources are preponderant such as agile manufacturing systems, web service applications or grid computing.