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.
목차
Abstract 1. Introduction 2. Description of Web Composite Service Problem 2.1. Finite Automaton 2.2. Web Service Barter Transaction System Structure 3. SMT Time Automaton 3.1. SMT Bounded Model Checking 3.2. M Model K Step Path Logic Formula 3.3. The Solution of SMT Logical Formula 4. Experiment and Result Analysis 4.1. Algorithm Model Checking 4.2. Web Service Application Experiment 5. Conclusion References
키워드
Satisfiability modulo theories (SMT)AutomatonWeb serviceModel checkingBig data
저자
Zhang Rui-Min [ Lanzhou Institute of Technology, Department of Software, Gansu, Lanzhou, 730050, China ]
Li Xiao-Bin [ Lanzhou Institute of Technology, Department of Software, Gansu, Lanzhou, 730050, China ]
보안공학연구지원센터(IJMUE) [Science & Engineering Research Support Center, Republic of Korea(IJMUE)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Multimedia and Ubiquitous Engineering
간기
월간
pISSN
1975-0080
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Multimedia and Ubiquitous Engineering Vol.11 No.3