Abstract
In the service-oriented environment, the composition of multiple web services is always used to satisfy the given request. To meet the request, the compositions of the services are various. Aim at such difficulty, described with the environment ontology, the relative theory of Petri net is proposed to build up the service composition requirement model. After simplify the model, an algorithm of building a reachability tree is proposed. Then all the possible service compositions are got through an algorithm similar as depth-first search. At last, we use the classic example of travel arrangement to verify the theory above all.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
