QCCS: A formal model to enforce QoS requirements in service composition

First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, TASE '07

Volumn , Issue , 2007, Pages 389-398

  Sun, Meng ^a  

^a CWI   (Netherlands)

Author keywords

Q algebra; QCCS; QCTL; Quality of service; Quantified bisimulation

Indexed keywords

COMPUTER SIMULATION; COST FUNCTIONS; MATHEMATICAL MODELS; REQUIREMENTS ENGINEERING; SOFTWARE ENGINEERING; TELECOMMUNICATION SERVICES;

Q ALGEBRA; QCCS; QCTL; QUANTIFIED BISIMULATION;

QUALITY OF SERVICE;

EID: 34548818384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TASE.2007.37     Document Type: Conference Paper

References (26)

1. M. Bernardo and R. Gorrieri. A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1-54, 1998.
2. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. JACM, 44(2):201-236, 1997.
3. T. Chothia and J. Kleijn. Q-Automata: Modelling the Resource Usage of Concurrent Components. In Proceedings of FOCLASA 2006, ENTCS, 2006.
4. Y Deng, T. Chothia, C. Palamidessi, and J. Pang. Metrics for action-labelled quantitative transition systems. Electronic Notes in Theoretical Computer Science, 153:79-96, 2006.
5. G. Alonso and F. Casati and H. Kuno and V. Machiraju. Web Services - Concepts, Architectures and Applications. Springer-Verlag, 2004.
6. A. Gao, D. Yang, S. Tang, and M. Zhang. QoS-Driven Web Service Composition with Inter Service Conflicts. In X. Z. et al., editor, APWeb 2006, volume 3841 of LNCS, pages 121-132. Springer, 2006.
7. H. Hermanns. Interactive Markov Chains And the Quest for Quantified Quality, volume 2428 of LNCS. Springer, 2002.
8. H. Hermanns, U. Herzog, and J.-P. Katoen. Process algebra for performance evaluation. Theoretical Computer Science, 274:43-87, 2002.
9. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras: Between LOTOS and Markov Chains. Computer Networks ISDN Systems, 30(9/10):901-924, 1998.
10. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
11. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A Tool for Automatic Verification of Probabilistic Systems. In H. Hermanns and J. Palsberg, editor, Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of LNCS, pages 441-444. Springer, 2006.
12. D. Hirsch, A. Lluch-Lafuente, and E. Tuosto. A logic for application level qos. Electronic Notes in Theoretical Computer Science, 153:135-159, 2006.
13. D. Hirsch and E. Tuosto. SHReQ: A framework for coordinating application level qos. In B. Aichernig and B. Beckert, editors, SEFM2005, 3rd International Conference on Software Engineering and Formal Methods, pages 425-434. IEEE Computer Society Press, 2005.
14. G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315-352, 1995.
15. M. P. Papazoglou and D. Georgakopoulos. Service Oriented Computing. Comm. ACM, 46(10):25-28, 2003.
16. M. A. Marsan, G. Conte, and G. Balbo. A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems. ACM Transactions on Computer Systems, 2(2):93-122, 1984.
17. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
18. R. D. Nicola, G. Ferrari, U. Montanari, R. Pugliese, and E. Tuosto. A Formal Basis for Reasoning on Programmable QoS. In N. Dershowitz, editor, Verfication (Manna Festschrift), volume 2772 of LNCS, pages 436-479. Springer, 2003.
19. R. D. Nicola, G. Ferrari, U. Montanari, R. Pugliese, and E. Tuosto. A process calculus for qos-aware applications. In Coordination 2005, volume 3454 of LNCS, pages 33-48. Springer, 2005.
20. X. Nicollin and J.Sifakis. An overview and synthesis on timed process algebras. In J. W de Bakker, editor, RealTime: Theory in Practice, volume 600 of LNCS, pages 526-548. Springer, 1992.
21. D. Pym and C. Tofts. A calculus and logic of resources and processes. Formal Aspects of Computing, 2006.
22. R. A. Sahner and K. S. Trivedi. Performance and reliability analysis using directed acyclic graphs. IEEE Transactions on Software Engineering, 13(10): 1105-1114, 1987.
23. G. Salaün, L. Bordeaux, and M. Schaerf. Describing and Reasoning on Web Services using Process Algebra. In H. Jain and L. Liu, editors, Proceedings of the IEEE International Conference on Web Services (ICWS'04), pages 43-50. IEEE Computer Society, 2004.
24. M. Ying. Bisimulation indexes and their applications. Theoretical Computer Science, 275:1-68, 2002.
25. H. Yu and A. Vahdat. The Costs and Limits of Availability for Replicated Services. ACM Transactions on Computer Systems, 24(1):70-113, 2006.
26. T. Yu and K.-J. Lin. Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints. In B. Benatallah, F. Casati, and P. Traverso, editors, ICSOC 2005, volume 3826 of LNCS, pages 130-143. Springer, 2005.