A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs
IEEE Transactions on Software Engineering
Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs
IEEE Transactions on Software Engineering
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
Reproducibility of the Empty Marking
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
On automating Web services discovery
The VLDB Journal — The International Journal on Very Large Data Bases
A snapshot of public web services
ACM SIGMOD Record
Framework for Web service query algebra and optimization
ACM Transactions on the Web (TWEB)
Deploying and managing Web services: issues, solutions, and directions
The VLDB Journal — The International Journal on Very Large Data Bases
Editorial: The Semantic Web and Web Services
Information Systems
Logical reasoning and Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Lower bounds for three algorithms for the transversal hypergraph generation
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
QoS-Aware Web Service Configuration
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Symbolic model checking composite Web services using operational and control behaviors
Expert Systems with Applications: An International Journal
Petri net based techniques for constructing reliable service composition
Journal of Systems and Software
Hi-index | 12.06 |
This paper introduces an automatic Web service composition method based on logical inference of Horn clauses and Petri nets. The Web service composition problem is transformed into the logical inference problem of Horn clauses by exploring the dependency relations among services. An algorithm is presented, to determine whether the composite service exists in time that is linear in the size of the knowledge base. It can also return the rule set necessary for the composition. Petri nets are chosen to model the rule set and its structural analysis techniques are used to obtain the composite service.