Journal
INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH
Volume 18, Issue 4, Pages 75-102Publisher
IGI GLOBAL
DOI: 10.4018/IJWSR.2021100104
Keywords
MTNTM; Multistacked Nondeterministic Turing Machine; SNTMM; Synthesized Nondeterministic Turing Machine Model MSNTM; Web Services Composition
Ask authors/readers for more resources
This paper proposes a synthesized non-deterministic turning machine model to verify composed web services for both deterministic and non-deterministic systems in parallel. By combining different turning machine models, this method is able to verify composite services in parallel for both deterministic and non-deterministic systems efficiently.
To verify the composed web services, a general view of what traits of a service need to be identified is still lacking. The existing verification model did not address any mechanism for getting alternative services if we failed to reach the desired service and partially concentrated on the reachability problem for a deterministic and non-deterministic system in sequential. This paper proposes a synthesised non-deterministic turing machine model (SNTMM) by combining the multistacked non-deterministic Turing machine (MSNTM) model and multitaped non-deterministic Turing machine (MTNTM) model to verify the composed web services for both deterministic and non-deterministic systems in parallel. The deceased transition and departed service marking algorithm have been proposed to address each participated service's reachability in composing service for all possible input in parallel. This article shows an example to demonstrate the meticulousness of the model. The experimental results show that the performance of the proposed model is measured efficiently.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available