Skip to main content

Object \(\pi \)-Calculus and Document Workflows

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9344))

Abstract

There are two basic approaches to business process modeling. One based on Petri nets, the other, newer, but with growing popularity, based on process algebras such as \(\pi \)-calculus. We have created a new variant of \(\pi \)-calculus which we call Object \(\pi \)-calculus. It has high level object oriented features such as method calls, mixins and additional process combinators. The calculus is of general interest, but it is particularly geared towards applications in business process modeling, especially document workflow modeling. Accordingly, we provide a proof-of-concept specification of a paper submission system in our dialect of \(\pi \)-calculus.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
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

Learn about institutional subscriptions

References

  1. Van der Aalst, W.M.: The application of Petri nets to workflow management. J. Circ. Syst. Comput. 8(01), 21–66 (1998)

    Article  Google Scholar 

  2. Van der Aalst, W.M.: Pi calculus versus Petri nets: Let us eat humble pie rather than further inflate the pi hype. BPTrends 3(5), 1–11 (2005)

    Google Scholar 

  3. Barkaoui, K., Boucheneb, H., Hicheur, A.: Modelling and analysis of time-constrained flexible workflows with time recursive ECATNets. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 19–36. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Barkaoui, K., Hicheur, A.: Towards analysis of flexible and collaborative workflow using recursive ECATNets. In: ter Hofstede, A.H.M., Benatallah, B., Paik, H.-Y. (eds.) BPM Workshops 2007. LNCS, vol. 4928, pp. 232–244. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Bergstra, J.A., Ponse, A., Smolka, S.A.: Handbook of Process Algebra. Elsevier, Amsterdam (2001)

    MATH  Google Scholar 

  6. Bettaz, M., Maouche, M.: How to specify non determinism and true concurrency with algebraic term nets. In: Bidoit, M., Choppy, C. (eds.) Abstract Data Types 1991 and COMPASS 1991. LNCS, vol. 655, pp. 164–180. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  7. Brogi, A., Canal, C., Pimentel, E., Vallecillo, A.: Formalizing web service choreographies. Electron. Notes Theor. Comput. Sci. 105, 73–94 (2004)

    Article  Google Scholar 

  8. De Nicola, R.: A gentle introduction to process algebras. Notes 7 (2014). https://goo.gl/ZkLOK1

  9. Fleischmann, A.: What Is S-BPM? In: Buchwald, H., Fleischmann, A., Seese, D., Stary, C. (eds.) S-BPM ONE 2009. CCIS, vol. 85, pp. 85–106. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099. Springer, Heidelberg (1996)

    Google Scholar 

  11. Goel, A., Choppella, V.: Algebraic modelling of educational workflows. In: 2012 IEEE Fourth International Conference on Technology for Education (T4E), pp. 153–156. IEEE (2012)

    Google Scholar 

  12. Haddad, S., Poitrenaud, D.: Modelling and analyzing systems with recursive Petri nets. In: Boel, R., Stremersch, G. (eds.) Discrete Event Systems, pp. 449–458. Springer, USA (2000)

    Chapter  Google Scholar 

  13. Kleine, M.: CSP as a coordination language. In: De Meuter, W., Roman, G.-C. (eds.) COORDINATION 2011. LNCS, vol. 6721, pp. 65–79. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Milner, R.: The Polyadic \(\pi \)-Calculus: A Tutorial. Springer, Heidelberg (1993)

    Google Scholar 

  15. Milner, R.: Communicating and Mobile Systems: The Pi Calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  16. Parrow, J.: An introduction to the \(\pi \)-calculus. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 479–543. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  17. Pierce, B., Sangiorgi, D.: Typing and subtyping for mobile processes. In: Proceedings of Eighth Annual IEEE Symposium on Logic in Computer Science, 1993, LICS 1993, pp. 376–385. IEEE (1993)

    Google Scholar 

  18. Puhlmann, F.: Why do we actually need the pi-calculus for business process management? BIS 85, 77–89 (2006)

    Google Scholar 

  19. Puhlmann, F., Weske, M.: Using the \(\pi \)-calculus for formalizing workflow patterns. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 153–168. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Puhlmann, F., Weske, M.: A look around the corner: the pi-calculus. In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets and Other Models of Concurrency II. LNCS, vol. 5460, pp. 64–78. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Raja, N., Shyamasundar, R.: Actors as a coordinating model of computation. In: Bjorner, D., Broy, M., Pottosin, I.V. (eds.) PSI 1996. LNCS, vol. 1181, pp. 191–202. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  22. Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets (1974)

    Google Scholar 

  23. Ryan, M.D., Smyth, B.: Applied pi calculus (2011)

    Google Scholar 

  24. Saeedloei, N., Gupta, G.: An extension of \(\pi \)-calculus with real-time and its realization in logic programming. In: Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012), p. 153 (2012)

    Google Scholar 

  25. Smith, H., Fingar, P.: Workflow is just a pi process. BPTrends, pp. 1–36, November 2003

    Google Scholar 

  26. Van Der Aalst, W.M., Ter Hofstede, A.H.: Yawl: yet another workflow language. Inf. Syst. 30(4), 245–275 (2005)

    Article  Google Scholar 

  27. Walker, D.: \(\pi \)-calculus semantics of object-oriented programming languages. In: Theoretical Aspects of Computer Software. pp. 532–547. Springer (1991)

    Google Scholar 

  28. Walker, D.: Objects in the \(\pi \)-calculus. Inf. Comput. 116(2), 253–271 (1995)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

I would like to thank the anonymous reviewers for their suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bartosz Zieliński .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zieliński, B., Sobieski, Ś., Kruszyński, P., Sysak, M., Maślanka, P. (2015). Object \(\pi \)-Calculus and Document Workflows. In: Bellatreche, L., Manolopoulos, Y. (eds) Model and Data Engineering. Lecture Notes in Computer Science(), vol 9344. Springer, Cham. https://doi.org/10.1007/978-3-319-23781-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23781-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23780-0

  • Online ISBN: 978-3-319-23781-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics