For the most recent entries see the Petri Nets Newsletter.

Query Nets: Interacting Workflow Modules That Ensure Global Termination.

van Glabbeek, Rob J.; Stork, David G.

In: Volume 2678 of Lecture Notes in Computer Science, pages 184-199. January 2003.

Abstract: We address cross-organizational workflows, such as document workflows, 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.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography