An automatic subdigraph renovation plan for failure recovery of composite semantic Web services

Saboohi, Hadi; Kareem, Sameem Abdul

doi:10.1007/s11704-013-2248-6

Cited by 6 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, with the increase in the number of nodes, the storage capacity will increase. [16] the SRPFR algorithm proposed in this work is an automatic subdigraph renovation plan for failure recovery. It consists of two steps: an offline and an online process.…”

Section: The Comparative Studymentioning

confidence: 99%

Web Service Composition in Dynamic Environment : A Comparative Study

AlSedrani¹,

Touir²

2016

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

show abstract

Section: The Comparative Studymentioning

confidence: 99%

Web Service Composition in Dynamic Environment : A Comparative Study

AlSedrani¹,

Touir²

2016

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

show abstract

“…Moreover, their adjacency matrices are exported as well. A set of composites generated were used in some researches [21]. 2 The extraction was performed using OWL-S API For all in-edges of ASWS 8:…”

Section: B Implementationmentioning

confidence: 99%

Enlarging Test Collections of Composite Semantic Services

Saboohi¹,

Amini²,

Herawan³

et al. 2015

IJCTE

Self Cite

View full text Add to dashboard Cite

Abstract-There are numerous methods which are proposed to mediate semantic Web services. The mediations of semantic services include their discovery, composition, execution, and monitoring. These are performed on both atomic and composite services. Newly proposed methods are required to be evaluated on a dataset. Despite the existence of atomic test collections of semantic services, the number of publicly available test collections containing composite services is not comparable. In this paper, we propose an approach to enlarge the number of composite services in a test collection. We generate new composites by calculating subdigraphs of available composite services. We evaluated our approach on a number of composite services and we could exponentially enlarge the size of test collections.

show abstract