Translating Orc Features into Petri Nets and the Join Calculus

  • Roberto Bruni
  • Hernán Melgratti
  • Emilio Tuosto
Conference paper

DOI: 10.1007/11841197_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4184)
Cite this paper as:
Bruni R., Melgratti H., Tuosto E. (2006) Translating Orc Features into Petri Nets and the Join Calculus. In: Bravetti M., Núñez M., Zavattaro G. (eds) Web Services and Formal Methods. WS-FM 2006. Lecture Notes in Computer Science, vol 4184. Springer, Berlin, Heidelberg

Abstract

Cook and Misra’s Orc is an elegant language for orchestrating distributed services, able to cover e.g. van der Aalst’s workflow patterns. We aim to understand the key novel features of Orc by comparing it with variations of Petri nets. The comparison shows that Orc hides powerful mechanisms for name handling (creation and passing) and for atomic distributed termination. Petri nets with static topology can encode Orc under severe restrictions while the full language (up to a more realistic cancellation strategy) can be encoded in Join (that can be seen as a higher-order extension of Petri nets). As an overall result, we promote Join calculus as an elegant language embedding orchestration and computation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Roberto Bruni
    • 1
  • Hernán Melgratti
    • 2
  • Emilio Tuosto
    • 3
  1. 1.Computer Science DepartmentUniversity of PisaItaly
  2. 2.IMTLucca Institute for Advanced StudiesItalia
  3. 3.Department of Computer ScienceUniversity of LeicesterUK

Personalised recommendations