Abstract
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.
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.
