On Observing Dynamic Prioritised Actions in SOC

  • Rosario Pugliese
  • Francesco Tiezzi
  • Nobuko Yoshida
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5556)


We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and weak labelled bisimilarities for COWS, a process calculus for SOC, and provide alternative characterisations in terms of open barbed bisimilarities. These semantics show that COWS’s priority mechanisms partially recover the capability to observe receive actions (that could not be observed in a purely asynchronous setting) and that high priority primitives for termination impose specific conditions on the bisimilarities.


Operational Semantic Kill Activity Parallel Composition Service Instance Great Priority 
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.
    Amadio, R.M., Castellani, I., Sangiorgi, D.: On Bisimulations for the Asynchronous pi-Calculus. Theoretical Computer Science 195(2), 291–324 (1998)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bhat, G., Cleaveland, R., Lüttgen, G.: A Practical Approach to Implementing Real-Time Semantics. Annals of Software Engineering 7, 127–155 (1999)CrossRefGoogle Scholar
  3. 3.
    Bruni, R., Lanese, I., Melgratti, H., Tuosto, E.: Multiparty sessions in SOC. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 67–82. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Cleaveland, R., Lüttgen, G., Natarajan, V.: Priorities in process algebra. In: Handbook of Process Algebra, pp. 391–424 (2001)Google Scholar
  5. 5.
    Fecher, H.: A Real-Time Process Algebra with Open Intervals and Maximal Progress. Nordic Journal of Computing 8(3), 346–365 (2001)MathSciNetMATHGoogle Scholar
  6. 6.
    Francalanza, A., Hennessy, M.: A theory for observational fault tolerance. Journal of Logic and Algebraic Programming 73(1-2), 22–50 (2007)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Honda, K., Tokoro, M.: An Object Calculus for Asynchronous Communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  8. 8.
    Honda, K., Yoshida, N.: On Reduction-Based Process Semantics. Theoretical Computer Science 151(2), 437–486 (1995)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Lanese, I., et al.: Disciplining Orchestration and Conversation in Service-Oriented Computing. In: SEFM, pp. 305–314. IEEE, Los Alamitos (2007)Google Scholar
  10. 10.
    Lapadula, A., Pugliese, R., Tiezzi, F.: A calculus for orchestration of web services. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 33–47. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Milner, R., Sangiorgi, D.: Barbed Bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  12. 12.
    Sangiorgi, D., Walker, D.: On Barbed Equivalences in pi-Calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 292–304. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Tiezzi, F.: Specification and Analysis of Service-Oriented Applications. PhD Thesis, Univ. Florence (2009); http://rap.dsi.unifi.it/cows/theses/tiezzi_phdthesis.pdf

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Rosario Pugliese
    • 1
  • Francesco Tiezzi
    • 1
  • Nobuko Yoshida
    • 2
  1. 1.Dipartimento di Sistemi e InformaticaUniversità degli Studi di FirenzeItaly
  2. 2.Department of ComputingImperial College LondonUK

Personalised recommendations