An Algorithm for the Validation of Executable Completions of an Abstract BPEL Process
暂无分享,去创建一个
[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[2] Gabriel Valiente,et al. An Efficient Bottom-Up Distance between Trees , 2001, SPIRE.
[3] Tao Jiang,et al. Some MAX SNP-Hard Results Concerning Unordered Labeled Trees , 1994, Inf. Process. Lett..
[4] Jennifer Widom,et al. Change detection in hierarchically structured information , 1996, SIGMOD '96.
[5] Kaizhong Zhang,et al. A constrained edit distance between unordered labeled trees , 1996, Algorithmica.
[6] Serge Abiteboul,et al. Detecting changes in XML documents , 2002, Proceedings 18th International Conference on Data Engineering.
[7] Axel Martens,et al. Simulation and Equivalence between BPEL Process Models , 2005 .
[8] Peter Massuthe,et al. Operating guidelines for services , 2009 .
[9] Kaizhong Zhang,et al. On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..
[10] J. Rowling. X-Diff : A Fast Change Detection Algorithm for XML Documents , 2003 .
[11] Rudolf Schmid,et al. Organization for the advancement of structured information standards , 2002 .