Job division in service oriented computing based on time aspect

Amirjavid, Farzad; Mcheick, Hamid; Dbouk, Mohamed

doi:10.1504/ijcnds.2011.037330

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

Publication Types

Select...

Book1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Srivastava and J. Koehler). Every service consists of a domain of computers and computers in a domain can just communicate with each other through predefined functions (Amirjavid F. et al, 2011). Services can be invoked by other services or applications.…”

Section: Introductionmentioning

confidence: 99%

Intelligent Web Based on Mathematic Theory

Karawash

Mcheick

Dbouk

2013

Computer and Information Science

Self Cite

View full text Add to dashboard Cite

This paper discusses a model for verifying service composition by building a distributed semi-compiler of service process. In this talk, we introduce a technique that solves the service composition problems such as infinite loops,deadlock and replicate use of the service. Specifically, the client needs to build a composite service by invoking other services but without knowing the exact design of these loosely coupled services. The proposed Distributed Global Service Compiler, by this article, results dynamically from the business process of each service. As a normal compiler cannot detect loops, we apply a graph theory algorithm, a Depth First Search, on the deduced result taken from business process files.

show abstract

Section: Introductionmentioning

confidence: 99%