SCP-Trust Reasoning Strategy Based on Preference and Its Service Composition Process of Context-Aware Process


Before providing services to the user, user preference considerations are the key conditions to achieve the self-adaptive decision-making about service selection and composition process, which is the flexible concerned aspect provided by massive cloud computing environment data. Meanwhile, during the whole services’ providing process, achieving the capturing and forming of service aggregation units’ topology logic, building the context environment’s process-aware of service composition, ensuring the trust and adaptation among service aggregation units, which are the important reasons to express timely requirement preference. This paper designs SCP-Trust Reasoning strategy about the integration of user preference and trust, with process algebra, it is to achieve the context process-aware logic for service composition process, in order to improve the autonomous optimization and evolution of service implementation system.

Share and Cite:

Xia, X. , Yu, J. and Cao, B. (2014) SCP-Trust Reasoning Strategy Based on Preference and Its Service Composition Process of Context-Aware Process. Journal of Computer and Communications, 2, 38-45. doi: 10.4236/jcc.2014.29006.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] Zhang, J.-L. and Fan, Y.-S. (2010) Service-Oriented Enterprise and Business Ecosystem. Computer Integrated Manufacturing Systems, 16, 1751-1759.
[2] Xu, L.-D., Liu, H.-M., Wang, S., et al. (2009) Modeling and Analysis Techniques for Cross-Organizational Workflow Systems. Systems Research and Behavioral Science, 26, 367-389.
[3] Armbrust, M., Fox, A., Griffith, R., et al. (2010) A View of Cloud Computing. Communications of the ACM, 53, 50- 58.
[4] Zeng, L.Z., Benatallah, B., Hgu, A.H.H., et al. (2004) QoS-Aware Middleware for Web Services Composition. IEEE Trans on Software Engineering, 30, 311-327.
[5] Ardagna, D. and Pernici, B. (2005) Global and Local QoS Guarantee in Web Service Selection. Proceedings of Business Process Management Workshops, Springer, Berlin, 32-46.
[6] Yu, T. and Lin, K. (2005) Service Selection Algorithms for Composing Complex Services with Multiple Qos Constraints. Proceedings of the 3rd International Conference on Service Oriented Computing, Springer, Berlin, 130-143.
[7] Kormza, T. and Krunz, M. (2001) Multi-Constrained Optimal Path Selection. Proceedings of the 20th Joint Conference of IEEE Computer and Communications, Piscataway, 834-843.
[8] Canfora, G., Penta, M.D., Esposito, R., et al. (2005) An Approach for QoS-Ware Service Composition Based on Genetic Algorithms. Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, ACM, New York, 1069-1075.
[9] Fan, X.Q., Jiang, C.J., Fang, X.W., et al. (2010) Dynamic Web Service Selection Based on Discrete Particle Swarm Optimization. Journal of Computer Research and Development, 47, 147-156.
[10] Beynon, M. (2001) Reduces within the Variable Precision Rough Sets Model: A Further Investigation. European Journal of Operational Research, 134, 592-605.
[11] Pomykala, J. (1988) The Stone Algebra of Rough Sets. Bulletin of the Polish Academy of Sciences, 36, 495-507.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.