Query Nets: Interacting Workflow Modules That Ensure Global Termination
We address cross-organizational workflows, such as document work-flows, which consist of multiple workflow modules each of which can interact with others by sending and receiving messages. Our goal is to guarantee that the global workflow network has properties such as termination while merely requiring properties that can be checked locally in individual modules. The resulting query nets are based on predicate/transition Petri nets and implement formal constructs for business rules, thereby ensuring such global termination. Our method does not require the notion of a global specification, as employed by Kindler, Martens and Reisig.
Unable to display preview. Download preview PDF.
- 2.Wil M. P. van der Aalst & Kees M. van Hee (2002): Workflow Management: Models, Methods, and Systems. MIT Press.Google Scholar
- 5.Kurt Jensen (1994): An Introduction to the Theoretical Aspects of Coloured Petri Nets. In Jaco W. de Bakker, Willem-Paul de Roever & Grzegorz Rozenberg, editors: A Decade of Concurrency, LNCS 803, Springer, pp. 230–272. Available from http://www.daimi.au.dk/~kjensen/papers_books/rex.pdf.Google Scholar
- 7.Einar Smith (1998): Principles of High-level Petri Nets. In Wolfgang Reisig & Grzegorz Rozenberg, editors: Lectures on Petri nets I: Basic models, Advances in Petri nets, LNCS 1491, Springer, pp. 174–210.Google Scholar
- 8.Workflow Management Coalition (1995): The Workflow Reference Model. Available from http://www.wfmc.org/.