BPEL流程生命周期中若干关键问题研究
|
摘要
Internet己成为现代社会越来越重要的基础设施。基于SOA(Service Oriented Architecture,面向服务的体系结构)的Web服务技术应运而生,它是实现SOA的最佳选择。业务流程执行语言BPEL(Business Process Execution Language)是当前工业界服务组合语言中事实上的标准。BPEL流程正确有效设计、编写、运行和封装将直接影响企业业务流程的执行效率,从而间接影响企业的生产效率。
本文研究BPEL流程生命周期的五个阶段：需求描述阶段、编辑设计阶段、静止阶段、执行阶段和封装阶段中的若干关键问题,这些问题的解决能提高BPEL流程的正确度和效率。论文主要研究内容如下：
研究业务流程执行语言(BPEL)在生命周期的需求描述阶段如何从自然语言描述的功能需求自动生成BPEL流程。首先将需求描述进行约束和形式化,然后在WSDL集合中找到语义匹配度最高的Web服务,最后用从低向上逐层拼装的方式生成需求描述对应的整个BPEL流程。从需求描述到BPEL流程的自动生成将帮助用户和开发人员能够快速地在需求上达成共识,并加快BPEL流程的开发。
研究BPEL在生命周期的编辑设计阶段中BPEL活动推荐问题。当开发人员需要编写大量针对某一业务领域的BPEL流程时,原子服务的个数往往是有限的,并且它们之间可能存在着某种因果关系。利用关联规则挖掘算法挖掘出原子服务之间的关联关系,在开发人员编写BPEL流程的过程中,为他们提供相关BPEL活动的推荐,以此提高流程编辑的正确性和效率。
研究BPEL流程在生命周期的编辑设计阶段中的控制依赖死锁问题。在流程编辑设计的过程中,BPEL中活动的执行顺序和link元素可能引入控制依赖死锁,通过在线发现图中的简单回路,在BPEL流程设计过程中实时地检测出这种死锁,从而规避在庞大的流程设计完成之后再去检测所具有的难度和复杂度。
研究BPEL流程在生命刷期的静止阶段的流程模板生成问题。从某个领域或某个应用具有一定规模的BPEL流程集合中,利用有根无序树的频繁模式挖掘发现频繁出现的子流程,这些子流程可以作为BPEL流程模板,推荐给开发人员,以实现流程的复用。
研究BPEL流程在生命周期的执行阶段的流程相容性问题。BPEL流程执行时,可能存在流程与被调用的服务不相容的问题,包括接口的不相容与行为上的死锁。用基于UML和类型Pi演算的方法检测相容性,并在不相容的时候给出适配器的生成方法。
研究BPEL流程封装为Web服务阶段时的相容性问题。综合考虑多种因素,包括服务接口的语法和语义,服务的行为,服务的质量和用户的偏好,利用运筹学中的层次分析法,从定量上分析Web服务之间的相容性。
Internet has been the infrastructure more and more important in modern age. Web Services based on SOA(Service Oriented Architecture) arise at the historic moment, and they are the best choices implementing SOA. BPEL (Business Process Execution Language) is the de-facto standard among all the web services' composition languages currently. Correct and effective design, compilation, running and encapsulation of BPEL processes will directly affect the execution efficiency of a corporation's business processes, thus will indirectly affect the production efficiency of the corporation.
This dissertation studies some key issues during five stages in the lifecycle of BPEL processes. These five stages are requirement description stage, compilation stage, static stage, execution stage and encapsulation stage. The solutions to these issues will promote the accuracy and efficiency of BPEL processes. The main research contents are as follows:
We research about in BPEL's requirement description stage, how to automatically generate BPEL processes from natural language described functional requirements. Firstly, requirements description is restricted and formalized; then, those Web Services with the highest semantic compatibility are found in the database of WSDLs; finally, the whole BPEL process is assembled level by level upwards. BPEL's automatic generation can help users and developers reach a consensus on the requirements as soon as possible, thereby speeding up BPEL processes'development.
We research about BPEL activities'recommendation problem in compilation stage. When the developer creates a lot of BPEL processes in a specific domain, the number of atomic Web Services is finite, and there always exists some causality between these services. Mining out the relationships between the atomic services using association rules mining, we can make some recommendation of BPEL activities to developers to improve the accuracy and efficiency of processes'compilation.
We research about the problem of control dependency deadlocks in compilation stage. In the procedure of BPEL's compilation, BPEL activities' execution sequence and element "link" may introduce in some control dependency deadlocks. By online discovering simple cycles in graph theory, deadlocks are detected real-time during the design of BPEL, thus avoiding the difficulty and complexity of detection after huge design work completes.
We research about the problem of process templates'generation in BPEL's static stage. From the set of BPEL processes in a specific domain or application, we make use of rooted unordered trees'frequent patterns mining to find out all the frequent sub-processes, which can be used as templates recommended to developers to achieve the reuse of BPEL processes.
We research about the problem of BPEL's compatibility in execution stage. When BPEL process is being executed, process and invoked services may be incompatible, including interfaces'incompatibility and behaviors' deadlocks. We use a method based on UML and typed Pi calculus to detect the compatibility and give a method creating adapters while incompatible.
We research about the problem of Web Services' compatibility when BPEL process is encapsulated as a Web Service. We consider multiple factors altogether, including services interfaces'syntax and semantics, services' behavior, QoS and users'preference, and use Analytic Hierarchy Process(AHP) in operational research to analyze Web Services'compatibility quantitatively.
本文研究BPEL流程生命周期的五个阶段：需求描述阶段、编辑设计阶段、静止阶段、执行阶段和封装阶段中的若干关键问题,这些问题的解决能提高BPEL流程的正确度和效率。论文主要研究内容如下：
研究业务流程执行语言(BPEL)在生命周期的需求描述阶段如何从自然语言描述的功能需求自动生成BPEL流程。首先将需求描述进行约束和形式化,然后在WSDL集合中找到语义匹配度最高的Web服务,最后用从低向上逐层拼装的方式生成需求描述对应的整个BPEL流程。从需求描述到BPEL流程的自动生成将帮助用户和开发人员能够快速地在需求上达成共识,并加快BPEL流程的开发。
研究BPEL在生命周期的编辑设计阶段中BPEL活动推荐问题。当开发人员需要编写大量针对某一业务领域的BPEL流程时,原子服务的个数往往是有限的,并且它们之间可能存在着某种因果关系。利用关联规则挖掘算法挖掘出原子服务之间的关联关系,在开发人员编写BPEL流程的过程中,为他们提供相关BPEL活动的推荐,以此提高流程编辑的正确性和效率。
研究BPEL流程在生命周期的编辑设计阶段中的控制依赖死锁问题。在流程编辑设计的过程中,BPEL中活动的执行顺序和link元素可能引入控制依赖死锁,通过在线发现图中的简单回路,在BPEL流程设计过程中实时地检测出这种死锁,从而规避在庞大的流程设计完成之后再去检测所具有的难度和复杂度。
研究BPEL流程在生命刷期的静止阶段的流程模板生成问题。从某个领域或某个应用具有一定规模的BPEL流程集合中,利用有根无序树的频繁模式挖掘发现频繁出现的子流程,这些子流程可以作为BPEL流程模板,推荐给开发人员,以实现流程的复用。
研究BPEL流程在生命周期的执行阶段的流程相容性问题。BPEL流程执行时,可能存在流程与被调用的服务不相容的问题,包括接口的不相容与行为上的死锁。用基于UML和类型Pi演算的方法检测相容性,并在不相容的时候给出适配器的生成方法。
研究BPEL流程封装为Web服务阶段时的相容性问题。综合考虑多种因素,包括服务接口的语法和语义,服务的行为,服务的质量和用户的偏好,利用运筹学中的层次分析法,从定量上分析Web服务之间的相容性。
Internet has been the infrastructure more and more important in modern age. Web Services based on SOA(Service Oriented Architecture) arise at the historic moment, and they are the best choices implementing SOA. BPEL (Business Process Execution Language) is the de-facto standard among all the web services' composition languages currently. Correct and effective design, compilation, running and encapsulation of BPEL processes will directly affect the execution efficiency of a corporation's business processes, thus will indirectly affect the production efficiency of the corporation.
This dissertation studies some key issues during five stages in the lifecycle of BPEL processes. These five stages are requirement description stage, compilation stage, static stage, execution stage and encapsulation stage. The solutions to these issues will promote the accuracy and efficiency of BPEL processes. The main research contents are as follows:
We research about in BPEL's requirement description stage, how to automatically generate BPEL processes from natural language described functional requirements. Firstly, requirements description is restricted and formalized; then, those Web Services with the highest semantic compatibility are found in the database of WSDLs; finally, the whole BPEL process is assembled level by level upwards. BPEL's automatic generation can help users and developers reach a consensus on the requirements as soon as possible, thereby speeding up BPEL processes'development.
We research about BPEL activities'recommendation problem in compilation stage. When the developer creates a lot of BPEL processes in a specific domain, the number of atomic Web Services is finite, and there always exists some causality between these services. Mining out the relationships between the atomic services using association rules mining, we can make some recommendation of BPEL activities to developers to improve the accuracy and efficiency of processes'compilation.
We research about the problem of control dependency deadlocks in compilation stage. In the procedure of BPEL's compilation, BPEL activities' execution sequence and element "link" may introduce in some control dependency deadlocks. By online discovering simple cycles in graph theory, deadlocks are detected real-time during the design of BPEL, thus avoiding the difficulty and complexity of detection after huge design work completes.
We research about the problem of process templates'generation in BPEL's static stage. From the set of BPEL processes in a specific domain or application, we make use of rooted unordered trees'frequent patterns mining to find out all the frequent sub-processes, which can be used as templates recommended to developers to achieve the reuse of BPEL processes.
We research about the problem of BPEL's compatibility in execution stage. When BPEL process is being executed, process and invoked services may be incompatible, including interfaces'incompatibility and behaviors' deadlocks. We use a method based on UML and typed Pi calculus to detect the compatibility and give a method creating adapters while incompatible.
We research about the problem of Web Services' compatibility when BPEL process is encapsulated as a Web Service. We consider multiple factors altogether, including services interfaces'syntax and semantics, services' behavior, QoS and users'preference, and use Analytic Hierarchy Process(AHP) in operational research to analyze Web Services'compatibility quantitatively.
引文
[1]邓敏.基于BPEL的服务生成系统的研究与实现[学位论文].北京：北京邮电大学,2010.
[2]吴江霞.Web组合服务QoS属性预测方法研究[学位论文].北京：北京邮电大学,2008.
[3]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[4]吴国荣.从BPEL到Petri网的映射研究[学位论文].南昌：江西师范大学,2009.
[5]http://wiki.huihoo.com/index.php?title=ActiveBPEL
[6]http://book.51cto.com/art/200805/74107.htm
[7]王紫瑶,南俊杰.SOA核心技术及应用[M].电子工业出版社,2008.
[8]http://blog.csdn.net/cissyring/archive/2007/02/08/1505700.aspx
[9]http://zh.wikipedia.org/zh/Microsoft_BizTalk_Server
[10]沈斌.关联规则相关技术研究[学位论文].杭州：浙江大学,2007.
[11]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data[C]. In:Proceedings of Fourth European Conference Principles and Practice of Knowledge Discovery in Databases(PKDD'00), Lyon, France,2000, pp.13-23.
[12]Han Jiawei, Pei Jian, Yin Yiwen. Mining frequent patterns without candidate generation:a frequent-pattern tree approach[J]. Data Mining and Knowledge Discovery,8(1),2004, pp.53-87.
[13]Yan Xifeng, Han Jiawei. gSpan:graph-based substructure pattern mining[C] In:Proceedings of 2002 IEEE International Conference on Data Mining, Maebashi City, Japan,2002, pp.721-724.
[14]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. Complete mining of frequent patterns from graphs:Mining Graph Data[J]. Machine Learning,50(3), March.2003, pp.321-354.
[15]Ehud Gudes, Solomon Eyal, Shimony Natalia Vanetik. Discovering frequent graph patterns using disjoint paths[J]. IEEE Transactions on Knowledge and Data Engineering,18(11), Nov.2006, pp.1441-1456.
[16]Chi Yun, Yang Yirong, Muntz Richard R. HybridTreeMiner:an efficient algorithm for mining frequent rooted trees and free trees using canonical forms[C]. In:Proceedings of the 16th International Conference on Scientific and Statistical Database Management, Washington,2004, pp.11-20.
[17]Mohammed J. Zaki. Efficiently mining frequent trees in a forest[C]. In:Proceedings of 2002 Intl. Conference of Knowledge Discovery and Data Mining(SIGKDD'02), Edmonton, Alberta, Canada, 2002, pp.71-80.
[18]Asai Tatsuya. Efficient substructure discovery from large semi-structured data[J]. IEICE Transactions on Information and Systems, E87-D(12), Dec.2004, pp.2754-2763.
[19]Fedja Hadzic, Henry Tan, Tharam S. Dillon. UNI3-efficient algorithm for mining unordered induced subtrees using TMG candidate generation[C]. In:Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA,2007, pp.568-575.
[20]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al. IMB3-Miner:Mining induced/embedded subtrees by constraining the level of embedding[C]. In:Proceedings of 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Singapore,2006, pp.450-461.
[21]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al. MB3-Miner:mining eMBedded subTREEs using Tree Model Guided candidate generation[C]. In:Proceedings of the 1st International Workshop on Mining Complex Data, held in conjunction with ICDM'05, Texas, USA,2005, pp.103-110.
[22]Henry Tan, Fedja Hadzic, Tharam S. Dillon, et al. Tree model guided candidate generation for mining frequent subtrees from XML documents[J]. ACM Transactions on Knowledge Discovery, 2(2),2008, article No.9.
[23]Iochpe C, Chiao, C, Hess G, et al. Towards an intelligent workflow designer based on the reuse of workflow patterns[C]. In:Proceedings of 1st Brazilian Workshop on Business Process Management, Gramado, Brazil,2007, pp.249-260.
[24]Dimka Karastoyanova, Alejandro P Buchmann. Automating the development of web service compositions using templates[J]. GI Jahrestagung,2,2004, pp.517-523.
[25]Paik Incheon, Suzuki Hiroto. Pattern Templates for automating business choreography on web services[C]. In:Proceedings of 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07, Ontario, Canada,2007, pp.512-517.
[26]Zhilei Ma, Frank Leymann. A lifecycle model for using process fragment in business process modeling[C]. In:Proceedings of BPMDS'08, Montpellier, France,2008, pp.1-9.
[27]Zhilei Ma, Frank Leymann. BPEL fragments for modularized reuse in modeling BPEL processes[C]. In:Proceedings of the 2009 Fifth International Conference on Networking and Services, Valencia, Spain,2009, pp.63-68.
[28]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing (CMC 2010), Shenzhen,2010, pp.559-563.
[29]秦振,陆昌辉,张维明.信息需求描述方法综述[J].科学技术与工程,6(15),2006,pp.2321-2326.
[30]但斌,王江平,刘瑜.大规模定制环境下客户需求信息分类模型及其表达方法研究[J].计算机集成制造系统,14(8),2008,pp.1504-1511.
[31]Muhammad Ilyas, Josef Kung. A comparative analysis of similarity measurement techniques through SimReq framework[C]. In:Proceedings of the 7th International Conference on Frontiers of Information Technology, Abbotabad, Pakistan,2009, pp.1-6.
[32]Johan Natt Och Dag, Bjorn Regnell, Par Carlshamre, et al. Evaluating automated support for requirements similarity analysis in market-driven development[C]. In:Proceedings of the Seventh International Workshop on Requirements Engineering:Foundation for Software Quality (REFSQ'01), Interlaken, Switzerland,2001, pp.1-12.
[33]http://baike.baidu.com/view/364279.htm
[34]Baeten J.C.M. A brief history of process algebra[J]. Theoretical Computer Science,335(2-3), May.2005, pp.131-146.
[35]Robin Milner. A Calculus of Communicating Systems[M]. Lecture Notesin Computer Science, Springer Verlag,1980.
[36]Robin Milner. Communication and concurrency[M]. Prentice Hall,1989, pp.70-120.
[37]C.A.R. Hoare. Communicating sequential processes[J]. Communications of the ACM,21(8),1978 pp.666-677.
[38]C.A.R.Hoare. A model for communicating sequential processes[J]. On the Construction of Programs,1980, pp.229-254.
[39]C.A.R. Hoare. Communicating sequential processes[M]. Prentice Hall,1985.
[40]J.A. Bergstra, J.W. Klop. ACP:A Universal Axiom System for Process Specification[J]. CWI Quarterly 15,1987, pp.3-23.
[41]P. H. J. van Eijk, C. A. Vissers, M. Diaz. The formal description technique LOTOS[M]. Elsevier Science Publishers B.V.,1989.
[42]http://baike.baidu.com/view/2519257.htm
[43]Robin Milner. Communicating and mobile systems:the Pi-Calculus[M]. Cambridge University Press,1999.
[44]Robin Milner. The polyadic pi-calculus:a tutorial[M]. Logic and algebra of specification, Springer Verlag,1993, pp.1-50.
[45]Cheng Bo, Guo Jie, Lin Xiangtao, et al. A preliminary practice for BPEL based multimedia conference Web Services orchestration[C]. In:Proceedings of advanced international conference on telecommunications, Athens, Greece,2008,pp.321-326.
[46]Cheng Bo, Lin Xiangtao, Hu Xiaoxiao. Formal analysis for multimedia conferencing communication services orchestration[C]. In:Proceedings of 2009 IEEE International Conference on Web Services, Los Angeles, CA, USA,2009, pp.1010-1011.
[47]Zhu Da, Zhang Yang, Chen Junliang, et al. Enhancing ESB based execution platform to support flexible communication web services over heterogeneous networks[C]. In:Proceedings of 2010 IEEE International Conference on Communications, Cape Town, South Africa,2010, pp.1-6.
[1]秦振,陆昌辉,张维明.信息需求描述方法综述[J].科学技术与工程,6(15),2006,pp.2321-2326.
[2]Tidwell D. Web services-The Web's next revolution,2001, http://www.ibm.com/developerWorks/
[3]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[4]但斌,王江平,刘瑜.大规模定制环境下客户需求信息分类模型及其表达方法研究[J].计算机集成制造系统,14(8),2008,pp.1504-1511.
[5]Muhammad Ilyas, Josef Kung. A comparative analysis of similarity measurement techniques through SimReq framework[C]. In:Proceedings of the 7th International Conference on Frontiers of Information Technology, Abbotabad, Pakistan,2009, pp.1-6.
[6]Johan Natt Och Dag, Bjorn Regnell, Par Carlshamre, et al. Evaluating automated support for requirements similarity analysis in market-driven development[C]. In:Proceedings of the Seventh International Workshop on Requirements Engineering:Foundation for Software Quality, Interlaken, Switzerland,2001.
[7]Mohanty H, Chenthati D, Vaddi S, et al. Automatic generation of BPEL and WSDL from FSM models of Web Services[C]. In:Proceedings of 2006 International Conference on Advanced Computing and Communications, Surathkal,2006, pp.440-444.
[8]Li Zhang, Wei Jiang. Transforming business requirements into BPEL:A MDA-based approach to web application development[C]. In:Proceedings of 2008 IEEE International Workshop on Semantic Computing and Systems, Huangshan, China,2008, pp.61-66.
[9]Anisha Vemulapalli, Nary Subramanian. Evaluating consistency between BPEL specifications and functional requirements of complex computing systems using the NFR approach[C]. In:Proceeding of 2010 IEEE International Systems Conference, San Diego,2010, pp.153-158.
[10]Anisha Vemulapalli, Nary Subramanian. Transfonning functional requirements from UML into BPEL to efficiently develop SOA-based systems[C]. In:Proceeding of 2009 On the Move to Meaningful Internet Systems:OTM 2009 Workshops, Vilamoura, Portugal,2009, pp.337-346.
[11]Keith Mantell. From UML to BPEL:model driven architecture in a web services world, http://www.ibm.com/developerworks/webservices/library/ws-uml2bpel/#authorl
[12]Rainer Anzbock, Schahram Dustdar. Semi-automatic generation of web services and bpel processes-a model-driven approach[C]. In:Proceedings of the 3rd International Conference on Business Process Management, Nancy, France,2006, pp.64-79.
[13]吕学强,任飞亮,黄志丹等.句子相似模型和最相似句子查找算法[J].东北大学学报(自然科学版),2003,24(6),pp.531-534.
[14]赵妍妍,秦兵,刘挺等.基于多特征融合的句子相似度计算[C].全国第八届计算语言学联合学术会议,2005,pp.168-174.
[15]南铉国,崔荣一.基于多层次融合的语句相似度计算模型[J].延边大学学报(自然科学版),33(3),pp.191-194.
[16]Jin Feng, Yiming Zhou, Trevor Martin. Sentence Similarity based on Relevance[C]. In: Proceedings of IPMU'08, Malaga, Spain,2008, pp.832-839.
[17]Chukfong Ho, Masrah Azrifah, Azmi Murad, et al. Word sense disambiguation-based sentence similarity[C]. In:Proceedings of Coling 2010:Poster Volume,2010, pp.418-426.
[18]Porter M F. An algorithm for suffix stripping[J]. Program,14(3),1980, pp.130-137.
[1]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[2]Guatam Das, King Ip Lin, Heikki Mannila, et al. Rule discovery from time series[C]. In: Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining, Menlo Park, CA,1998, pp.16-22.
[3]冯玉才,冯剑琳.关联规则的增量式更新算法[J].软件学报,9(4),1998,pp.301-306.
[4]肖波,徐前方,蔺志青.可信关联规则及其基于极大团的挖掘算法[J].软件学报,19(10),Oct.2008,pp.2597-2610.
[5]叶德谦,赵世磊.基于线性回归的关联规则相关性方法的研究[J].45,2008,pp.291-294.
[6]Dass Rajanish. Using association rule mining for behavioral analysis of school students:a case from India[C]. In:Proceedings of the 42nd Annual Hawaii International Conference on System Sciences, Hawaii,2009, pp.1-6.
[7]博克斯,顾岚(译).时间序列分析：预测与控制[M].中国统计出版社,1997.
[8]韩雪梅.时间序列挖掘与预测研究[学位论文].杭州：浙江大学,2006.
[9]汪廷华,程从从.一种元规则指导的股票联动关联规则挖掘算法[J].计算机工程,32(5), March. 2006, pp.260-262.
[10]张娟,王慧锋.股票时间序列模型的关联规则挖掘[J].天津理工大学学报,22(2), April.2006, pp.35-38.
[11]Yang Yuchen, Mabu Shingo, Ohkawa Etsushi, et al. Stock movement prediction using fuzzy intertransaction class association rule mining based on genetic network programming[C]. In: Proceedings of ICCAS-SICE 2009-ICROS-SICE International Joint Conference, Fukuoka, Japan, 2009, pp.2561-2566.
[12]X Yang, D Wu, F Zhou, et al. Association rule mining for affective product design[C]. In: Proceedings of 2008 IEEE International Conference on Industrial Engineering and Engineering Management, Singapore,2008, pp.748-752.
[13]Zhou Huiyu, Mabu Shingo, Shimada Kaoru, et al. Generalized time related sequential association rule mining and traffic prediction[C]. In:Proceedings of 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway,2009, pp.2654-2661.
[14]鲍亮,宋胜利,陈胜等.BPEL中的静态流稗切片技术研究[J].系统工程与电子技术,31(1),2009,pp.241-245
[15]翟岩龙,宿红毅,张晗.基于数据流优化的BPEL流榉分割方法[J].华南理工大学学报(自然科学版),37(4), April.2009, pp.24-30.
[16]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing, Shenzhen,2010, pp.559-563.
[17]Deng Na, Deng Fang. Research of a mining method about multidimensional inter-time association rule based on sliding window[C]. In:Proceedings of China-Ireland International Conference on Information and Communications Technologies (CIICT 2008), Beijing,2008, pp.419-422.
[18]Han Jiawei, Kamber M. Data Mining:Concepts and Techniques[M]. China Machine Press,2007.
[19]Rakesh Agrawal, Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases[C]. In:Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, Santiago, Chile,1994, pp.487-499.
[20]Tang Zhaohui, Jamie MacLennan. Data Mining with SQL Server 2005[M]. Tsinghua University Press,2007.
[1]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[2]Active Endpoints Corporation. ActiveBPEL designer user's guide,2007, http://www.activevos.com/bpel.php
[3]IBM Corporation. WebSphere, http://www-01.com/software/integration/wbimodeler/advanced/
[4]Oracle Corporation. Oracle BPEL Process Manager, www.oracle.com/technology/bpel
[5]Microsoft Corporation. Biztalk, http://www.microsoft.com/biztalk/
[6]丁佐华,江明月,刘静.基于常微分方程的死锁检测实验分析[J].计算机学报,32(9), Sept.2009 pp.1736-1749.
[7]张尧学.N个有限状态机的死锁和死环回避算法[J].计算机学报,1994,17 (A00), pp.53-58.
[8]Maria Pia Fanti, Bruno Maione, Biagio Turchiano. Comparing digraph and petri net approaches to deadlock avoidance in FMS[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics,30(5), Oct.2000, pp.783-798.
[9]Ezpeleta J, Colom J M, and Martinez J. A Petri net based deadlock prevention policy for flexible manufacturing systems[J]. IEEE Transaction on Robotics and Automation,11(2),1995, pp. 173-184.
[10]梁中兴,罗贵明,旷宏斌.基于CEGAR偏序化简的并行程序死锁检测[J].计算机工程,35(19), Oct.2009, pp.65-68.
[11]崔焕庆,刘强.基于Petri网并行程序通信死锁的检测和预防[J].计算机工程,34(23),Dec.2008, pp.50-52.
[12]刘荣峰,李引珍,吴桂华.基于Petri网的分布式系统并发进程的死锁检测[J].计算机工程与设计,28(22), Nov.2007, pp.5353-5355.
[13]Li Zhiwu, Zhou Mengchu. Comparison of two deadlock prevention methods for different-size flexible manufacturing systems[J]. International Journal of Intelligent control and system,10(3), Sept.2005, pp.235-243.
[14]卢超,卢炎生,谢晓东等.一种基于依赖分析的并发程序潜在死锁检测算法[J].小型微型计算机系统,28(5),2007,pp.841-844.
[15]Senichi Onoda, Yoshitomo Ikkai, Takashi Kobayashi, et al. Definition of deadlock patterns for business processes work on models[C]. In:Proceedings of the Annual Hawaii International Conference on System Sciences, Maui, Hawaii,1999, pp.1-4.
[16]Tetsuya Maruta, Senichi Onoda, Yoshitomo Ikkai, et al. A deadlock detection algorithm for business processes workflow models[C]. In:Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, San Diego, CA, USA,1998, pp.611-616.
[17]陈胜,鲍亮,陈平等.BPEL流程数据竞争和死锁检测算法研究[J].西安电子科技大学学报,35(6),2008,pp.1056-1063.
[18]Yi Qian, Yuming Xu, Zheng Wang, et al. Tool support for BPEL verification in ActiveBPEL engine[C]. In:Proceedings of the 18th Australian Software Engineering Conference (ASWEC), Melbourne, Australia,2007, pp.90-100.
[19]Chun Ouyang, Eric Verbeek, Stephen Breutel, et al. Formal semantics and analysis of control Flow in WS-BPEL[J]. Science of Computer Programming,67(2-3), July 2007, pp.162-198.
[20]Abrehet Mohammed Omer, Alexander Schill. Dependency based automatic service composition using directed graph[C]. In:Proceedings of the 2009 Fifth International Conference on Next Generation Web Services Practices. Prague, Czech Republic,2009, pp.76-81.
[21]Zhangbing Zhou, Sami Bhiri, Manfred Hauswirth. Control and data dependencies in business processes based on semantic business activities[C]. In:Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services Linz, Austria,2008, pp.257-263.
[22]王敬亚,朱怀宏,胡琰华等.利用控制依赖关系算法分析BPEL4WS[J]计算机工程与科学,30(10),2008,pp.45-48.
[23]Qinyi Wu, Calton Pu, Akhil Sahai, et al. Categorization and optimization of synchronization dependencies in business processes[C]. In:Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), April 2007, pp.306-315.
[24]牟廉明.求有向图的所有Euler回路算法[J].内江师范学院学报,32(2),2008,pp.11-14.
[25]马丰宁,寇纪淞,李敏强.用遗传规划求欧拉回路[J].系统工程理论与实践,5,1997,pp.19-28.
[26]牟廉明.求有向图的所有Hamilton回路的新方法[J].计算机工程,33(17),Sept.2007,pp.208-210.
[27]王彦祺.用”遗传”算法求任意图的所有哈密顿回路[J].哈尔滨工业大学学报,36(12),Dec.2004, pp.1690-1692.
[28]文中华,姜云飞.用分层关联方法求有向图中所有Hamilton回路的算法[J].计算机研究与发展,,42(10),2005,pp.1809-1814.
[29]V. Ejov, J. A. Flar, S. K. Lucas, et al. Solving the hamiltonian cycle problem using symbolic determinants [J]. Taiwanese Journal of Mathematics,10,2006, pp.327-337.
[30]Zhu Lizhi. A polynomial time algorithm for hamilton cycle(Path)[C]. In:Proceedings of 2010 International Conference on Computer Design and Applications (1CCDA),3,2010, pp.207-210.
[31]James C. Tiernan. An efficient search algorithm to find the elementary circuits of a graph[J]. Communications of the ACM,13(12), Dec.1970, pp.722-726.
[32]Robert E Tarjan. Enumeration of the elementary circuits of a directed graph[J]. SIAM Journal on Computing,2(3),1972, pp.211-216.
[33]Liu Hongbo, Wang Jiaxin. A new way to enumerate cycles in graph[C]. In:Proceedings of International Conference on Internet and Web Applications and Services/Advanced International Conference,2006, pp:57-57.
[34]Donald B Johnson. Finding all elementary circuits of a directed graph[J]. SIAM Journal on Computing,4(1),1975, pp.77-84.
[1]Tidwell D. Web services-The Web's next revolution, http://www.ibm.com/developerWorks/
[2]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[3]Microsoft Corporation. XLANG/s Language, http://msdn.microsoft.com/en-us/library/aa577463(BTS.70).aspx
[4]F. Leymann. Web Services Flow Language (version 1.0),2001, http://www-4.ibm.com/software/solutions/webservices/pdf/WSFL.pdf
[5]Fedja Hadzic, Henry Tan, Tharam S. Dillon. UNI3-efficient algorithm for mining unordered induced subtrees using TMG candidate generation[C]. In:Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA,2007, pp.568-575.
[6]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al.IMB3-Miner:Mining induced/embedded subtrees by constraining the level of embedding[C]. In:Proceedings of 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Singapore,2006, pp.450-461.
[7]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al. MB3-Miner:mining eMBedded subTREEs using Tree Model Guided candidate generation[C]. In:Proceedings of the 1st International Workshop on Mining Complex Data, held in conjunction with ICDM'05, Texas, USA,2005, pp.103-110
[8]Henry Tan, Fedja Hadzic, Tharam S. Dillon, et al. Tree Model Guided Candidate Generation for Mining Frequent Subtrees from XML Documents [J]. ACM Transactions on Knowledge Discovery, 2(2),2008, article No.9.
[9]Cheng Bo, Guo Jie, Lin Xiangtao, et al. A preliminary practice for BPEL based multimedia conference Web Services orchestration[C]. In:Proceedings of advanced international conference on telecommunications, Athens, Greece,2008, pp.321-326.
[10]Cheng Bo, Lin Xiangtao, Hu Xiaoxiao. Formal analysis for multimedia conferencing communication services orchestration[C]. In:Proceedings of 2009 IEEE International Conference on Web Services, Los Angeles, CA, USA,2009, pp.1010-1011.
[11]Zhu Da, Zhang Yang, Chen Junliang, et al. Enhancing ESB based execution platform to support flexible communication web services over heterogeneous networks[C]. In:Proceedings of 2010 IEEE International Conference on Communications, Cape Town, South Africa,2010, pp.1-6.
[12]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing(CMC 2010), Shenzhen,2010, pp.559-563.
[13]van der Aalst W.M.P., Reijers H.A., Weijters A.J.M.M., et al. Business process mining:an industrial application[J]. Information Systems,32(5), July 2007, pp.713-732.
[14]van der Aalst W.M.P., Weijters A.J.M.M., Maruster L. Workflow mining:Which processes can be rediscovered? [C]. In:Proceedings of BETA Working Paper Series, WP 74, Eindhoven University of Technology, Eindhoven,2002.
[15]Gombotz Robert, Dustdar Schahram. On web services workflow mining[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),3812,2005, pp.216-228.
[16]W. Vanderaalst, B. Vandongen, J. Herbst, et al. Workflow mining:a survey of issues and approaches[J]. Data & Knowledge Engineering,47(2), Nov.2003, pp.237-267.
[17]Iochpe C., Chiao, C., Hess G., et al. Towards an intelligent workflow designer based on the reuse of workflow patterns[C]. In:Proceedings 1st Brazilian Workshop on Business Process Management (in conjunction with Simposio Brasileiro de Sistemas Multimidia e Web), Gramado, Brazil,2007.
[18]Dimka Karastoyanova, Alejandro P Buchmann. Automating the development of web service compositions using templates[J]. GI Jahrestagung,2,2004, pp.517-523.
[19]Paik Incheon, Suzuki, Hiroto. Pattern templates for automating business choreography on web services [C]. In:Proceedings of 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07, Ontario, Canada,2007, pp.512-517.
[20]Zhilei Ma, Frank Leymann. A lifecycle model for using process fragment in business process modeling[C]. In:Proceedings of BPMDS'08, Montpellier, France,2008, pp.1-9.
[21]Zhilei Ma, Frank Leymann. BPEL fragments for modularized reuse in modeling BPEL processes[C]. In:Proceedings of the 2009 Fifth International Conference on Networking and Services, Valencia, Spain,2009, pp.63-68.
[22]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing (CMC 2010), Shenzhen,2010, pp.559-563.
[23]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data[C]. In:Proceedings of Fourth European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD'00), Lyon, France,2000, pp.13-23.
[24]Han Jiawei, Pei Jian, Yin Yiwen. Mining frequent patterns without candidate generation:a frequent-pattern tree approach[J]. Data Mining and Knowledge Discovery,8(1),2004,53-87.
[25]Yan Xifeng, Han Jiawei. gSpan:graph-based substructure pattern mining[C]. In:Proceedings of 2002 IEEE International Conference on Data Mining, Maebashi City, Japan,2002, pp.721-724.
[26]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. Complete mining of frequent patterns from graphs:mining graph data[J]. Machine Learning,50(3), March 2003, pp.321-354.
[27]Ehud Gudes, Solomon Eyal, Shimony Natalia Vanetik. Discovering frequent graph patterns using disjoint paths[J]. IEEE Transactions on Knowledge and Data Engineering,18(11), Nov.2006, pp.1441-1456.
[28]Chi Yun, Yang Yirong, Muntz Richard R. HybridTreeMiner:an efficient algorithm for mining frequent rooted trees and free trees using canonical forms [C]. In:Proceedings of the 16th International Conference on Scientific and Statistical Database Management, Washington,2004, pp.11-20.
[29]Mohammed J. Zaki. Efficiently mining frequent trees in a forest[C]. In:Proceedings of 2002 Intl. Conference of Knowledge Discovery and Data Mining(SIGKDD'02), Edmonton, Alberta, Canada, 2002, pp.71-80.
[30]Asai Tatsuya. Efficient substructure discovery from large semi-structured data[J]. IEICE Transactions on Information and Systems, E87-D(12), Dec.2004, pp.2754-2763.
[31]Deng Na, Chen Junliang, Cheng Bo, et al. A recommendation method of BPEL activity based on association rules mining[C]. In:Proceedings of the 2010 International Conference on Computational Intelligence and Software Engineering, Wuhan,2011, pp.1-4.
[32]Rakesh Agrawal, Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases[C]. In:Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, Santiago, Chile,1994. pp.487-499
[33]Abe K., Kawasoe S, Asai T, et al. Optimized substructure discovery for semistructured data[C]. In: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2002), Helsinki, Finland,2002, pp.1-4.
[1]廖军,谭浩,刘锦德.基于Pi演算的Web服务组合的描述和验证[J].计算机学报,28(4),2005,pp.635-643.
[2]辜希武,卢正鼎.基于Pi-演算的BPEL4WS Web服务组合形式化模型[J].计算机科学,34(4),2007,pp.69-74.
[3]Javier Camaraa, Carlos Canalb, Javier Cuboa, et al. A Formalizing WSBPEL business processes using process algebra[J]. The 4th International Workshop on the Foundations of Coordination Languages and Software Architectures, Electronic Notes in Theoretical Computer Science,154(1), 2006, pp.159-173.
[4]Roberto Lucchi, Manuel Mazzara. A pi-calculus based semantics for WS-BPEL[J]. Journal of Logic and Algebraic Programming in Web Services and Formal Methods,70(1),2007, pp.96-118.
[5]B.C. Pierce, D. Sangiorgi. Typing and subtyping for mobile processes[J]. Journal of Mathematical Structures in Computer Science,6(5),1996, pp.409-454.
[6]Robin Milner. Communication and concurrency[M]. Prentice Hall,1989, pp.70-120.
[7]Robin Milner. Communicating and mobile systems:the Pi-Calculus. Cambridge University Press, 1999.
[8]Robin Milner. The polyadic pi-calculus:a tutorial[M]. Logic and algebra of specification, Springer Verlag,1993, pp.1-50.
[9]刘荣胜,黄邵,高春鸣.基于类型化Pi演算的Web服务组合相容性检测[J].计算机工程与应用,43(7),2007,pp.20-24.
[10]辜希武,卢正鼎.类型化的Web服务组合形式化模型[J].计算机科学,35(1),2008,pp.128-134.
[11]Su Jindian, Yu Shanshan, Guo Heqing. Analysis of web service substitutability based on typed calculus[C]. In:Proceedings of 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, Washington,2008, pp.559-564.
[12]刘琼,彭鑫,赵文耘.一种改进的基于Pi演算的Web服务自动组装方法[J1.计算机工程与应用,43(16),2007,pp.67-70.
[13]Paul V. Biron, Kaiser Permanente, Ashok Malhotra. XML Schema Part 2:Datatypes Second Edition, http://www.w3.org/TR/xmlschema-2/
[14]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[15]Victor B, Moller F. The mobility workbench-a tool for the pi-calculus[C]. In:Proceedings of the 6th International Conference on Computer Aided Verification, London,1994, pp.428-440.
[1]Hamid R. Motahari Nezhad, Boualem Benatallah, Axel Martens, et al. Semi-automated adaptation of service interactions[C]. In:Proceedings of WWW'07, Alberta, Canada,2007, pp.993-1002.
[2]Li yunyao, H.V. Jagadish. Compatibility detemination in web services[C]. In:Proceedings of ICEC Workshop on Workshop on E-Government and Web Services, Pittsburgh, PA, USA,2003, pp.1-8.
[3]史玉良,王海洋,张亮等.Web服务合成的相容性与替换性分析[J].计算机研究与发展,44(11),2007,pp.1955-1961
[4]胡军,高济,李长云.多主体系统中基于本体论的服务相容匹配机制[J].计算机辅助设计与图形学学报,15(5), May.2006, pp.694-701.
[5]Valeria De Antonellis, Michele Melchiori, Pierluigi Plebani. An approach to web service compatibility in cooperative processes [C]. In:Proceedings of Workshop on Service Oriented Computing (SOC), Orlando,2003. pp.1-6.
[6]Chen Shu, Wu Guoqing, Xiao Jing. A process algebra approach for the compatibility analysis of web services[C]. In:Proceedings of 2008 Second International Conference on Future Generation Communication and Networking, Hainan Island,2008, pp.305-308
[7]Liu Fangfang, Zhang Liang, Shi Yuliang, et al. Formal analysis of compatibility of web services via CCS[C]. In:Proceedings of International Conference on Next Generation Web Services Practices (NWeSP'05), Seoul, Korea,2005, pp.1-6.
[8]Zhang Chi. Web service interface extending and description based on pi calculus [C]. In: Proceedings of 2008 International Symposium on Computer Science and Computational Technology, Shanghai, China,2008, pp.203-206,
[9]辜希武,卢正鼎.Web服务相容性的形式化描述与分析[J].计算机工程与应用,43(27),2007,pp.8-33.
[10]邓水光,李莹,吴健等.Web服务行为兼容性的判定与计算[J].软件学报,18(12),2007,pp.3001-3014.
[11]刘荣胜,黄邵,高春鸣.基于类型化Pi-演算的Web服务组合相容性检测[J].计算机工程与应用,43(7)2007,pp.120-124.
[12]Tan Wei, Rao Fangyan, Fan Yushun, et al. Compatibility analysis and mediation-aided composition for BPEL services[C]. In:Proceedings of 2007 Intl. Conf. on Database Systems for Advanced Applications, Bangkok, Thailand,2007, pp.1062-1065.
[13]Tan Wei, Fan Yushun, Zhou MengChu. A petri net-based method for compatibility analysis and composition of web Services in business process execution language[J]. IEEE Transactions on Automation Science and Engineering,6(11), Jan.2009, pp.94-106.
[14]Yanping Yang, Mingan Zhang, Xiqing Ye, et al. Protocol Compatibility Verification for Web Services Interaction[C]. In:Proceedings of 2009 Fifth International Conference on Semantics, Knowledge and Grid, Zhuhai,2009, pp.106-112.
[15]熊鹏程,范玉顺.一种基于Petri网的网络服务兼容性分析方法[J].高技术通讯,18(9),Sept.2008,pp.943-947.
[16]Axel Martens. On compatibility of web services[J]. Petri Net Newsletter,65,2003, pp.12-20.
[17]Lucas Bordeaux, Gwen Salaun, Daniela Berardi, et al. When are two web services compatible?[C]. In:Proceedings of TES2004, Berlin Heidelberg,2005, pp.15-28.
[18]Shi Yuliang, Zhang Liang, Liu Fangfang, et al. Compatibility analysis of web services[C]. In: Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence, Compiegne, France,2005, pp.483-486.
[19]Xueqiang Gong, Jing Liu, Miaomiao Zhang, et al. Formal analysis of services compatibility[C]. In: Proceedings of 33rd Annual IEEE International Computer Software and Applications Conference, Washington DC,2009, pp.243-248.
[20]Woralak Kongdenfha, Hamid Reza Motahari-Nezhad, Boualem Benatallah, et al. Mismatch patterns and adaptation aspects:A foundation for rapid development of web service adapters[J]. IEEE. Transaction on Services Computing,2(2), April-June.2009, pp.94-107
[21]缪晶晶.Web服务行为适配技术研究[学位论文].杭州：浙江大学2008
[22]殷昱煜,李莹,邓水光等.Web服务行为一致性与相容性判定[J].电子学报,37(3),Mar.2009.pp.433-438.
[23]Marlon Dumas, Boualem Benatallah, Hamid R. Motahari Nezhad. Web Service Protocols: Compatibility and Adaptation[C]. In:Proceedings of IEEE Data Engineering Bulletin,31(3),2008, pp.40-44.
[24]邱田,李鹏飞,林品.一个基于概念语义近似度的Web服务匹配算法[J].电子学报,37(2),2009,pp.429-432.
[25]冯兴智,姚学斌,吴泉源等.一种动态服务组合中的相容性模型[J].计算机研究与发展,45(z1),2008,pp.426-432.
[26]杨胜文,史美林.一种支持QoS约束的Web服务发现模型[J].计算机学报,28(4),2005,pp.589-594.
[27]付晓东,邹平,姜瑛.基于质量相似度的Web服务信誉度量[J].计算机集成制造系统,14(3),March.2008, pp.619-624.
[28]李春梅,蒋运承.具有QoS约束的语义Web服务发现的研究[J].计算机科学,34(6),2007,pp.116-121.
[29]夏亚梅,孟祥武,陈俊亮等.面向服务组合的偏好本体表示及应用[J].北京邮电大学学报,31(4),2008,pp.33-36.
[30]温嘉佳,陈俊亮,彭泳.一种提供用户偏好选择的Web服务组合方法[J].高技术通讯,17(3)2007,pp.243-248.
[31]Saaty T L. The analytic hierarchy process[J]. Europe Journal of Operational research,48,1990, pp.9-26.
[32]Geoff Coyle. The analytic hierarchy process introduction, Pearson Education,2004, http://www.booksites.net/download/coyle/student_files/AHP_Technique.pdf
[33]林宝平.Web服务接口的相容性与调解研究[学位论文].合肥：中国科学技术大学,2009.
[2]吴江霞.Web组合服务QoS属性预测方法研究[学位论文].北京：北京邮电大学,2008.
[3]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[4]吴国荣.从BPEL到Petri网的映射研究[学位论文].南昌：江西师范大学,2009.
[5]http://wiki.huihoo.com/index.php?title=ActiveBPEL
[6]http://book.51cto.com/art/200805/74107.htm
[7]王紫瑶,南俊杰.SOA核心技术及应用[M].电子工业出版社,2008.
[8]http://blog.csdn.net/cissyring/archive/2007/02/08/1505700.aspx
[9]http://zh.wikipedia.org/zh/Microsoft_BizTalk_Server
[10]沈斌.关联规则相关技术研究[学位论文].杭州：浙江大学,2007.
[11]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data[C]. In:Proceedings of Fourth European Conference Principles and Practice of Knowledge Discovery in Databases(PKDD'00), Lyon, France,2000, pp.13-23.
[12]Han Jiawei, Pei Jian, Yin Yiwen. Mining frequent patterns without candidate generation:a frequent-pattern tree approach[J]. Data Mining and Knowledge Discovery,8(1),2004, pp.53-87.
[13]Yan Xifeng, Han Jiawei. gSpan:graph-based substructure pattern mining[C] In:Proceedings of 2002 IEEE International Conference on Data Mining, Maebashi City, Japan,2002, pp.721-724.
[14]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. Complete mining of frequent patterns from graphs:Mining Graph Data[J]. Machine Learning,50(3), March.2003, pp.321-354.
[15]Ehud Gudes, Solomon Eyal, Shimony Natalia Vanetik. Discovering frequent graph patterns using disjoint paths[J]. IEEE Transactions on Knowledge and Data Engineering,18(11), Nov.2006, pp.1441-1456.
[16]Chi Yun, Yang Yirong, Muntz Richard R. HybridTreeMiner:an efficient algorithm for mining frequent rooted trees and free trees using canonical forms[C]. In:Proceedings of the 16th International Conference on Scientific and Statistical Database Management, Washington,2004, pp.11-20.
[17]Mohammed J. Zaki. Efficiently mining frequent trees in a forest[C]. In:Proceedings of 2002 Intl. Conference of Knowledge Discovery and Data Mining(SIGKDD'02), Edmonton, Alberta, Canada, 2002, pp.71-80.
[18]Asai Tatsuya. Efficient substructure discovery from large semi-structured data[J]. IEICE Transactions on Information and Systems, E87-D(12), Dec.2004, pp.2754-2763.
[19]Fedja Hadzic, Henry Tan, Tharam S. Dillon. UNI3-efficient algorithm for mining unordered induced subtrees using TMG candidate generation[C]. In:Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA,2007, pp.568-575.
[20]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al. IMB3-Miner:Mining induced/embedded subtrees by constraining the level of embedding[C]. In:Proceedings of 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Singapore,2006, pp.450-461.
[21]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al. MB3-Miner:mining eMBedded subTREEs using Tree Model Guided candidate generation[C]. In:Proceedings of the 1st International Workshop on Mining Complex Data, held in conjunction with ICDM'05, Texas, USA,2005, pp.103-110.
[22]Henry Tan, Fedja Hadzic, Tharam S. Dillon, et al. Tree model guided candidate generation for mining frequent subtrees from XML documents[J]. ACM Transactions on Knowledge Discovery, 2(2),2008, article No.9.
[23]Iochpe C, Chiao, C, Hess G, et al. Towards an intelligent workflow designer based on the reuse of workflow patterns[C]. In:Proceedings of 1st Brazilian Workshop on Business Process Management, Gramado, Brazil,2007, pp.249-260.
[24]Dimka Karastoyanova, Alejandro P Buchmann. Automating the development of web service compositions using templates[J]. GI Jahrestagung,2,2004, pp.517-523.
[25]Paik Incheon, Suzuki Hiroto. Pattern Templates for automating business choreography on web services[C]. In:Proceedings of 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07, Ontario, Canada,2007, pp.512-517.
[26]Zhilei Ma, Frank Leymann. A lifecycle model for using process fragment in business process modeling[C]. In:Proceedings of BPMDS'08, Montpellier, France,2008, pp.1-9.
[27]Zhilei Ma, Frank Leymann. BPEL fragments for modularized reuse in modeling BPEL processes[C]. In:Proceedings of the 2009 Fifth International Conference on Networking and Services, Valencia, Spain,2009, pp.63-68.
[28]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing (CMC 2010), Shenzhen,2010, pp.559-563.
[29]秦振,陆昌辉,张维明.信息需求描述方法综述[J].科学技术与工程,6(15),2006,pp.2321-2326.
[30]但斌,王江平,刘瑜.大规模定制环境下客户需求信息分类模型及其表达方法研究[J].计算机集成制造系统,14(8),2008,pp.1504-1511.
[31]Muhammad Ilyas, Josef Kung. A comparative analysis of similarity measurement techniques through SimReq framework[C]. In:Proceedings of the 7th International Conference on Frontiers of Information Technology, Abbotabad, Pakistan,2009, pp.1-6.
[32]Johan Natt Och Dag, Bjorn Regnell, Par Carlshamre, et al. Evaluating automated support for requirements similarity analysis in market-driven development[C]. In:Proceedings of the Seventh International Workshop on Requirements Engineering:Foundation for Software Quality (REFSQ'01), Interlaken, Switzerland,2001, pp.1-12.
[33]http://baike.baidu.com/view/364279.htm
[34]Baeten J.C.M. A brief history of process algebra[J]. Theoretical Computer Science,335(2-3), May.2005, pp.131-146.
[35]Robin Milner. A Calculus of Communicating Systems[M]. Lecture Notesin Computer Science, Springer Verlag,1980.
[36]Robin Milner. Communication and concurrency[M]. Prentice Hall,1989, pp.70-120.
[37]C.A.R. Hoare. Communicating sequential processes[J]. Communications of the ACM,21(8),1978 pp.666-677.
[38]C.A.R.Hoare. A model for communicating sequential processes[J]. On the Construction of Programs,1980, pp.229-254.
[39]C.A.R. Hoare. Communicating sequential processes[M]. Prentice Hall,1985.
[40]J.A. Bergstra, J.W. Klop. ACP:A Universal Axiom System for Process Specification[J]. CWI Quarterly 15,1987, pp.3-23.
[41]P. H. J. van Eijk, C. A. Vissers, M. Diaz. The formal description technique LOTOS[M]. Elsevier Science Publishers B.V.,1989.
[42]http://baike.baidu.com/view/2519257.htm
[43]Robin Milner. Communicating and mobile systems:the Pi-Calculus[M]. Cambridge University Press,1999.
[44]Robin Milner. The polyadic pi-calculus:a tutorial[M]. Logic and algebra of specification, Springer Verlag,1993, pp.1-50.
[45]Cheng Bo, Guo Jie, Lin Xiangtao, et al. A preliminary practice for BPEL based multimedia conference Web Services orchestration[C]. In:Proceedings of advanced international conference on telecommunications, Athens, Greece,2008,pp.321-326.
[46]Cheng Bo, Lin Xiangtao, Hu Xiaoxiao. Formal analysis for multimedia conferencing communication services orchestration[C]. In:Proceedings of 2009 IEEE International Conference on Web Services, Los Angeles, CA, USA,2009, pp.1010-1011.
[47]Zhu Da, Zhang Yang, Chen Junliang, et al. Enhancing ESB based execution platform to support flexible communication web services over heterogeneous networks[C]. In:Proceedings of 2010 IEEE International Conference on Communications, Cape Town, South Africa,2010, pp.1-6.
[1]秦振,陆昌辉,张维明.信息需求描述方法综述[J].科学技术与工程,6(15),2006,pp.2321-2326.
[2]Tidwell D. Web services-The Web's next revolution,2001, http://www.ibm.com/developerWorks/
[3]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[4]但斌,王江平,刘瑜.大规模定制环境下客户需求信息分类模型及其表达方法研究[J].计算机集成制造系统,14(8),2008,pp.1504-1511.
[5]Muhammad Ilyas, Josef Kung. A comparative analysis of similarity measurement techniques through SimReq framework[C]. In:Proceedings of the 7th International Conference on Frontiers of Information Technology, Abbotabad, Pakistan,2009, pp.1-6.
[6]Johan Natt Och Dag, Bjorn Regnell, Par Carlshamre, et al. Evaluating automated support for requirements similarity analysis in market-driven development[C]. In:Proceedings of the Seventh International Workshop on Requirements Engineering:Foundation for Software Quality, Interlaken, Switzerland,2001.
[7]Mohanty H, Chenthati D, Vaddi S, et al. Automatic generation of BPEL and WSDL from FSM models of Web Services[C]. In:Proceedings of 2006 International Conference on Advanced Computing and Communications, Surathkal,2006, pp.440-444.
[8]Li Zhang, Wei Jiang. Transforming business requirements into BPEL:A MDA-based approach to web application development[C]. In:Proceedings of 2008 IEEE International Workshop on Semantic Computing and Systems, Huangshan, China,2008, pp.61-66.
[9]Anisha Vemulapalli, Nary Subramanian. Evaluating consistency between BPEL specifications and functional requirements of complex computing systems using the NFR approach[C]. In:Proceeding of 2010 IEEE International Systems Conference, San Diego,2010, pp.153-158.
[10]Anisha Vemulapalli, Nary Subramanian. Transfonning functional requirements from UML into BPEL to efficiently develop SOA-based systems[C]. In:Proceeding of 2009 On the Move to Meaningful Internet Systems:OTM 2009 Workshops, Vilamoura, Portugal,2009, pp.337-346.
[11]Keith Mantell. From UML to BPEL:model driven architecture in a web services world, http://www.ibm.com/developerworks/webservices/library/ws-uml2bpel/#authorl
[12]Rainer Anzbock, Schahram Dustdar. Semi-automatic generation of web services and bpel processes-a model-driven approach[C]. In:Proceedings of the 3rd International Conference on Business Process Management, Nancy, France,2006, pp.64-79.
[13]吕学强,任飞亮,黄志丹等.句子相似模型和最相似句子查找算法[J].东北大学学报(自然科学版),2003,24(6),pp.531-534.
[14]赵妍妍,秦兵,刘挺等.基于多特征融合的句子相似度计算[C].全国第八届计算语言学联合学术会议,2005,pp.168-174.
[15]南铉国,崔荣一.基于多层次融合的语句相似度计算模型[J].延边大学学报(自然科学版),33(3),pp.191-194.
[16]Jin Feng, Yiming Zhou, Trevor Martin. Sentence Similarity based on Relevance[C]. In: Proceedings of IPMU'08, Malaga, Spain,2008, pp.832-839.
[17]Chukfong Ho, Masrah Azrifah, Azmi Murad, et al. Word sense disambiguation-based sentence similarity[C]. In:Proceedings of Coling 2010:Poster Volume,2010, pp.418-426.
[18]Porter M F. An algorithm for suffix stripping[J]. Program,14(3),1980, pp.130-137.
[1]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[2]Guatam Das, King Ip Lin, Heikki Mannila, et al. Rule discovery from time series[C]. In: Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining, Menlo Park, CA,1998, pp.16-22.
[3]冯玉才,冯剑琳.关联规则的增量式更新算法[J].软件学报,9(4),1998,pp.301-306.
[4]肖波,徐前方,蔺志青.可信关联规则及其基于极大团的挖掘算法[J].软件学报,19(10),Oct.2008,pp.2597-2610.
[5]叶德谦,赵世磊.基于线性回归的关联规则相关性方法的研究[J].45,2008,pp.291-294.
[6]Dass Rajanish. Using association rule mining for behavioral analysis of school students:a case from India[C]. In:Proceedings of the 42nd Annual Hawaii International Conference on System Sciences, Hawaii,2009, pp.1-6.
[7]博克斯,顾岚(译).时间序列分析：预测与控制[M].中国统计出版社,1997.
[8]韩雪梅.时间序列挖掘与预测研究[学位论文].杭州：浙江大学,2006.
[9]汪廷华,程从从.一种元规则指导的股票联动关联规则挖掘算法[J].计算机工程,32(5), March. 2006, pp.260-262.
[10]张娟,王慧锋.股票时间序列模型的关联规则挖掘[J].天津理工大学学报,22(2), April.2006, pp.35-38.
[11]Yang Yuchen, Mabu Shingo, Ohkawa Etsushi, et al. Stock movement prediction using fuzzy intertransaction class association rule mining based on genetic network programming[C]. In: Proceedings of ICCAS-SICE 2009-ICROS-SICE International Joint Conference, Fukuoka, Japan, 2009, pp.2561-2566.
[12]X Yang, D Wu, F Zhou, et al. Association rule mining for affective product design[C]. In: Proceedings of 2008 IEEE International Conference on Industrial Engineering and Engineering Management, Singapore,2008, pp.748-752.
[13]Zhou Huiyu, Mabu Shingo, Shimada Kaoru, et al. Generalized time related sequential association rule mining and traffic prediction[C]. In:Proceedings of 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway,2009, pp.2654-2661.
[14]鲍亮,宋胜利,陈胜等.BPEL中的静态流稗切片技术研究[J].系统工程与电子技术,31(1),2009,pp.241-245
[15]翟岩龙,宿红毅,张晗.基于数据流优化的BPEL流榉分割方法[J].华南理工大学学报(自然科学版),37(4), April.2009, pp.24-30.
[16]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing, Shenzhen,2010, pp.559-563.
[17]Deng Na, Deng Fang. Research of a mining method about multidimensional inter-time association rule based on sliding window[C]. In:Proceedings of China-Ireland International Conference on Information and Communications Technologies (CIICT 2008), Beijing,2008, pp.419-422.
[18]Han Jiawei, Kamber M. Data Mining:Concepts and Techniques[M]. China Machine Press,2007.
[19]Rakesh Agrawal, Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases[C]. In:Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, Santiago, Chile,1994, pp.487-499.
[20]Tang Zhaohui, Jamie MacLennan. Data Mining with SQL Server 2005[M]. Tsinghua University Press,2007.
[1]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[2]Active Endpoints Corporation. ActiveBPEL designer user's guide,2007, http://www.activevos.com/bpel.php
[3]IBM Corporation. WebSphere, http://www-01.com/software/integration/wbimodeler/advanced/
[4]Oracle Corporation. Oracle BPEL Process Manager, www.oracle.com/technology/bpel
[5]Microsoft Corporation. Biztalk, http://www.microsoft.com/biztalk/
[6]丁佐华,江明月,刘静.基于常微分方程的死锁检测实验分析[J].计算机学报,32(9), Sept.2009 pp.1736-1749.
[7]张尧学.N个有限状态机的死锁和死环回避算法[J].计算机学报,1994,17 (A00), pp.53-58.
[8]Maria Pia Fanti, Bruno Maione, Biagio Turchiano. Comparing digraph and petri net approaches to deadlock avoidance in FMS[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics,30(5), Oct.2000, pp.783-798.
[9]Ezpeleta J, Colom J M, and Martinez J. A Petri net based deadlock prevention policy for flexible manufacturing systems[J]. IEEE Transaction on Robotics and Automation,11(2),1995, pp. 173-184.
[10]梁中兴,罗贵明,旷宏斌.基于CEGAR偏序化简的并行程序死锁检测[J].计算机工程,35(19), Oct.2009, pp.65-68.
[11]崔焕庆,刘强.基于Petri网并行程序通信死锁的检测和预防[J].计算机工程,34(23),Dec.2008, pp.50-52.
[12]刘荣峰,李引珍,吴桂华.基于Petri网的分布式系统并发进程的死锁检测[J].计算机工程与设计,28(22), Nov.2007, pp.5353-5355.
[13]Li Zhiwu, Zhou Mengchu. Comparison of two deadlock prevention methods for different-size flexible manufacturing systems[J]. International Journal of Intelligent control and system,10(3), Sept.2005, pp.235-243.
[14]卢超,卢炎生,谢晓东等.一种基于依赖分析的并发程序潜在死锁检测算法[J].小型微型计算机系统,28(5),2007,pp.841-844.
[15]Senichi Onoda, Yoshitomo Ikkai, Takashi Kobayashi, et al. Definition of deadlock patterns for business processes work on models[C]. In:Proceedings of the Annual Hawaii International Conference on System Sciences, Maui, Hawaii,1999, pp.1-4.
[16]Tetsuya Maruta, Senichi Onoda, Yoshitomo Ikkai, et al. A deadlock detection algorithm for business processes workflow models[C]. In:Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, San Diego, CA, USA,1998, pp.611-616.
[17]陈胜,鲍亮,陈平等.BPEL流程数据竞争和死锁检测算法研究[J].西安电子科技大学学报,35(6),2008,pp.1056-1063.
[18]Yi Qian, Yuming Xu, Zheng Wang, et al. Tool support for BPEL verification in ActiveBPEL engine[C]. In:Proceedings of the 18th Australian Software Engineering Conference (ASWEC), Melbourne, Australia,2007, pp.90-100.
[19]Chun Ouyang, Eric Verbeek, Stephen Breutel, et al. Formal semantics and analysis of control Flow in WS-BPEL[J]. Science of Computer Programming,67(2-3), July 2007, pp.162-198.
[20]Abrehet Mohammed Omer, Alexander Schill. Dependency based automatic service composition using directed graph[C]. In:Proceedings of the 2009 Fifth International Conference on Next Generation Web Services Practices. Prague, Czech Republic,2009, pp.76-81.
[21]Zhangbing Zhou, Sami Bhiri, Manfred Hauswirth. Control and data dependencies in business processes based on semantic business activities[C]. In:Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services Linz, Austria,2008, pp.257-263.
[22]王敬亚,朱怀宏,胡琰华等.利用控制依赖关系算法分析BPEL4WS[J]计算机工程与科学,30(10),2008,pp.45-48.
[23]Qinyi Wu, Calton Pu, Akhil Sahai, et al. Categorization and optimization of synchronization dependencies in business processes[C]. In:Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), April 2007, pp.306-315.
[24]牟廉明.求有向图的所有Euler回路算法[J].内江师范学院学报,32(2),2008,pp.11-14.
[25]马丰宁,寇纪淞,李敏强.用遗传规划求欧拉回路[J].系统工程理论与实践,5,1997,pp.19-28.
[26]牟廉明.求有向图的所有Hamilton回路的新方法[J].计算机工程,33(17),Sept.2007,pp.208-210.
[27]王彦祺.用”遗传”算法求任意图的所有哈密顿回路[J].哈尔滨工业大学学报,36(12),Dec.2004, pp.1690-1692.
[28]文中华,姜云飞.用分层关联方法求有向图中所有Hamilton回路的算法[J].计算机研究与发展,,42(10),2005,pp.1809-1814.
[29]V. Ejov, J. A. Flar, S. K. Lucas, et al. Solving the hamiltonian cycle problem using symbolic determinants [J]. Taiwanese Journal of Mathematics,10,2006, pp.327-337.
[30]Zhu Lizhi. A polynomial time algorithm for hamilton cycle(Path)[C]. In:Proceedings of 2010 International Conference on Computer Design and Applications (1CCDA),3,2010, pp.207-210.
[31]James C. Tiernan. An efficient search algorithm to find the elementary circuits of a graph[J]. Communications of the ACM,13(12), Dec.1970, pp.722-726.
[32]Robert E Tarjan. Enumeration of the elementary circuits of a directed graph[J]. SIAM Journal on Computing,2(3),1972, pp.211-216.
[33]Liu Hongbo, Wang Jiaxin. A new way to enumerate cycles in graph[C]. In:Proceedings of International Conference on Internet and Web Applications and Services/Advanced International Conference,2006, pp:57-57.
[34]Donald B Johnson. Finding all elementary circuits of a directed graph[J]. SIAM Journal on Computing,4(1),1975, pp.77-84.
[1]Tidwell D. Web services-The Web's next revolution, http://www.ibm.com/developerWorks/
[2]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[3]Microsoft Corporation. XLANG/s Language, http://msdn.microsoft.com/en-us/library/aa577463(BTS.70).aspx
[4]F. Leymann. Web Services Flow Language (version 1.0),2001, http://www-4.ibm.com/software/solutions/webservices/pdf/WSFL.pdf
[5]Fedja Hadzic, Henry Tan, Tharam S. Dillon. UNI3-efficient algorithm for mining unordered induced subtrees using TMG candidate generation[C]. In:Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA,2007, pp.568-575.
[6]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al.IMB3-Miner:Mining induced/embedded subtrees by constraining the level of embedding[C]. In:Proceedings of 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Singapore,2006, pp.450-461.
[7]Henry Tan, Tharam S. Dillon, Fedja Hadzic, et al. MB3-Miner:mining eMBedded subTREEs using Tree Model Guided candidate generation[C]. In:Proceedings of the 1st International Workshop on Mining Complex Data, held in conjunction with ICDM'05, Texas, USA,2005, pp.103-110
[8]Henry Tan, Fedja Hadzic, Tharam S. Dillon, et al. Tree Model Guided Candidate Generation for Mining Frequent Subtrees from XML Documents [J]. ACM Transactions on Knowledge Discovery, 2(2),2008, article No.9.
[9]Cheng Bo, Guo Jie, Lin Xiangtao, et al. A preliminary practice for BPEL based multimedia conference Web Services orchestration[C]. In:Proceedings of advanced international conference on telecommunications, Athens, Greece,2008, pp.321-326.
[10]Cheng Bo, Lin Xiangtao, Hu Xiaoxiao. Formal analysis for multimedia conferencing communication services orchestration[C]. In:Proceedings of 2009 IEEE International Conference on Web Services, Los Angeles, CA, USA,2009, pp.1010-1011.
[11]Zhu Da, Zhang Yang, Chen Junliang, et al. Enhancing ESB based execution platform to support flexible communication web services over heterogeneous networks[C]. In:Proceedings of 2010 IEEE International Conference on Communications, Cape Town, South Africa,2010, pp.1-6.
[12]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing(CMC 2010), Shenzhen,2010, pp.559-563.
[13]van der Aalst W.M.P., Reijers H.A., Weijters A.J.M.M., et al. Business process mining:an industrial application[J]. Information Systems,32(5), July 2007, pp.713-732.
[14]van der Aalst W.M.P., Weijters A.J.M.M., Maruster L. Workflow mining:Which processes can be rediscovered? [C]. In:Proceedings of BETA Working Paper Series, WP 74, Eindhoven University of Technology, Eindhoven,2002.
[15]Gombotz Robert, Dustdar Schahram. On web services workflow mining[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),3812,2005, pp.216-228.
[16]W. Vanderaalst, B. Vandongen, J. Herbst, et al. Workflow mining:a survey of issues and approaches[J]. Data & Knowledge Engineering,47(2), Nov.2003, pp.237-267.
[17]Iochpe C., Chiao, C., Hess G., et al. Towards an intelligent workflow designer based on the reuse of workflow patterns[C]. In:Proceedings 1st Brazilian Workshop on Business Process Management (in conjunction with Simposio Brasileiro de Sistemas Multimidia e Web), Gramado, Brazil,2007.
[18]Dimka Karastoyanova, Alejandro P Buchmann. Automating the development of web service compositions using templates[J]. GI Jahrestagung,2,2004, pp.517-523.
[19]Paik Incheon, Suzuki, Hiroto. Pattern templates for automating business choreography on web services [C]. In:Proceedings of 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07, Ontario, Canada,2007, pp.512-517.
[20]Zhilei Ma, Frank Leymann. A lifecycle model for using process fragment in business process modeling[C]. In:Proceedings of BPMDS'08, Montpellier, France,2008, pp.1-9.
[21]Zhilei Ma, Frank Leymann. BPEL fragments for modularized reuse in modeling BPEL processes[C]. In:Proceedings of the 2009 Fifth International Conference on Networking and Services, Valencia, Spain,2009, pp.63-68.
[22]Deng Min, Deng Na, Peng Yong, et al. The algorithm of sub-process discovery for BPEL process based on variable dependence[C]. In:Proceedings of 2010 International Conference on Communications and Mobile Computing (CMC 2010), Shenzhen,2010, pp.559-563.
[23]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data[C]. In:Proceedings of Fourth European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD'00), Lyon, France,2000, pp.13-23.
[24]Han Jiawei, Pei Jian, Yin Yiwen. Mining frequent patterns without candidate generation:a frequent-pattern tree approach[J]. Data Mining and Knowledge Discovery,8(1),2004,53-87.
[25]Yan Xifeng, Han Jiawei. gSpan:graph-based substructure pattern mining[C]. In:Proceedings of 2002 IEEE International Conference on Data Mining, Maebashi City, Japan,2002, pp.721-724.
[26]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. Complete mining of frequent patterns from graphs:mining graph data[J]. Machine Learning,50(3), March 2003, pp.321-354.
[27]Ehud Gudes, Solomon Eyal, Shimony Natalia Vanetik. Discovering frequent graph patterns using disjoint paths[J]. IEEE Transactions on Knowledge and Data Engineering,18(11), Nov.2006, pp.1441-1456.
[28]Chi Yun, Yang Yirong, Muntz Richard R. HybridTreeMiner:an efficient algorithm for mining frequent rooted trees and free trees using canonical forms [C]. In:Proceedings of the 16th International Conference on Scientific and Statistical Database Management, Washington,2004, pp.11-20.
[29]Mohammed J. Zaki. Efficiently mining frequent trees in a forest[C]. In:Proceedings of 2002 Intl. Conference of Knowledge Discovery and Data Mining(SIGKDD'02), Edmonton, Alberta, Canada, 2002, pp.71-80.
[30]Asai Tatsuya. Efficient substructure discovery from large semi-structured data[J]. IEICE Transactions on Information and Systems, E87-D(12), Dec.2004, pp.2754-2763.
[31]Deng Na, Chen Junliang, Cheng Bo, et al. A recommendation method of BPEL activity based on association rules mining[C]. In:Proceedings of the 2010 International Conference on Computational Intelligence and Software Engineering, Wuhan,2011, pp.1-4.
[32]Rakesh Agrawal, Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases[C]. In:Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, Santiago, Chile,1994. pp.487-499
[33]Abe K., Kawasoe S, Asai T, et al. Optimized substructure discovery for semistructured data[C]. In: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2002), Helsinki, Finland,2002, pp.1-4.
[1]廖军,谭浩,刘锦德.基于Pi演算的Web服务组合的描述和验证[J].计算机学报,28(4),2005,pp.635-643.
[2]辜希武,卢正鼎.基于Pi-演算的BPEL4WS Web服务组合形式化模型[J].计算机科学,34(4),2007,pp.69-74.
[3]Javier Camaraa, Carlos Canalb, Javier Cuboa, et al. A Formalizing WSBPEL business processes using process algebra[J]. The 4th International Workshop on the Foundations of Coordination Languages and Software Architectures, Electronic Notes in Theoretical Computer Science,154(1), 2006, pp.159-173.
[4]Roberto Lucchi, Manuel Mazzara. A pi-calculus based semantics for WS-BPEL[J]. Journal of Logic and Algebraic Programming in Web Services and Formal Methods,70(1),2007, pp.96-118.
[5]B.C. Pierce, D. Sangiorgi. Typing and subtyping for mobile processes[J]. Journal of Mathematical Structures in Computer Science,6(5),1996, pp.409-454.
[6]Robin Milner. Communication and concurrency[M]. Prentice Hall,1989, pp.70-120.
[7]Robin Milner. Communicating and mobile systems:the Pi-Calculus. Cambridge University Press, 1999.
[8]Robin Milner. The polyadic pi-calculus:a tutorial[M]. Logic and algebra of specification, Springer Verlag,1993, pp.1-50.
[9]刘荣胜,黄邵,高春鸣.基于类型化Pi演算的Web服务组合相容性检测[J].计算机工程与应用,43(7),2007,pp.20-24.
[10]辜希武,卢正鼎.类型化的Web服务组合形式化模型[J].计算机科学,35(1),2008,pp.128-134.
[11]Su Jindian, Yu Shanshan, Guo Heqing. Analysis of web service substitutability based on typed calculus[C]. In:Proceedings of 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, Washington,2008, pp.559-564.
[12]刘琼,彭鑫,赵文耘.一种改进的基于Pi演算的Web服务自动组装方法[J1.计算机工程与应用,43(16),2007,pp.67-70.
[13]Paul V. Biron, Kaiser Permanente, Ashok Malhotra. XML Schema Part 2:Datatypes Second Edition, http://www.w3.org/TR/xmlschema-2/
[14]Oasis. Business process execution language(bpel) v2.0, http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
[15]Victor B, Moller F. The mobility workbench-a tool for the pi-calculus[C]. In:Proceedings of the 6th International Conference on Computer Aided Verification, London,1994, pp.428-440.
[1]Hamid R. Motahari Nezhad, Boualem Benatallah, Axel Martens, et al. Semi-automated adaptation of service interactions[C]. In:Proceedings of WWW'07, Alberta, Canada,2007, pp.993-1002.
[2]Li yunyao, H.V. Jagadish. Compatibility detemination in web services[C]. In:Proceedings of ICEC Workshop on Workshop on E-Government and Web Services, Pittsburgh, PA, USA,2003, pp.1-8.
[3]史玉良,王海洋,张亮等.Web服务合成的相容性与替换性分析[J].计算机研究与发展,44(11),2007,pp.1955-1961
[4]胡军,高济,李长云.多主体系统中基于本体论的服务相容匹配机制[J].计算机辅助设计与图形学学报,15(5), May.2006, pp.694-701.
[5]Valeria De Antonellis, Michele Melchiori, Pierluigi Plebani. An approach to web service compatibility in cooperative processes [C]. In:Proceedings of Workshop on Service Oriented Computing (SOC), Orlando,2003. pp.1-6.
[6]Chen Shu, Wu Guoqing, Xiao Jing. A process algebra approach for the compatibility analysis of web services[C]. In:Proceedings of 2008 Second International Conference on Future Generation Communication and Networking, Hainan Island,2008, pp.305-308
[7]Liu Fangfang, Zhang Liang, Shi Yuliang, et al. Formal analysis of compatibility of web services via CCS[C]. In:Proceedings of International Conference on Next Generation Web Services Practices (NWeSP'05), Seoul, Korea,2005, pp.1-6.
[8]Zhang Chi. Web service interface extending and description based on pi calculus [C]. In: Proceedings of 2008 International Symposium on Computer Science and Computational Technology, Shanghai, China,2008, pp.203-206,
[9]辜希武,卢正鼎.Web服务相容性的形式化描述与分析[J].计算机工程与应用,43(27),2007,pp.8-33.
[10]邓水光,李莹,吴健等.Web服务行为兼容性的判定与计算[J].软件学报,18(12),2007,pp.3001-3014.
[11]刘荣胜,黄邵,高春鸣.基于类型化Pi-演算的Web服务组合相容性检测[J].计算机工程与应用,43(7)2007,pp.120-124.
[12]Tan Wei, Rao Fangyan, Fan Yushun, et al. Compatibility analysis and mediation-aided composition for BPEL services[C]. In:Proceedings of 2007 Intl. Conf. on Database Systems for Advanced Applications, Bangkok, Thailand,2007, pp.1062-1065.
[13]Tan Wei, Fan Yushun, Zhou MengChu. A petri net-based method for compatibility analysis and composition of web Services in business process execution language[J]. IEEE Transactions on Automation Science and Engineering,6(11), Jan.2009, pp.94-106.
[14]Yanping Yang, Mingan Zhang, Xiqing Ye, et al. Protocol Compatibility Verification for Web Services Interaction[C]. In:Proceedings of 2009 Fifth International Conference on Semantics, Knowledge and Grid, Zhuhai,2009, pp.106-112.
[15]熊鹏程,范玉顺.一种基于Petri网的网络服务兼容性分析方法[J].高技术通讯,18(9),Sept.2008,pp.943-947.
[16]Axel Martens. On compatibility of web services[J]. Petri Net Newsletter,65,2003, pp.12-20.
[17]Lucas Bordeaux, Gwen Salaun, Daniela Berardi, et al. When are two web services compatible?[C]. In:Proceedings of TES2004, Berlin Heidelberg,2005, pp.15-28.
[18]Shi Yuliang, Zhang Liang, Liu Fangfang, et al. Compatibility analysis of web services[C]. In: Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence, Compiegne, France,2005, pp.483-486.
[19]Xueqiang Gong, Jing Liu, Miaomiao Zhang, et al. Formal analysis of services compatibility[C]. In: Proceedings of 33rd Annual IEEE International Computer Software and Applications Conference, Washington DC,2009, pp.243-248.
[20]Woralak Kongdenfha, Hamid Reza Motahari-Nezhad, Boualem Benatallah, et al. Mismatch patterns and adaptation aspects:A foundation for rapid development of web service adapters[J]. IEEE. Transaction on Services Computing,2(2), April-June.2009, pp.94-107
[21]缪晶晶.Web服务行为适配技术研究[学位论文].杭州：浙江大学2008
[22]殷昱煜,李莹,邓水光等.Web服务行为一致性与相容性判定[J].电子学报,37(3),Mar.2009.pp.433-438.
[23]Marlon Dumas, Boualem Benatallah, Hamid R. Motahari Nezhad. Web Service Protocols: Compatibility and Adaptation[C]. In:Proceedings of IEEE Data Engineering Bulletin,31(3),2008, pp.40-44.
[24]邱田,李鹏飞,林品.一个基于概念语义近似度的Web服务匹配算法[J].电子学报,37(2),2009,pp.429-432.
[25]冯兴智,姚学斌,吴泉源等.一种动态服务组合中的相容性模型[J].计算机研究与发展,45(z1),2008,pp.426-432.
[26]杨胜文,史美林.一种支持QoS约束的Web服务发现模型[J].计算机学报,28(4),2005,pp.589-594.
[27]付晓东,邹平,姜瑛.基于质量相似度的Web服务信誉度量[J].计算机集成制造系统,14(3),March.2008, pp.619-624.
[28]李春梅,蒋运承.具有QoS约束的语义Web服务发现的研究[J].计算机科学,34(6),2007,pp.116-121.
[29]夏亚梅,孟祥武,陈俊亮等.面向服务组合的偏好本体表示及应用[J].北京邮电大学学报,31(4),2008,pp.33-36.
[30]温嘉佳,陈俊亮,彭泳.一种提供用户偏好选择的Web服务组合方法[J].高技术通讯,17(3)2007,pp.243-248.
[31]Saaty T L. The analytic hierarchy process[J]. Europe Journal of Operational research,48,1990, pp.9-26.
[32]Geoff Coyle. The analytic hierarchy process introduction, Pearson Education,2004, http://www.booksites.net/download/coyle/student_files/AHP_Technique.pdf
[33]林宝平.Web服务接口的相容性与调解研究[学位论文].合肥：中国科学技术大学,2009.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |