Architecture of Dynamic Service Composition Using Logic Petri Nets
Xia Jiang, Bing Wu, Yuyue Du
DOI: 10.4236/jsea.2011.410068   PDF    HTML     4,154 Downloads   7,594 Views   Citations

Abstract

Services are preprocessed based on clustering techniques in the levels of function and similarily of services. Service clustering is modeled by means of the passing value indeterminacy of logic Petri nets. Thus service clustering can be described, and the services with indeterminacy parameters can be modeled formally. Thus service composition is investigated under the classified architecture of service clustering. The architecture of dynamic service composition is given, and logic Petri nets are used for service realization. Services can be combined rapidly and automatically, and the path of a composition service can be constructed by automatic inference.

Share and Cite:

Jiang, X. , Wu, B. and Du, Y. (2011) Architecture of Dynamic Service Composition Using Logic Petri Nets. Journal of Software Engineering and Applications, 4, 585-589. doi: 10.4236/jsea.2011.410068.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] S. Rajagopal and S. T. Selvi, “Semantic Grid Service Discovery Approach Using Clustering of Service Ontologies,” Proceedings of IEEE TENCON, Hong Kong, 14-17 November 2006, pp. 1-4.
[2] S. Ram, Y. Hwang and H. Zhao, “A Clustering Based Approach for Facilitating Semantic Web Service Discovery,” Proceedings of the 15th Annual Workshop on Information Technologies & Systems, Las Vegas, 10-11 March 2006, pp. 1-6.
[3] R. Nayak and B. Lee, “Web Service Discovery with Additional Semantics and Clustering,” Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, Washington DC, 2-5 November 2007, pp. 555-558.
[4] P. Sun and C. Jiang, “Using Service Clustering to Facilitate Process-Oriented Semantic Web Service Discovery,” Chinese Journal of Computers, Vol. 31, No. 8, 2008, pp. 1340-1353.
[5] Y. Y. Du and B. Q. Guo, “Logic Petri Nets and Equivalency,” Information Technology Journal, Vol. 8, No. 1, 2009, pp. 95-100. doi:10.3923/itj.2009.95.100
[6] Y. Y. Du and C. J. Jiang, “Formal Representation and Analysis of Batch Stock Trading Systems by Logical Petri Net Workflows,” Lecture Notes in Computer Science, Vol. 2495, 2002, pp. 221-225.
[7] Y. Y. Du and C. J. Jiang, “Towards a Workflow Model of Real-Time Cooperative Systems,” Lecture Notes in Computer Science, Vol. 2885, 2003, pp. 452-470.
[8] Y. Y. Du, C. J. Jiang and M. C. Zhou, “Modeling and Analysis of Real-Time Cooperative Systems Using Petri Nets,” IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, Vol. 37, No. 5, 2007, pp. 643-654. doi:10.1109/TSMCA.2007.902622
[9] W. Liu and Y. Y. Du, “Modeling Multimedia Synchronization Using Petri Nets,” Information Technology Journal, Vol. 8, No. 7, 2009, pp. 1054-1058. doi:10.3923/itj.2009.1054.1058
[10] Y. Y. Du and C. J. Jiang, “On the Design and Temporal Petri Net Verification of Grid Commerce Architecture,” Chinese Journal of Electronics, Vol. 17, No. 2, 2008, pp. 247-251.
[11] W. Luo, X. Qin, X.-C. Tan, K. Qin and A. Manzanares, “Exploiting Redundancies to Enhance Schedulability in Fault-Tolerant and Real-Time Distributed Systems,” IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, Vol. 39, No. 3, 2009, pp. 626-639. doi:10.1109/TSMCA.2009.2013192
[12] A. L. Feller, T. Wu, D. L. Shunk and J. Fowler. “Petri Net Translation Patterns for the Analysis of Ebusiness Collaboration Messaging Protocols,” IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, Vol. 39, No. 5, 2009, pp. 1022-1034. doi:10.1109/TSMCA.2009.2025022
[13] D. X. Xia, X. Y. Xie and Y. Xu, “With an Application to Workflow Management Based on Colored Petri Net,” Proceedings of 3rd International Conference on Anti-counterfeiting, Security, and Identification in Communication, Hong Kong, 20-22 August, 2009, pp. 596-599.

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.