Inference of finite automata using homing sequences
Information and Computation
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Safety and Liveness in Branching Time
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Tools for composite web services: a short overview
ACM SIGMOD Record
| Hi-index | 0.00 |
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified reception, and temporal constraints in Computation Tree Logic formula. An automated synthesis algorithm based on learning algorithm is introduced, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured. We have implemented a prototype system evaluating the effectiveness and efficiency of our synthesis approach through an experimental study.