#6378. Verification of composed web service using synthesized nondeterministic turing model (SNTMM) with multiple tapes and stacks

November 2026publication date
Proposal available till 06-06-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Sociology and Political Science;
Organizational Behavior and Human Resource Management;
Information Systems;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №6378.1 Contract №6378.2 Contract №6378.3 Contract №6378.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

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 services reachability in composing service for all possible input in parallel.
Keywords:
MTNTM; Multistacked nondeterministic turing machine; SNTMM; Synthesized nondeterministic turing machine model MSNTM; Web services composition

Contacts :
0