A Model Checking Approach to Analyzing Timed Compatibility in Mediation-Aided Composition of Web Services

Author(s):  
Yanhua Du ◽  
Benyuan Yang ◽  
Wei Tan
Keyword(s):  
2013 ◽  
Vol 10 (4) ◽  
pp. 62-81 ◽  
Author(s):  
Ehtesham Zahoor ◽  
Kashif Munir ◽  
Olivier Perrin ◽  
Claude Godart

In this paper, we propose a bounded model-checking based approach for the verification of declarative Web services composition processes using satisfiability solving (SAT). The need for the bounded model-checking approach stems from the nature of declarative processes as they are defined by only specifying the constraints that mark the boundary of the solution to the composition process. The proposed approach relies on using Event Calculus (EC) as the modeling formalism with a sound and complete EC to SAT encoding process. The use of EC as the modeling also formalism allows for a highly expressive approach for both the specification of composition model and for the specification of verification properties. Furthermore, as the conflict clauses returned by the SAT solver can be significantly large for complex processes and verification requirements, we propose a filtering criterion and defined patterns for identifying the clauses of interest for process verification.


2005 ◽  
Vol 126 ◽  
pp. 3-26 ◽  
Author(s):  
Holger Schlingloff ◽  
Axel Martens ◽  
Karsten Schmidt
Keyword(s):  

2008 ◽  
Author(s):  
Hongli Yang ◽  
Xiangpeng Zhao ◽  
Chao Cai ◽  
Zongyan Qiu
Keyword(s):  

2012 ◽  
Vol 15 (2) ◽  
pp. 125-147 ◽  
Author(s):  
Abinoam P. Marques ◽  
Anders P. Ravn ◽  
Jiří Srba ◽  
Saleem Vighio

2011 ◽  
Vol 460-461 ◽  
pp. 552-557
Author(s):  
Zhi Gang Zhou

Authenticated algorithms and 802.11 mesh networks have garnered limited interest from both systems engineers and system administrators in the last several years. Given the current status of event-driven modalities, theorists particularly desire the refinement of Web services, which embodies the confirmed principles of artificial intelligence. Here we concentrate our efforts on arguing that model checking can be made event-driven, permutable, and wearable.


Sign in / Sign up

Export Citation Format

Share Document