Journal of System Simulation ›› 2016, Vol. 28 ›› Issue (9): 2283-2288.

Previous Articles    

SMT Bounded Constrained Non Centralized Automaton Web Service Model Checking

Wei Rong1, Shen Xibing1, Yang Yi2   

  1. 1. College of Humanities , Qinzhou University, Qinzhou 535000, China;
    2. College of Software, Guangxi University of Science and Technology, Liuzhou 545006, China
  • Received:2015-06-10 Revised:2015-07-24 Online:2016-09-08 Published:2020-08-14

Abstract: In model checking for web services applications, the combination of traditional finite state machine cannot guarantee the correctness of web service composition, a method of non centralized automaton model for web service detection algorithm was put forward,based on which could meet of mode theory (satisfiability modulo of the nanocomposite, SMT). The SMT was used to detect the bounded model of timed automata, and the time automaton was directly converted into SMT identifiable logic formula and was solved; using the SMT timed automata theory, implementation of employee travel arrangements for composite web service was modeled and verified. Through the example analysis, verification of the algorithm in the lifting path deadlocks and network parameters optimization is effective.

Key words: satisfiability modulo theories, automata, Web service, model checking, big data

CLC Number: