article · 2010

Ayed, R.: Uniform verification of workflow soundness

Kamel Barkaoui, Rahma Ben Ayed

Cited by 0Abstract and details only

Abstract

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. Key words: soundness; structure theory of Petri nets; uniform verification; workflow nets. 1.

Cite this paper

APA 7

Barkaoui, K., & Ayed, R. B. (2010). Ayed, R.: Uniform verification of workflow soundness.

MLA 9

Barkaoui, Kamel, and Rahma Ben Ayed. “Ayed, R.: Uniform verification of workflow soundness.” 2010.

Chicago

Barkaoui, Kamel, and Rahma Ben Ayed. 2010. “Ayed, R.: Uniform verification of workflow soundness.”

Harvard

Barkaoui, K. and Ayed, R.B. (2010) ‘Ayed, R.: Uniform verification of workflow soundness’.

BibTeX

@article{barkaoui2010ayed,
  title = {{Ayed, R.: Uniform verification of workflow soundness}},
  author = {Barkaoui, Kamel and Ayed, Rahma Ben},
  year = {2010}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.