Skip to main content

A Process Calculus for QoS-Aware Applications

  • Conference paper
Coordination Models and Languages (COORDINATION 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3454))

Included in the following conference series:

  • 345 Accesses

Abstract

The definition of suitable abstractions and models for identifying, understanding and managing Quality of Service (QoS) constraints is a challenging issue of the Service Oriented Computing paradigm. In this paper we introduce a process calculus where QoS attributes are first class objects. We identify a minimal set of primitives that allow capturing in an abstract way the ability to control and coordinate services in presence of QoS constraints.

Work partially supported by EU-FET Project AGILE, EU-FET Project MIKADO, EU-FET Project PROFUNDIS, and MIUR project SP4 Architetture Software ad Alta Qualità di Servizio per Global Computing su Cooperative Wide Area Networks.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abadi, M., Gordon, A.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation 148(1), 1–70 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cardelli, L., Rowan, D.: Service combinators for web computing. Software Engineering 25(3), 309–316 (1999)

    Article  Google Scholar 

  4. De Nicola, R., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E.: A Formal Basis for Reasoning on Programmable QoS. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 436–479. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE/ACM Transactions on Networking 24(5), 315–330 (1998)

    Google Scholar 

  6. De Nicola, R., Ferrari, G., Pugliese, R.: Programming access control: The KLAIM experience. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 48. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. De Nicola, R., Ferrari, G., Pugliese, R., Venneri, B.: Types for access control. Theoretical Computer Science 240(1), 215–254 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ferrari, G., Montanari, U., Tuosto, E.: Graph-based Models of Internetworking Systems. In: Aichernig, B.K., Maibaum, T. (eds.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 242–266. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. Theoretical Computer Science 311(1–3), 121–163 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kobayashi, N.: Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 365–389. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Meredith, G., Bjorg, S.: Service-Oriented Computing: Contracts and Types. Communications of the ACM 46(10), 41–47 (2003)

    Article  Google Scholar 

  12. Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata Languages and Combinatorics 7(3), 321–350 (2002)

    MathSciNet  MATH  Google Scholar 

  13. Nestmann, U., Fuzzati, R.: Unreliable failure detectors with operational semantics. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 54–71. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Papazouglou, M., Georgakopoulos, D.: Special issue on service oriented computing. Communications of the ACM 46(10) (2003)

    Google Scholar 

  15. Priami, C.: Stochatic π-calculus. The Computer Journal 38(6), 578–589 (1995)

    Article  Google Scholar 

  16. Theodorakopoulos, G., Baras, J.: Trust Evaluation in AdHoc Networks. In: WiSe 2004: Proceedings of the 2004 ACM workshop on Wireless security, pp. 1–10. ACM Press, New York (2004)

    Chapter  Google Scholar 

  17. Tuosto, E.: Non-Functional Aspects of Wide Area Network Programming. PhD thesis, Dipartimento di Informatica, Università di Pisa, TD-8/03 (May 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Nicola, R., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E. (2005). A Process Calculus for QoS-Aware Applications. In: Jacquet, JM., Picco, G.P. (eds) Coordination Models and Languages. COORDINATION 2005. Lecture Notes in Computer Science, vol 3454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11417019_3

Download citation

  • DOI: https://doi.org/10.1007/11417019_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25630-4

  • Online ISBN: 978-3-540-32006-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics