Model Checking of Non-centralized Automaton Web Service

Abstract

In view of the web service model checking application, the combination mode of traditional finite state machines cannot guarantee the correctness of Web composite service. A web service model diction algorithm of non-centralized automaton based on satisfiability modulo theories (SMT) is proposed. First, SMT is used for bounded model checking of time automaton, and the time automaton model is directly converted into logical formula that can be identified by SMT, to make solution; secondly, the proposed SMT time automaton theory is used to achieve the employee travel arrangements web services for modeling and verification; finally, through an example analysis, the effectiveness of the algorithm on the termination of the path deadlock and the optimization of network parameters.