DocumentCode :
3174815
Title :
Bounded Model Checking for Web Service Discovery and Composition
Author :
Fang Zhi ; Liao Lejian ; Chen Ruoyu
Author_Institution :
Sch. of Comput. Sci. & Technol., Beijing Inst. of Technol., Beijing, China
fYear :
2010
fDate :
9-11 June 2010
Firstpage :
201
Lastpage :
206
Abstract :
With the acceptance of service-oriented architecture (SOA) in many application domains and the rapidly growing number of available services, it is now a challenge to effectively discover and compose services to meet user needs. In this paper, we present a novel technique for automatic service discovery and composition based on bounded model checking. Specifically, given (1) a client specification of the objective service, described by a linear temporal logic formula, and (2) a set of available services, our technique discoveries these services which behavior satisfies the client specification or synthesizes a composite service that uses only the available services to realize the client specification.
Keywords :
Web services; data mining; program verification; software architecture; SOA; Web service composition; Web service discovery; automatic service discovery; bounded model checking; linear temporal logic formula; service-oriented architecture; Application software; Artificial intelligence; Automata; Computer science; Distributed computing; Electronic government; Logic; Service oriented architecture; Software engineering; Web services; Bounded Model Checking; Web Service Composition; Web Service Discovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering Artificial Intelligence Networking and Parallel/Distributed Computing (SNPD), 2010 11th ACIS International Conference on
Conference_Location :
London
Print_ISBN :
978-1-4244-7422-6
Electronic_ISBN :
978-1-4244-7421-9
Type :
conf
DOI :
10.1109/SNPD.2010.38
Filename :
5521524
Link To Document :
بازگشت