In: J. Esparza, C. Lakos (Eds.): Lecture Notes in Computer Science, Vol. 2360: 23rd International Conference on Applications and Theory of Petri Nets, Adelaide, Australia, June 24-30, 2002, pages 1-121pp. Springer Verlag, June 2002.
Abstract: Workflow systems are reactive systems. They run in parallel with their environment. They respond to external events and produce events which again have certain effects in the environment. Most approaches in modeling workflow systems assume reasonable behavior of the environment. They disregard malicious requests such as e.g. denial-of-service attacks or hacker attacks trying to misuse the provided services. Hence they do not provide the modeler with a means to check whether their processes react robustly to any possible request from the environment. In this paper we will propose a means to overcome this deficiency. Based on the modeling with Workflow nets we will introduce a new correctness criterion, called non-controllable choice robustness. This criterion depicts the ability of a workflow system to react to possible requests from the environment and still guarantee some desired objective. For the definition and the algorithmical installment of non-controllable choice robustness parallels to Game Theory are drawn.