A process calculus for QoS-aware applications

Lecture Notes in Computer Science

Volumn 3454, Issue , 2005, Pages 33-48

  De Nicola, Rocco ^a   Ferrari, Gianluigi ^b   Montanari, Ugo ^b   Pugliese, Rosario ^a   Tuosto, Emilio ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; QUALITY OF SERVICE;

PROCESS CALCULUS; QUALITY OF SERVICE (QOS) CONSTRAINTS; SERVICE ORIENTED COMPUTING PARADIGM;

COMPUTATION THEORY;

EID: 24644520040     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417019_3     Document Type: Conference Paper

References (17)

1. M. Abadi and A. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1): 1-70, January 1999.
2. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201-236, March 1997.
3. L. Cardelli and D. Rowan. Service combinators for web computing. Software Engineering, 25(3):309-316, 1999.
4. R. De Nicola, G. Ferrari, U. Montanari, R. Pugliese, and E. Tuosto. A Formal Basis for Reasoning on Programmable QoS. In N. Dershowitz, editor, International Symposium on Verification - Theory and Practice - Honoring Zohar Manna's 64th Birthday, volume 2772 of Lecture Notes in Computer Science, pages 436 - 479. Springer-Verlag, 2003.
5. R. De Nicola, G. Ferrari, and R. Pugliese. KLAIM: A kernel language for agents interaction and mobility. IEEE/ACM Transactions on Networking, 24(5):315-330, 1998.
6. R. De Nicola, G. Ferrari, and R. Pugliese. Programming access control: The KLAIM experience. In International Conference in Concurrency Theory, Lecture Notes in Computer Science. Springer-Verlag, 2000.
7. R. De Nicola, G. Ferrari, R. Pugliese, and B. Venneri. Types for access control. Theoretical Computer Science, 240(1):215-254, June 2000.
8. G. Ferrari, U. Montanari, and E. Tuosto. Graph-based Models of Internetworking Systems. In T. Aichernig, Bernhard K. Maibaum, editor, Formal Methods at the Crossroads: from Panaces to Foundational Support, volume 2757 of Lecture Notes in Computer Science, pages 242 - 266. Springer-Verlag, 2003.
9. A. Igarashi and N. Kobayashi. A generic type system for the Pi-calculus. Theoretical Computer Science, 311(1-3):121-163, Jan. 2004.
10. N. Kobayashi. Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. D. Mosses, and T. Ito, editors, Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, Proceedings of the International IFIP Conference TCS 2000 (Sendai, Japan), volume 1872 of Lecture Notes in Computer Science, pages 365-389. IFIP, Springer-Verlag, Aug. 2000.
11. G. Meredith and S. Bjorg. Service-Oriented Computing: Contracts and Types. Communications of the ACM, 46(10):41 - 47, October 2003.
12. M. Mohri. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata Languages and Combinatorics, 7(3):321-350, 2002.
13. U. Nestmann and R. Fuzzati. Unreliable failure detectors with operational semantics. In Proc.ASIAN 2003, Lecture Notes in Computer Science. Springer-Verlag, 2003.
14. M. Papazouglou and D. Georgakopoulos. Special issue on service oriented computing. Communications of the ACM, 46(10), 2003.
15. C. Priami. Stochatic π-calculus. The Computer Journal, 38(6):578-589, 1995.
16. G. Theodorakopoulos and J. Baras. Trust Evaluation in AdHoc Networks. In WiSe '04: Proceedings of the 2004 ACM workshop on Wireless security, pages 1-10. ACM Press, 2004.
17. E. Tuosto. Non-Functional Aspects of Wide Area Network Programming. PhD thesis, Dipartimento di Informatica, Università di Pisa, May 2003. TD-8/03.