Skip to main content

Query Nets: Interacting Workflow Modules That Ensure Global Termination

  • Conference paper
  • First Online:
Business Process Management (BPM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2678))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wil M. P. van der Aalst (1999): Interorganizational Workflows: An Approach Based on Message Sequence Charts and Petri Nets. Systems Analysis—Modelling—Simulation 34(3), pp. 335–367.

    MATH  Google Scholar 

  2. Wil M. P. van der Aalst & Kees M. van Hee (2002): Workflow Management: Models, Methods, and Systems. MIT Press.

    Google Scholar 

  3. Hartmann J. Genrich (1987): Predicate/Transition nets. In Wilfried Brauer, Wolfgang Reisig & Grzegorz Rozenberg, editors: Petri nets: Central Models and Their Properties, Advances in Petri nets 1986, Part I, LNCS 254, Springer, pp. 207–247.

    Chapter  Google Scholar 

  4. K. Gostellow, V. Cerf, G. Estrin & S. Volansky (1972): Proper Termination of Flow-of-control in Programs Involving Concurrent Processes. ACM Sigplan 7(11), pp. 15–27.

    Article  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 

  6. Ekkart Kindler, Axel Martens & Wolfgang Reisig (2000): Inter-operability of Workflow Applications: Local Criteria for Global Soundness. In Wil van der Aalst et al., editor: Business Process Management, LNCS 1806, Springer, pp. 235–253.

    Chapter  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/.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Glabbeek, R.J., Stork, D.G. (2003). Query Nets: Interacting Workflow Modules That Ensure Global Termination. In: van der Aalst, W.M.P., Weske, M. (eds) Business Process Management. BPM 2003. Lecture Notes in Computer Science, vol 2678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44895-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44895-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40318-0

  • Online ISBN: 978-3-540-44895-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics