A novel verification model for web services manoeuvring using hybrid automata

Service oriented architecture (SOA) is realised by independent, standardised and self-describing units known as services. Web service composition is the creation of new value added services by incorporating some existing web services together. For verifying the composed web services, a holistic view of what aspects of a service need to be specified is still lacking. A few research works have been carried out in the past for verifying the composed web services for a deterministic system. The existing verification model did not address the issues like departed transition and deadlocks recovery significantly. This paper proposes a hybrid automata (HA) model by combining the amend Muller automata (AMA) and push down automata (PDA) to verify the composed web services for both deterministic and non-deterministic systems. Departed transition and deadlock recovery algorithm has been proposed. We show an example to demonstrate the meticulousness of the model. The experimental results show that the performance of the proposed model is measured efficiently.