Event Structure Semantics of Orc

  • Sidney Rosario
  • David Kitchin
  • Albert Benveniste
  • William Cook
  • Stefan Haar
  • Claude Jard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4937)


Developing wide-area distributed applications requires jointly analyzing functional and Quality of Service (QoS) aspects, such as timing properties. Labelled transition systems and sequential trace semantics - the common semantic domains - do not facilitate this kind of analysis because they do not precisely express the causal relationships between events. Asymmetric Event Structures (AES) provide an explicit representation of the causal dependencies between events in the execution of a system and allow for an elegant coding of preemption. Event structures are, however, difficult to construct compositionally, because they cannot easily represent fragments of a computation. The heaps we develop here allow for such a representation, and easily generate AES. In this paper, we develop a partial-order semantics in terms of heaps, for Orc, an orchestration language used to describe distributed computations over the internet. We briefly show how Orc, and this new semantics, are used for QoS studies of wide area orchestrations.


Event Structure Operational Semantic Label Transition System Publication Event Orchestration Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Van Der Aalst, W.M.P., Ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow patterns. Distrib. Parallel Databases 14(1), 5–51 (2003)CrossRefGoogle Scholar
  2. 2.
    Arias-Fisteus, J., Fernández, L.S., Kloos, C.D.: Applying model checking to BPEL4WS business collaborations. In: SAC, pp. 826–830 (2005)Google Scholar
  3. 3.
    Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, Asymmetric Event Structures, and Processes. Inf. Comput. 171(1), 1–49 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Best, E., Devillers, R.R., Koutny, M.: The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178(1), 44–100 (2002)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Bhoj, P., Singhal, S., Chutani, S.: SLA management in federated environments. Computer Networks 35(1), 5–24 (2001)CrossRefGoogle Scholar
  6. 6.
    Bruni, R., Melgratti, H.C., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 295–309. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Bruni, R., Melgratti, H.C., Tuosto, E.: Translating Orc Features into Petri Nets and the Join Calculus. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 123–137. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Cook, W.R., Patwardhan, S., Misra, J.: Workflow patterns in orc. In: Ciancarini, P., Wiklicky, H. (eds.) COORDINATION 2006. LNCS, vol. 4038, pp. 82–96. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Dong, J.S., Liu, Y., Sun, J., Zhang, X.: Verification of Computation Orchestration via Timed Automata. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 226–245. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s Unfolding Algorithm. Formal Methods in System Design 20(3), 285–310 (2002)zbMATHCrossRefGoogle Scholar
  11. 11.
    Keller, A., Ludwig, H.: The wsla framework: Specifying and monitoring service level agreements for web services. J. Network Syst. Manage 11(1) (2003)Google Scholar
  12. 12.
    Kitchin, D., Cook, W.R., Misra, J.: A language for task orchestration and its semantic properties. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 477–491. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Ouyang, C., Verbeek, E., van der Aalst, W.M.P., Breutel, S.: Formal Semantics and Analysis of Control Flow in WS-BPEL. BPM Center Report BPM-05-15, (2005)Google Scholar
  14. 14.
    Puhlmann, F., Weske, M.: Using the pi-Calculus for Formalizing Workflow Patterns. In: Business Process Management, pp. 153–168 (2005)Google Scholar
  15. 15.
    Rosario, S., Benveniste, A., Haar, S., Jard, C.: Foundations for Web Services Orchestrations: functional and QoS aspects. In: Proceedings ISOLA (2006)Google Scholar
  16. 16.
    Rosario, S., Benveniste, A., Haar, S., Jard, C.: Probabilistic QoS and soft contracts for transaction based web services. In: ICWS, pp. 126–133 (2007)Google Scholar
  17. 17.
    Rosario, S., Kitchin, D., Benveniste, A., Cook, W., Haar, S., Jard, C.: Event Structure Semantics of Orc. IRISA Internal Report No 1853 (June 2007), available for download at:
  18. 18.
    van der Aalst, W.M.P., Basten, T.: Life-Cycle Inheritance: A Petri-Net-Based Approach. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 62–81. Springer, Heidelberg (1997)Google Scholar
  19. 19.
    Winskel, G.: Event Structures.. In: Advances in Petri Nets, pp. 325–392 (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sidney Rosario
    • 1
  • David Kitchin
    • 3
  • Albert Benveniste
    • 1
  • William Cook
    • 3
  • Stefan Haar
    • 4
  • Claude Jard
    • 2
  1. 1.Irisa/InriaRennes cedexFrance
  2. 2.Irisa/ENS CachanRennes cedexFrance
  3. 3.Department of Computer SciencesThe University of Texas at AustinAustinUSA
  4. 4.Irisa/Inria Rennes and SITEUniversity of OttawaCanada

Personalised recommendations