基于Petri网的Web服务组合性能评价体系的研究
|
摘要
Web服务组合的本质是通过若干Web服务间的相互通信和协作灵活实现上层业务需求,并能够屏蔽底层实现技术的改变对上层产生的影响。Web服务组合是面向服务架构(Service-Oriented Architecture, SOA)中构建新服务和满足业务需求的主要手段,在业务流程的构造和重组中处于核心地位,因此Web服务组合的性能及其评价方法对SOA的发展至关重要。
本文结合国家863项目“动态Web服务组合关键技术及其性能分析研究”,从定性分析和定量分析两个角度对Web服务组合的性能评价展开讨论,对其中的关键技术进行了研究。本论文的主要工作包括以下内容：
(1)为了在Web服务组合从设计产生到服务结束整个生存期的各个环节监控其质量,提出一种贯穿Web服务组合的整个生存期的Web服务组合性能评价体系结构。该体系由两个闭环负反馈系统组成,分别对Web服务组合做了定性性能分析和定量性能分析。为了实现该性能评价体系,提出一种基于随机Petri网的Web服务组合的性能分析模型WSCPAM,并分析出它天生具有的两个结构约束。WSCPAM是性能评价体系的物质基础,体系所开展的评价工作均在其上进行。
(2)为了能够在设计阶段发现结构中固有的致命弱点,保证运行时的Web服务组合是良结构的,给出WSCPAM进行各项结构验证(包括结构约束的验证、活性的验证、有界性的验证、死锁的验证和陷阱的验证)的意义,并给出实现算法。
(3)为了有效利用WSCPAM模型对Web服务组合进行性能的定量分析,给出了一个详细完整的WSCPAM模型转换为同构马尔可夫链的算法。算法主要包括三个规则：转换规则、演变规则和合并规则。运用Floyd不变式断言法证明了算法的部分正确性,运用良序集法证明了算法的终止性。算法是部分正确的且是可终止的,这个证明结论说明算法是完全正确的。对算法时间复杂性的分析表明算法是有效的。利用产生的马尔可夫链对WSCPAM模型的多项性能指标进行定量分析。
(4)Web服务组合的性能对推动以服务为核心的价值链的良性融合起着重要作用。针对如何有效发现Web服务组合中性能瓶颈的问题,提出两种Web服务组合性能瓶颈定位策略BNL-WSCPAM和BRF-WSCPAM。
根据库所和变迁之间的直接关系总结出模型的四种基本结构,并证明了它们的完备性(即四种直接关系之间的不同复合可以表示出Web服务的各种组合方式)。通过结构转换得到性能瓶颈定位分析结构集{顺序结构、分支结构、汇聚结构},在此基础上提出性能瓶颈定位策略BNL-WSCPAM。该策略根据与时间有关的性能指标对库所进行分类,针对不同类型库所在三种分析结构中的所有可能分布,通过顺向结构分析和逆向结构分析相结合的方法,讨论瓶颈可能存在的位置,并给出如何确定三种分析结构的结构发现定理。实验证明策略的预测结果是有效的。
与BNL-WSCPAM不同的是,性能瓶颈定位策略BRF-WSCPAM是仅仅基于性能指标提出的。在前面求得的各项性能指标中分析出对产生瓶颈贡献大的性能指标,将这些性能指标做归一化的处理,得到一个综合的性能参数——瓶颈风险系数,针对这个参数对模型中所有的变迁做一个统一的度量,从中发现可能存在的瓶颈。
The nature of Web services composition is to flexibly achieve upper business needs through communication and collaboration between Web services, and can mask the impacts which are the underlying implementation technology changes haven on the upper. Web services composition is the primary means to build new services and meet business needs in Service-Oriented Architecture (SOA), and is at the core position in business processes' construction and reorganization. Therefore, the performance and performance evaluation methods of Web services composition are important to the development of SOA.
Supported by the National High-Tech Reaearch and Development Plan (863) of "the researches about key technologies and performance evaluation of dynamic Web services composition", we discuss on the performance evaluation of Web services composition from two views which are qualitative analysis and quantitative analysis, and we research on the related key technologies. The main contributions are as follows:
(1) In order to monitor the quality of Web services composition in all aspects of the period from Web services composition's generation to its end, this paper proposes a kind of performance evaluation architecture for Web services composition which is throughout the entire lifetime of Web services composition. The architecture consists of two closed-loop negative feedback systems. The one provides qualitative analysis for the performance of Web services composition, and the other one offers quantitative analysis for the performance of Web services composition. In order to achieve the performance evaluation architecture, this paper proposes a performance analysis model WSCPAM for Web services composition, which is based Stochastic Petri Net. And the two inherent structure constraint conditions of WSCPAM are discovered. WSCPAM is the material basis of the architecture, on which all performance evaluation jobs by the architecture are carried.
(2) To be able to discover the inherent Fatal weaknesses of the structure in the design phase and ensure run-time Web service composition is good structure, this paper gives the meanings of conducting various structural verifications (including structural constraint conditions verification, liveness verification, boundedness verification, deadlock verification and trap verification), and provides algorithms to implement these verifications.
(3) In order to effectively using WSCPAM model to conduct performance quantitative analysis for Web service composition, this paper presents a detailed and complete algorithm for converting WSCPAM model to isomorphic Markov chain. The algorithm mainly includes three rules, which respectively are conversion rule, evolution rules and merger rules. The Partial correctness of the algorithm is proved by Floyd invariant assertion method. The Termination of the algorithm is proved by well-ordered set method. The algorithm is completely correct, which can be illustrated by the conclusion which is that the algorithm is partial correct and can be terminated. The time complexity analysis of the algorithm shows that the algorithm is effective. Using the generated Markov chain, a number of performance indicators of WSCPAM model can be calculated.
(4) The performance of Web services composition plays an important role in improving the virtuous integration of the value chain at the core of services. For how to effectively identify the performance bottlenecks of Web services composition, this paper proposes two performance bottlenecks location strategies BNL-WSCPAM and BRF-WSCPAM.
Based on the all direct relationships between place node and transition node, four basic structures of the model are summarized. And the completeness property of the four basic structures is proved, which means the different compositions between the four kinds of direct relations can represent various Web services combinations. Through structural conversion, an analysis structures set is obtained, which includes Sequence structure, Split structure and Join structure, and is used to predict performance bottlenecks that may exist. On the basis of the set, the paper presents the performance bottlenecks location strategy BNL-WSCPAM for Web services composition. According to time-related performance indicators, the strategy classifies different types of places. Under the various distributions of different types of places in three kinds of analysis structures, the performance bottlenecks that may exist have been discussed through the Down Arc Analysis method and Reverse Arc Analysis method. This paper also gives Structure Discovery Theorem, which is used to determine the three kinds of analysis structures. The experimental results show that the prediction of the strategy is valid.
It is different from BNL-WSCPAM that the performance bottlenecks location strategy BRF-WSCPAM is solely based on performance indicators. Through analyzing the obtained performance indicators in previous works, it finds these performance indicators which make large contribution for bottleneck generation. And then through normalize these indicators, a comprehensive performance parameter-Bottleneck Risk Factor is obtained. Based on the parameter, all transitions in WSCPAM are uniformly measured, and some bottlenecks may be found.
本文结合国家863项目“动态Web服务组合关键技术及其性能分析研究”,从定性分析和定量分析两个角度对Web服务组合的性能评价展开讨论,对其中的关键技术进行了研究。本论文的主要工作包括以下内容：
(1)为了在Web服务组合从设计产生到服务结束整个生存期的各个环节监控其质量,提出一种贯穿Web服务组合的整个生存期的Web服务组合性能评价体系结构。该体系由两个闭环负反馈系统组成,分别对Web服务组合做了定性性能分析和定量性能分析。为了实现该性能评价体系,提出一种基于随机Petri网的Web服务组合的性能分析模型WSCPAM,并分析出它天生具有的两个结构约束。WSCPAM是性能评价体系的物质基础,体系所开展的评价工作均在其上进行。
(2)为了能够在设计阶段发现结构中固有的致命弱点,保证运行时的Web服务组合是良结构的,给出WSCPAM进行各项结构验证(包括结构约束的验证、活性的验证、有界性的验证、死锁的验证和陷阱的验证)的意义,并给出实现算法。
(3)为了有效利用WSCPAM模型对Web服务组合进行性能的定量分析,给出了一个详细完整的WSCPAM模型转换为同构马尔可夫链的算法。算法主要包括三个规则：转换规则、演变规则和合并规则。运用Floyd不变式断言法证明了算法的部分正确性,运用良序集法证明了算法的终止性。算法是部分正确的且是可终止的,这个证明结论说明算法是完全正确的。对算法时间复杂性的分析表明算法是有效的。利用产生的马尔可夫链对WSCPAM模型的多项性能指标进行定量分析。
(4)Web服务组合的性能对推动以服务为核心的价值链的良性融合起着重要作用。针对如何有效发现Web服务组合中性能瓶颈的问题,提出两种Web服务组合性能瓶颈定位策略BNL-WSCPAM和BRF-WSCPAM。
根据库所和变迁之间的直接关系总结出模型的四种基本结构,并证明了它们的完备性(即四种直接关系之间的不同复合可以表示出Web服务的各种组合方式)。通过结构转换得到性能瓶颈定位分析结构集{顺序结构、分支结构、汇聚结构},在此基础上提出性能瓶颈定位策略BNL-WSCPAM。该策略根据与时间有关的性能指标对库所进行分类,针对不同类型库所在三种分析结构中的所有可能分布,通过顺向结构分析和逆向结构分析相结合的方法,讨论瓶颈可能存在的位置,并给出如何确定三种分析结构的结构发现定理。实验证明策略的预测结果是有效的。
与BNL-WSCPAM不同的是,性能瓶颈定位策略BRF-WSCPAM是仅仅基于性能指标提出的。在前面求得的各项性能指标中分析出对产生瓶颈贡献大的性能指标,将这些性能指标做归一化的处理,得到一个综合的性能参数——瓶颈风险系数,针对这个参数对模型中所有的变迁做一个统一的度量,从中发现可能存在的瓶颈。
The nature of Web services composition is to flexibly achieve upper business needs through communication and collaboration between Web services, and can mask the impacts which are the underlying implementation technology changes haven on the upper. Web services composition is the primary means to build new services and meet business needs in Service-Oriented Architecture (SOA), and is at the core position in business processes' construction and reorganization. Therefore, the performance and performance evaluation methods of Web services composition are important to the development of SOA.
Supported by the National High-Tech Reaearch and Development Plan (863) of "the researches about key technologies and performance evaluation of dynamic Web services composition", we discuss on the performance evaluation of Web services composition from two views which are qualitative analysis and quantitative analysis, and we research on the related key technologies. The main contributions are as follows:
(1) In order to monitor the quality of Web services composition in all aspects of the period from Web services composition's generation to its end, this paper proposes a kind of performance evaluation architecture for Web services composition which is throughout the entire lifetime of Web services composition. The architecture consists of two closed-loop negative feedback systems. The one provides qualitative analysis for the performance of Web services composition, and the other one offers quantitative analysis for the performance of Web services composition. In order to achieve the performance evaluation architecture, this paper proposes a performance analysis model WSCPAM for Web services composition, which is based Stochastic Petri Net. And the two inherent structure constraint conditions of WSCPAM are discovered. WSCPAM is the material basis of the architecture, on which all performance evaluation jobs by the architecture are carried.
(2) To be able to discover the inherent Fatal weaknesses of the structure in the design phase and ensure run-time Web service composition is good structure, this paper gives the meanings of conducting various structural verifications (including structural constraint conditions verification, liveness verification, boundedness verification, deadlock verification and trap verification), and provides algorithms to implement these verifications.
(3) In order to effectively using WSCPAM model to conduct performance quantitative analysis for Web service composition, this paper presents a detailed and complete algorithm for converting WSCPAM model to isomorphic Markov chain. The algorithm mainly includes three rules, which respectively are conversion rule, evolution rules and merger rules. The Partial correctness of the algorithm is proved by Floyd invariant assertion method. The Termination of the algorithm is proved by well-ordered set method. The algorithm is completely correct, which can be illustrated by the conclusion which is that the algorithm is partial correct and can be terminated. The time complexity analysis of the algorithm shows that the algorithm is effective. Using the generated Markov chain, a number of performance indicators of WSCPAM model can be calculated.
(4) The performance of Web services composition plays an important role in improving the virtuous integration of the value chain at the core of services. For how to effectively identify the performance bottlenecks of Web services composition, this paper proposes two performance bottlenecks location strategies BNL-WSCPAM and BRF-WSCPAM.
Based on the all direct relationships between place node and transition node, four basic structures of the model are summarized. And the completeness property of the four basic structures is proved, which means the different compositions between the four kinds of direct relations can represent various Web services combinations. Through structural conversion, an analysis structures set is obtained, which includes Sequence structure, Split structure and Join structure, and is used to predict performance bottlenecks that may exist. On the basis of the set, the paper presents the performance bottlenecks location strategy BNL-WSCPAM for Web services composition. According to time-related performance indicators, the strategy classifies different types of places. Under the various distributions of different types of places in three kinds of analysis structures, the performance bottlenecks that may exist have been discussed through the Down Arc Analysis method and Reverse Arc Analysis method. This paper also gives Structure Discovery Theorem, which is used to determine the three kinds of analysis structures. The experimental results show that the prediction of the strategy is valid.
It is different from BNL-WSCPAM that the performance bottlenecks location strategy BRF-WSCPAM is solely based on performance indicators. Through analyzing the obtained performance indicators in previous works, it finds these performance indicators which make large contribution for bottleneck generation. And then through normalize these indicators, a comprehensive performance parameter-Bottleneck Risk Factor is obtained. Based on the parameter, all transitions in WSCPAM are uniformly measured, and some bottlenecks may be found.
引文
[1]吴钊.保证服务质量的动态Web服务组合及其性能分析研究[D].武汉：武汉大学,2007.
[2]D. Schahram, S. Wolfgang. A survey on web services composition[J]. International Journal of Web and Grid Services,2005,1(1):1-30.
[3]F. Andrea. Web services:a process algebra approach. In:proceedings of the 2nd international conference on Service oriented computing (ICSOC04), New York, USA, 2004.
[4]丘昆,王晓玲,周傲英.Web服务核心支撑技术：研究综述[J].软件学报,2004,15(3)：428-442.
[5]M. Dean, D. Connolly, F. van Harmelen, J. Hendler, I. Horrocks, D. L. McGuinness, P. F. Patel-Schneider and L. AStein. Web Ontology Language (OWL) Reference Version 1.0. W3C Working Draft 12 November 2002.
[6]Chinnici R., Moreau J. J., Ryman A., et al. Web service description language (WSDL) v2.0. W3C, August 2005.
[7]Gudgin M., Hadley M., Mendelsohn N., et al. Simple object access protocol (SOAP) vl.2. W3C Recommendation, June 2003.
[8]Clement L., Hately A., von Riegen C., et al. UDDI specification version 3.0.2, OASIS, October 2004.
[9]Andrews T., Curtera F., Kuno H., Dholakia Y., Goland J., et al. Business Process Execution Language for Web Services Version 1.1. BEA Systems, IBM Corporation, Microsoft Corporation, SAP AG, Siebel Systems, May 2003.
[10]蒋运承,史忠植.OWL-S的形式语义[J].计算机科学,2005,32(7)：5-7.
[11]李发英,朱海滨.基于OWL本体和描述逻辑的Web服务匹配模型研究[J].科学技术与工程,2006,6(20)：3306-3309.
[12]郑红军,张乃孝.软件开发中的形式化方法[J].计算机科学,1997,24(6)：90-96.
[13]李舟军.传值CCS和π-演算中互模拟等价的验证理论与算法[D].长沙：国防科技大学,1999.
[14]Ulrich Herzog. Formal Methods for Performance Evaluation[C].7th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2007, Bertinoro, Italy, May 8-June 2,2007.
[15]林闯,李雅娟,王忠民.性能评价形式化方法的现状与发展[J].电子学报,2002,30(12A)：1917-1922.
[16]H. Kobayashi. Modeling and Analysis—An Introduction to System Performance Evaluation Methodology[M]. London:Addison-Wesley, 1978.
[17]P. Tran-Gia. Analytische Leistungsbewertung verteilter Systeme. German:Springer, 1996.
[18]D. Gross, C. M. Harris. Fundamentals of Queuing Theory (Second Edition) [M]. New York:John Wiley & Sons, 1985.
[19]Kishor S. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications[M]. Prentice-Hall,1982.
[20]W.J. Stewart. Numerical Analysis Methods. In G. Haring. Ch. Lindemann, and M. Reiser, editors, Performance Evaluation:Origins and Directions, LNCS 1769, pages 355-376. Springer, Berlin, Heidelberg, 2000.
[21]W. J. Stewart. Introduction to the numerical solution of Markov chains. Princeton University Press, 1994.
[22]G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queuing Networks and Markov Chains[M]. New York:John Wiley & Sons, 1998.
[23]陆传赉.排队论(第2版)[M].北京：北京邮电大学出版社,2009.
[24]徐萌.基于服务关系的服务组合相关技术研究[D].北京：北京邮电大学,2007.
[25]C. H. Xia, Z. Liu, D. Towsley, M. Lelarge. Scalability of Fork/Join Queuing Networks with Blocking. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS),2007, pp:133-144.
[26]G. Casale, N. F. Mi, Evgenia Smirni. Bound analysis of closed queueing networks with workload burstiness. In Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2008.
[27]Ferrari G., Ezhilchelvan P., Mitrani I.. Performance modeling and evaluation of e-business systems. In: Proceedings of the 39th Annual Simulation Symposium, Huntsville, Alabama, 2006. Washington, DC, USA: IEEE Computer Society, 2006: 135-142.
[28]林闯,魏丫丫.随机进程代数与随机Petri网[J].软件学报,2002,13(2)：203-213.
[29]Schneider S.. An operational semantics for timed CSP. Information & Computation, 1995, 116(2):193-213
[30]Moller F., Tofts C.. A temporal calculus of communicating systems. In:Baeten J.C.M., Klop J-W., eds. Proceedings of Concur'90:Theories of Concurrency-Unification and Extension. LNCS 458, Amsterdam:Springer-Verlag, 1990.401-415.
[31]A. Martens. Simulation and Equivalence between BPEL Process Models. In Proceedings of the Design, Analysis, and Simulation of Distributed Systems Symposium, 2005.
[32]Xiang Fu. Formal specification and verification of asynchronously communicating web services [D]. Santa Barbara: University of California. 2004.
[33]Hoare C. A. R.. Communicating sequential processes. Communications of the ACM, 1978,21(8):666-677.
[34]廖军,谭浩,刘锦德.基于Pi-演算的Web服务组合的描述和验证[J].北京：计算机学报,2005,28(04)：635-643.
[35]Milner R.. Communicating and Mobile Systems:The Pi-Calculus. London:Cambridge University Press, 1999.
[36]Milner R., Parrow J., Walker D.. A calculus of mobile processes, part I/II. Journal of Information and Computation, 1992,100(1):1-77.
[37]Lin Hui-Min. Complete proof systems for observation congruences in finite control pi-calculus. In:Proceedings of the 25th International Colloquium on Automata, Languages and Pro-gramming, Aalborg, Denmark, 1998, 443-454.
[38]Jiao Wen-Pin, Zhou Ming-Hui, Wang Qian-Xiang.. Formal framework for adaptive multi-agent Systems. In:Proceedings of IEEE/WIC International Conference on Intelligent Agent Technology, Halifax, Canada, 2003.442-445.
[39]Markus Lumpe. A Pi-calculus based approach to software composition [Ph.D. dissertation]. Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland, 1999
[40]雷丽晖,段振华.一种基于扩展有限自动机验证组合Web服务的方法[J].软件学报,2007,18(12)：2980-2990.
[41]Solanki M., Cau A., Zedan H.. Augmenting semantic web service description with compositional specification. Proceedings of the 13th Int'l Conf. on World Wide Web. New York:ACM Press,2004.544-552.
[42]Tadao Murata. Petri nets:properties. Analysis and Applications Proc. Of the IEEE, 1989, 77(4).
[43]Peterson J. L.. Petri net theory and the modeling of systems. Upper Saddle River, NJ, USA:Prentice Hall,1981.
[44]Lin Chuang, Li Ya-Juan, Wang Zhang-Min. Status and development of formal methods for performance evaluation. Acta Electronica Sinica, 2002,30(12A):1918-1922.
[45]Hamadi R., Benatallah B.. A petri net-based model for web service composition. In Proceedings of the Fourteenth Australasian Database Conference on Database Technologies, Adelaide, South Australia, 2003. Australian Computer Society, 2003: 191-200.
[46]Hillston J. A compositional approach to performance modeling [Ph. D. Thesis]. University of Edinburgh, 1994, CST-107-94.
[47]E. Best. Structure theory of Petri nets:the free choice hiatus. In W. Brauer, W. Reisig, and G. Rozenberg, editors. Advances in Petri nets 1986 Part I:Petri nets, central models and their properties. volume 254 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1987:168-206.
[48]Goldsmith J., Lang J., Truszczy nski M., Wilson N.. The computational complexity of dominance and consistency in CP-nets. Journal of Artificial Intelligence Research, 2008, 33(1):403-432.
[49]潘理,赵卫东,王志成,等.Petri网的步问题研究[J].软件学报,2009,20(3)：505-514.
[50]李凤英,古天龙,徐周波. Petri网的符号ZBDD可达树分析技术[J].计算机学报,2009,32(12)：2420-2428.
[51]刘惊雷,廖士中,张伟.CP-nets的完备性及一致性研究[J].软件学报,2012,23(6)：1531-1541.
[52]吴哲辉.Petri网导论[M].北京：机械工业出版社,2006.
[53]袁崇义.Petri网应用[M].北京：科学出版社,2013.
[54]蒋昌俊.Petri网的行为理论及其应用[M].北京：高等教育出版社,2003.
[55]C. Canal, E. Pimentel, J. M. Troya, ComPatibility and inheritance in software architectures. Science of Computer Programming, 2001(41):105-138.
[56]Dan Craigen. Formal Methods for Trustworthy Computer Systems. Springer-Verlag, 1990.
[57]顾军,罗军舟,曹玖新,李伟.基于排队Petri网的服务系统性能建模与分析方法[J].计算机学报,2011,34(12)：2435-2455.
[58]徐萌.基于服务关系的服务组合相关技术研究[D].北京：北京邮电大学,2007.
[59]Urgaonkar B., Pacifici G., Shenoy P., Spreitzer M., Tantawi A.. An analytical model for multi-tier internet services and its application. In: Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2005). New York: ACM Press,2005:291-302.
[60]L. Bordeaux, G. Salaun. Using Process Algebra for Web Services:Early Results and Perspectives. Lecture Notes in Computer Science (TES), 2005.3324:54-68.
[61]肖芳雄,黄志球,曹子宁,等.Web服务组合功能与QoS的形式化统一建模和分析[J].软件学报,2011,22(11)：2698-2715.
[62]H. Overdick, F. Puhlmann, M. Weske. Towards A Formal Model for Agile Service Discovery and Integration. ICSOC Workshop on Dynamic Web Processes.2005.
[63]Fu X, Bultan T, Su JW. Analysis of interactiong BPEL Web services. In:Proc. Of the 13th Int'l Conf. on World Wide Web. New York:ACM Press,2004:621-630.
[64]Fu X, Bultan T, Su JW. A tool for formal analysis of Web services. In:Alur R, Peled D. eds. Proc. of the 16th Int'l Conf. on Computer Aided Verification.2005:510-514.
[65]Fu X, Bultan T, Su JW. Synchronizability of conversations among Web services. IEEE Trans. on Software Engineering, 2005,31(12):1042-1055.
[66]S. Narayanan, S. Mcllraith. Analysis and Simulation of Web Services. Computer Networks,2003.42(5):675-693.
[67]A. Martens. Simulation and Equivalence between BPEL Process Models. In:Proceedings of the Design, Analysis, and Simulation of Distributed Systems Symposium,2005.
[68]Feng Xiao-Ning, Liu Qun, Wang Zhou. A web service composition modeling and evaluation method used petri net//Shen H. T., Li J., Li M., Ni J., Wang W., eds. Advanced Web and Network Technologies, and Applications, LNCS 3842. Berlin, Heidelberg:Springer-Verlag, 2006:905-911.
[69]Yang S. J. H., Hsieh J. S. F., Lan B. C. W., Chung J. Y. Composition and evaluation of trustworthy web services. International Journal of Web and Grid Services, 2006,2(1): 5-24.
[70]顾军,罗军舟,曹玖新,李伟.基于排队Petri网的服务系统性能建模与分析方法[J].计算机学报,2011,34(12)：2435-2455.
[71]Tan Zhang-Xi, Lin Chuang, Yin Hao, Hong Ye, Zhu Guang-Xi. Approximate performance analysis of web services flow using stochastic petri net//Jin H., Pan Y., Xiao N., Sun J., eds. GCC 2004, LNCS 3251. Berlin, Heidelberg:Springer-Verlag, 2004: 193-200.
[72]林闯.随机Petri网和系统性能评价(第2版)[M].北京：清华大学出版社,2005.
[73]A. Ferscha. Qualitative and quantitative analysis of business workflows using generalized stochastic Petri net[J].//Proc. of Workflow Management-Challenges, Paradigms Products, G.Chroust and A.Benczur, Eds., Linz. Austria, Oct. 19-21.1994: 222-234.
[75]詹惠琴.测试系统的Petri网建模和性能分析研究[D].博士论文,电子科技大学,2005.
[75]Zuberek W. M. Performance evaluation using unbound timed Petri nets. In: Proc. of the Third International Workshop on Petri Nets and Performance Models, Kyoto, Japan, 1989:180-86.
[76]F. Bause, P. Kritzinger. Stochastic Petri Nets. Vieweg, Braum-scweig, 1996.
[77]李扬.求解线性方程组及不等式组的ABS方法[D].辽宁：辽宁师范大学,2007.
[78]J. B. Dugan, K. S. Trivedi, R. M. Geist, V. F. Nicola.. Extended stochastic Petri nets: Applications and analysis. In:Proceeding of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation, Paris, France, 1984: 507-519.
[79]胡国正,吴建,邓正宏.程序设计方法学[M].长沙：国防工业出版社,2003.
[80]Thomas H. C., Charles E. L., Ronald L. R.. Introduction to Algorithms (Second Edition). the MIT press, September 1,2001.
[81]Mark A. W.. Data Structures and Algorithm Analysis in C (Second Edition). Addison Wesley, September, 19,1996.
[82]邹恒明.算法之道[M].北京：机械工业出版社,2010.
[83][美]艾伯特-拉斯洛·巴拉巴西著,徐彬译.链接——网络新科学[M].长沙：湖南科学技术出版社,2007.
[84]Cai C., Yang H. L., Zhao X. P., Qiu Z. Y.. A Formal Model for Channel Passing in Web Service Composition. Services Computing, 2008. SCC'08. IEEE International Conference,2008(2):495-496.
[85]Rao J. H., Su X. M.. A Survey of Automated Web Service Composition Methods. In Proceedings of First International Workshop on Semantic Web Services and Web Process Composition, SWSWPC 2004, San Diego, CA, USA, July 6, 2004.
[86]Julian E., Stefan S., Michael N., Nicolas R., Ralf S.. Worst-Case Workflow Performance Optimization. In Proceedings of the Third International Conference on Internet and Web Applications and Services (ICIW'08), 2008.
[87]Cao J., Andersson M., Nyberg C. Web Server Performance Modeling Using an M/G/1/K*PS Queue. ICT 2003,10th International Conference on Telecommunications, 2003:1501-1506.
[88]Suzumura T., Takase T., Tatsubori M.. Optimizing Web Services Performance by Differential Deserialization. ICWS 2005. In Proceedings of 2005 IEEE International Conference on Web Service, 11-15 July 2005, vol.1:185-192.
[89]Munindar S., Michael N. H.. Service-Oriented Computing:Semantics, Processes, Agents. John Wiley and sons, Ltd.,2005.
[90]J. Koehler, B. Srivastava. Web service composition:Current solutions and open problems. In Proceedings of ICAPS'03 Workshop on Planning for Web Services, 2003:28-35.
[91]Raman Kazhamiakin, Marco Pistore, Luca Santuari. Analysis of Communication Models in Web Service Compositions. In Proceedings of the 15th international conference on World Wide Web, 2006.
[92]Zeng L. Z., Benatallab B., et al.. Qos-aware middleware for Web services composition. IEEE Transn on Software Engineering, 2004,30(5):311-326.
[93]Baresi L., Guinea S., Plebani P.. WS-Policy for Service Monitoring. Technologies for E-Services,2006, LNCS 3811:72-83.
[94]Papazoglou M. P., Traverso P., Dustdar S., et al. Service-Oriented Computing Research Roadmap. Technical report/vision paper on Service oriented computing European Union Information Society Technologies (IST),2006-03.
[95]C. Pelta. Web Services Orchestration and Choreography. Computer, 2003,36(10):46-52.
[96]Ewa Ochmanska. Web Services Composition Framework with Petri Net Based Schemas. New Challenges in Computational Collective Intelligence, 2009,244(9):3-14.
[97]T. Yoo, B. Jeonga, H. Choa. A Petri Nets based functional validation for services composition. Expert Systems with Applications, 2010,37(5):3768-3776.
[98]Elabd E., Coquery E., Hacid M. S.. Compatibility and Replaceability Analysis of Timed Web Service Protocols. Second International Conference on Computer and Electrical Engineering, Dubai, 2009:15-19.
[99]Draluk V., Discovering Web services:An overview. In: Apers P., ed. Proc. Of the 27th Int'l Conf. on Very Large Data Bases. Roma: Morgan Kaufmann Publishers, 2001: 637-640.
[100]Maedche A., Staab S.. Ontology learning for the semantic Web. IEEE Intelligent Systems, 2001,16(2):72-79.
[101]Xudong He, William C. Chu, Hongji Yang. A new approach to verify rule-based systems using Petri nets. Information ans Software Technology, 2003,45:663-669.
[102]Murata T.. Petri Nets:Properties, analysis and applications. Proc. Of the IEEE, 1989, 77(4):541-580.
[103]Dai Yuanshun, Gregory Levitin. Reliability and performance of tree-structured grid services. IEEE Transactions on Reliability, 2006,55(2):337-349.
[104]Bause F.. Queueing Petri nets—A formalism for the combined qualitative and quantitative analysis of systems. In Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France,1993:14-23.
[105]Bolch G., Greiner S., de Meer H., Trivedi K. S.. Queueing Networks and Markov Chains. New York, John Wiley & Sons, 1998.
[106]Kounev Samuel, Buchmann Alejandro. Performance modeling of distributed e-business applications using queueing Petri nets. In Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software, Austin, Texas, 2003: 143-155.
[107]Nanda M. G., Chandra S., Sarkar V.. Decentralizing execution of composite web services. In Proceedings of the OOPSLA'04, Vancouver, British Columbia, Canada, 2004:170-187.
[108]Sato N., Trivedi K. S.. Stochastic modeling of composite Web services for closed-form analysis of their performance and reliability bottlenecks. In Proceedings of the 5th International Conference on Service Oriented Computing (ICSOC 2007), LNCS 4749. 2007:107-118.
[109]Xiong K., Perros H.. Service performance and analysis in cloud computing. In Proceedings of the 2009 Congress on Services. Los Angelea, CA,2009:693-700.
[110]汪浩,黄明和,龙浩.基于G/G/1-FCFS、M/G/1/PS和M/G/∞排队网络的Web服务组合性能分析.计算机学报,2013(1)：22-38.
[111]徐从富,郝春亮,苏保君,楼俊杰.马尔科夫逻辑网络研究.软件学报,2011,22(8)：1699-1713.
[112]范小芹,蒋昌俊,王俊丽,庞善臣.随机QoS感知的可靠Web服务组合.软件学报,2009,20(3)：546-556.
[113]王伟,张文博,魏峻,钟华,黄涛.一种资源敏感的Web应用性能诊断方法.软件学报,2010,21(2)：194-208.
[114]林闯,李雅娟,刘雪宁.非马尔科夫随机Petri网的分析方法及应用.系统仿真学报,2003,15 Suppl：71-75.
[115]张乐君,国林,张冰,杨武,王巍,杨永田.基于SPN的信息系统生存性分析建模研究.计算机研究与发展,2009,46(6)：1019-1027.
[116]金鑫,刘勇,林闯,王元卓.基于随机Petri网模型的企业网安全分析.系统仿真学报,2009,20 Suppl：176-180.
[117]李涛,钟诗胜.基于着色时间Petri网的工作流模型及其性能分析.计算机辅助设计与图形学学报,2006,18(6)：824-831.
[118]于枫,罗军舟,李伟,王鹏.一种基于进程验证的Petri网可达性判定方法.计算机学报,2010,33(2)：288-299.
[119]范小芹,蒋昌俊,方贤文,丁志军.基于离散微粒群算法的动态Web服务选择.计算机研究与发展,2010,47(1)：147-156.
[120]刘永利,白晓颖,陈光,王立军.基于策略的Web服务实时性能评价与验证.2010,38(2A)：182-187.
[121]喻坚,韩燕波.面向服务的计算——原理和应用.北京：清华大学出版社,2006.
[122]岳昆.王晓玲,周傲英.Web服务核心支撑技术：研究综述.软件学报,2004.15(3)： 428-442.
[123]丁志军,蒋昌俊.基于P/T网结构的规则系统验证方法.系统仿真学报,2005,17Suppl：151-154.
[124]吴哲辉,蒋昌俊.有界Petri网的可达图到网图的转换算法.软件学报,1992,1：23-29.
[125]郭玉彬,杜玉越,奚建清.Web服务组合的有色网模型及运算性质.计算机学报,2006,29(7)：1067-1075.
[126]苗东升.系统科学大学讲稿.北京：中国人民大学出版社,2007.
[127][美]Duncan J. Watts著,陈禹等译.小小世界.北京：中国人民大学出版社,2006.
[128]徐俊明.组合网络理论.北京：科学出版社,2007.
[129]刘兴堂,梁炳成,刘力,何广军等.复杂系统建模理论、方法与技术.北京：科学出版社,2008.
[130][英]Mike Thelwall著,孙建军,李江,张煦等译.链接分析：信息科学的研究方法.南京：东南大学出版社,2009.
[131]古天龙.软件开发的形式化方法.北京：高等教育出版社,2009.
[132]王世强.模型论基础.北京：科学出版社,2007.
[2]D. Schahram, S. Wolfgang. A survey on web services composition[J]. International Journal of Web and Grid Services,2005,1(1):1-30.
[3]F. Andrea. Web services:a process algebra approach. In:proceedings of the 2nd international conference on Service oriented computing (ICSOC04), New York, USA, 2004.
[4]丘昆,王晓玲,周傲英.Web服务核心支撑技术：研究综述[J].软件学报,2004,15(3)：428-442.
[5]M. Dean, D. Connolly, F. van Harmelen, J. Hendler, I. Horrocks, D. L. McGuinness, P. F. Patel-Schneider and L. AStein. Web Ontology Language (OWL) Reference Version 1.0. W3C Working Draft 12 November 2002.
[6]Chinnici R., Moreau J. J., Ryman A., et al. Web service description language (WSDL) v2.0. W3C, August 2005.
[7]Gudgin M., Hadley M., Mendelsohn N., et al. Simple object access protocol (SOAP) vl.2. W3C Recommendation, June 2003.
[8]Clement L., Hately A., von Riegen C., et al. UDDI specification version 3.0.2, OASIS, October 2004.
[9]Andrews T., Curtera F., Kuno H., Dholakia Y., Goland J., et al. Business Process Execution Language for Web Services Version 1.1. BEA Systems, IBM Corporation, Microsoft Corporation, SAP AG, Siebel Systems, May 2003.
[10]蒋运承,史忠植.OWL-S的形式语义[J].计算机科学,2005,32(7)：5-7.
[11]李发英,朱海滨.基于OWL本体和描述逻辑的Web服务匹配模型研究[J].科学技术与工程,2006,6(20)：3306-3309.
[12]郑红军,张乃孝.软件开发中的形式化方法[J].计算机科学,1997,24(6)：90-96.
[13]李舟军.传值CCS和π-演算中互模拟等价的验证理论与算法[D].长沙：国防科技大学,1999.
[14]Ulrich Herzog. Formal Methods for Performance Evaluation[C].7th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2007, Bertinoro, Italy, May 8-June 2,2007.
[15]林闯,李雅娟,王忠民.性能评价形式化方法的现状与发展[J].电子学报,2002,30(12A)：1917-1922.
[16]H. Kobayashi. Modeling and Analysis—An Introduction to System Performance Evaluation Methodology[M]. London:Addison-Wesley, 1978.
[17]P. Tran-Gia. Analytische Leistungsbewertung verteilter Systeme. German:Springer, 1996.
[18]D. Gross, C. M. Harris. Fundamentals of Queuing Theory (Second Edition) [M]. New York:John Wiley & Sons, 1985.
[19]Kishor S. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications[M]. Prentice-Hall,1982.
[20]W.J. Stewart. Numerical Analysis Methods. In G. Haring. Ch. Lindemann, and M. Reiser, editors, Performance Evaluation:Origins and Directions, LNCS 1769, pages 355-376. Springer, Berlin, Heidelberg, 2000.
[21]W. J. Stewart. Introduction to the numerical solution of Markov chains. Princeton University Press, 1994.
[22]G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queuing Networks and Markov Chains[M]. New York:John Wiley & Sons, 1998.
[23]陆传赉.排队论(第2版)[M].北京：北京邮电大学出版社,2009.
[24]徐萌.基于服务关系的服务组合相关技术研究[D].北京：北京邮电大学,2007.
[25]C. H. Xia, Z. Liu, D. Towsley, M. Lelarge. Scalability of Fork/Join Queuing Networks with Blocking. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS),2007, pp:133-144.
[26]G. Casale, N. F. Mi, Evgenia Smirni. Bound analysis of closed queueing networks with workload burstiness. In Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2008.
[27]Ferrari G., Ezhilchelvan P., Mitrani I.. Performance modeling and evaluation of e-business systems. In: Proceedings of the 39th Annual Simulation Symposium, Huntsville, Alabama, 2006. Washington, DC, USA: IEEE Computer Society, 2006: 135-142.
[28]林闯,魏丫丫.随机进程代数与随机Petri网[J].软件学报,2002,13(2)：203-213.
[29]Schneider S.. An operational semantics for timed CSP. Information & Computation, 1995, 116(2):193-213
[30]Moller F., Tofts C.. A temporal calculus of communicating systems. In:Baeten J.C.M., Klop J-W., eds. Proceedings of Concur'90:Theories of Concurrency-Unification and Extension. LNCS 458, Amsterdam:Springer-Verlag, 1990.401-415.
[31]A. Martens. Simulation and Equivalence between BPEL Process Models. In Proceedings of the Design, Analysis, and Simulation of Distributed Systems Symposium, 2005.
[32]Xiang Fu. Formal specification and verification of asynchronously communicating web services [D]. Santa Barbara: University of California. 2004.
[33]Hoare C. A. R.. Communicating sequential processes. Communications of the ACM, 1978,21(8):666-677.
[34]廖军,谭浩,刘锦德.基于Pi-演算的Web服务组合的描述和验证[J].北京：计算机学报,2005,28(04)：635-643.
[35]Milner R.. Communicating and Mobile Systems:The Pi-Calculus. London:Cambridge University Press, 1999.
[36]Milner R., Parrow J., Walker D.. A calculus of mobile processes, part I/II. Journal of Information and Computation, 1992,100(1):1-77.
[37]Lin Hui-Min. Complete proof systems for observation congruences in finite control pi-calculus. In:Proceedings of the 25th International Colloquium on Automata, Languages and Pro-gramming, Aalborg, Denmark, 1998, 443-454.
[38]Jiao Wen-Pin, Zhou Ming-Hui, Wang Qian-Xiang.. Formal framework for adaptive multi-agent Systems. In:Proceedings of IEEE/WIC International Conference on Intelligent Agent Technology, Halifax, Canada, 2003.442-445.
[39]Markus Lumpe. A Pi-calculus based approach to software composition [Ph.D. dissertation]. Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland, 1999
[40]雷丽晖,段振华.一种基于扩展有限自动机验证组合Web服务的方法[J].软件学报,2007,18(12)：2980-2990.
[41]Solanki M., Cau A., Zedan H.. Augmenting semantic web service description with compositional specification. Proceedings of the 13th Int'l Conf. on World Wide Web. New York:ACM Press,2004.544-552.
[42]Tadao Murata. Petri nets:properties. Analysis and Applications Proc. Of the IEEE, 1989, 77(4).
[43]Peterson J. L.. Petri net theory and the modeling of systems. Upper Saddle River, NJ, USA:Prentice Hall,1981.
[44]Lin Chuang, Li Ya-Juan, Wang Zhang-Min. Status and development of formal methods for performance evaluation. Acta Electronica Sinica, 2002,30(12A):1918-1922.
[45]Hamadi R., Benatallah B.. A petri net-based model for web service composition. In Proceedings of the Fourteenth Australasian Database Conference on Database Technologies, Adelaide, South Australia, 2003. Australian Computer Society, 2003: 191-200.
[46]Hillston J. A compositional approach to performance modeling [Ph. D. Thesis]. University of Edinburgh, 1994, CST-107-94.
[47]E. Best. Structure theory of Petri nets:the free choice hiatus. In W. Brauer, W. Reisig, and G. Rozenberg, editors. Advances in Petri nets 1986 Part I:Petri nets, central models and their properties. volume 254 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1987:168-206.
[48]Goldsmith J., Lang J., Truszczy nski M., Wilson N.. The computational complexity of dominance and consistency in CP-nets. Journal of Artificial Intelligence Research, 2008, 33(1):403-432.
[49]潘理,赵卫东,王志成,等.Petri网的步问题研究[J].软件学报,2009,20(3)：505-514.
[50]李凤英,古天龙,徐周波. Petri网的符号ZBDD可达树分析技术[J].计算机学报,2009,32(12)：2420-2428.
[51]刘惊雷,廖士中,张伟.CP-nets的完备性及一致性研究[J].软件学报,2012,23(6)：1531-1541.
[52]吴哲辉.Petri网导论[M].北京：机械工业出版社,2006.
[53]袁崇义.Petri网应用[M].北京：科学出版社,2013.
[54]蒋昌俊.Petri网的行为理论及其应用[M].北京：高等教育出版社,2003.
[55]C. Canal, E. Pimentel, J. M. Troya, ComPatibility and inheritance in software architectures. Science of Computer Programming, 2001(41):105-138.
[56]Dan Craigen. Formal Methods for Trustworthy Computer Systems. Springer-Verlag, 1990.
[57]顾军,罗军舟,曹玖新,李伟.基于排队Petri网的服务系统性能建模与分析方法[J].计算机学报,2011,34(12)：2435-2455.
[58]徐萌.基于服务关系的服务组合相关技术研究[D].北京：北京邮电大学,2007.
[59]Urgaonkar B., Pacifici G., Shenoy P., Spreitzer M., Tantawi A.. An analytical model for multi-tier internet services and its application. In: Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2005). New York: ACM Press,2005:291-302.
[60]L. Bordeaux, G. Salaun. Using Process Algebra for Web Services:Early Results and Perspectives. Lecture Notes in Computer Science (TES), 2005.3324:54-68.
[61]肖芳雄,黄志球,曹子宁,等.Web服务组合功能与QoS的形式化统一建模和分析[J].软件学报,2011,22(11)：2698-2715.
[62]H. Overdick, F. Puhlmann, M. Weske. Towards A Formal Model for Agile Service Discovery and Integration. ICSOC Workshop on Dynamic Web Processes.2005.
[63]Fu X, Bultan T, Su JW. Analysis of interactiong BPEL Web services. In:Proc. Of the 13th Int'l Conf. on World Wide Web. New York:ACM Press,2004:621-630.
[64]Fu X, Bultan T, Su JW. A tool for formal analysis of Web services. In:Alur R, Peled D. eds. Proc. of the 16th Int'l Conf. on Computer Aided Verification.2005:510-514.
[65]Fu X, Bultan T, Su JW. Synchronizability of conversations among Web services. IEEE Trans. on Software Engineering, 2005,31(12):1042-1055.
[66]S. Narayanan, S. Mcllraith. Analysis and Simulation of Web Services. Computer Networks,2003.42(5):675-693.
[67]A. Martens. Simulation and Equivalence between BPEL Process Models. In:Proceedings of the Design, Analysis, and Simulation of Distributed Systems Symposium,2005.
[68]Feng Xiao-Ning, Liu Qun, Wang Zhou. A web service composition modeling and evaluation method used petri net//Shen H. T., Li J., Li M., Ni J., Wang W., eds. Advanced Web and Network Technologies, and Applications, LNCS 3842. Berlin, Heidelberg:Springer-Verlag, 2006:905-911.
[69]Yang S. J. H., Hsieh J. S. F., Lan B. C. W., Chung J. Y. Composition and evaluation of trustworthy web services. International Journal of Web and Grid Services, 2006,2(1): 5-24.
[70]顾军,罗军舟,曹玖新,李伟.基于排队Petri网的服务系统性能建模与分析方法[J].计算机学报,2011,34(12)：2435-2455.
[71]Tan Zhang-Xi, Lin Chuang, Yin Hao, Hong Ye, Zhu Guang-Xi. Approximate performance analysis of web services flow using stochastic petri net//Jin H., Pan Y., Xiao N., Sun J., eds. GCC 2004, LNCS 3251. Berlin, Heidelberg:Springer-Verlag, 2004: 193-200.
[72]林闯.随机Petri网和系统性能评价(第2版)[M].北京：清华大学出版社,2005.
[73]A. Ferscha. Qualitative and quantitative analysis of business workflows using generalized stochastic Petri net[J].//Proc. of Workflow Management-Challenges, Paradigms Products, G.Chroust and A.Benczur, Eds., Linz. Austria, Oct. 19-21.1994: 222-234.
[75]詹惠琴.测试系统的Petri网建模和性能分析研究[D].博士论文,电子科技大学,2005.
[75]Zuberek W. M. Performance evaluation using unbound timed Petri nets. In: Proc. of the Third International Workshop on Petri Nets and Performance Models, Kyoto, Japan, 1989:180-86.
[76]F. Bause, P. Kritzinger. Stochastic Petri Nets. Vieweg, Braum-scweig, 1996.
[77]李扬.求解线性方程组及不等式组的ABS方法[D].辽宁：辽宁师范大学,2007.
[78]J. B. Dugan, K. S. Trivedi, R. M. Geist, V. F. Nicola.. Extended stochastic Petri nets: Applications and analysis. In:Proceeding of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation, Paris, France, 1984: 507-519.
[79]胡国正,吴建,邓正宏.程序设计方法学[M].长沙：国防工业出版社,2003.
[80]Thomas H. C., Charles E. L., Ronald L. R.. Introduction to Algorithms (Second Edition). the MIT press, September 1,2001.
[81]Mark A. W.. Data Structures and Algorithm Analysis in C (Second Edition). Addison Wesley, September, 19,1996.
[82]邹恒明.算法之道[M].北京：机械工业出版社,2010.
[83][美]艾伯特-拉斯洛·巴拉巴西著,徐彬译.链接——网络新科学[M].长沙：湖南科学技术出版社,2007.
[84]Cai C., Yang H. L., Zhao X. P., Qiu Z. Y.. A Formal Model for Channel Passing in Web Service Composition. Services Computing, 2008. SCC'08. IEEE International Conference,2008(2):495-496.
[85]Rao J. H., Su X. M.. A Survey of Automated Web Service Composition Methods. In Proceedings of First International Workshop on Semantic Web Services and Web Process Composition, SWSWPC 2004, San Diego, CA, USA, July 6, 2004.
[86]Julian E., Stefan S., Michael N., Nicolas R., Ralf S.. Worst-Case Workflow Performance Optimization. In Proceedings of the Third International Conference on Internet and Web Applications and Services (ICIW'08), 2008.
[87]Cao J., Andersson M., Nyberg C. Web Server Performance Modeling Using an M/G/1/K*PS Queue. ICT 2003,10th International Conference on Telecommunications, 2003:1501-1506.
[88]Suzumura T., Takase T., Tatsubori M.. Optimizing Web Services Performance by Differential Deserialization. ICWS 2005. In Proceedings of 2005 IEEE International Conference on Web Service, 11-15 July 2005, vol.1:185-192.
[89]Munindar S., Michael N. H.. Service-Oriented Computing:Semantics, Processes, Agents. John Wiley and sons, Ltd.,2005.
[90]J. Koehler, B. Srivastava. Web service composition:Current solutions and open problems. In Proceedings of ICAPS'03 Workshop on Planning for Web Services, 2003:28-35.
[91]Raman Kazhamiakin, Marco Pistore, Luca Santuari. Analysis of Communication Models in Web Service Compositions. In Proceedings of the 15th international conference on World Wide Web, 2006.
[92]Zeng L. Z., Benatallab B., et al.. Qos-aware middleware for Web services composition. IEEE Transn on Software Engineering, 2004,30(5):311-326.
[93]Baresi L., Guinea S., Plebani P.. WS-Policy for Service Monitoring. Technologies for E-Services,2006, LNCS 3811:72-83.
[94]Papazoglou M. P., Traverso P., Dustdar S., et al. Service-Oriented Computing Research Roadmap. Technical report/vision paper on Service oriented computing European Union Information Society Technologies (IST),2006-03.
[95]C. Pelta. Web Services Orchestration and Choreography. Computer, 2003,36(10):46-52.
[96]Ewa Ochmanska. Web Services Composition Framework with Petri Net Based Schemas. New Challenges in Computational Collective Intelligence, 2009,244(9):3-14.
[97]T. Yoo, B. Jeonga, H. Choa. A Petri Nets based functional validation for services composition. Expert Systems with Applications, 2010,37(5):3768-3776.
[98]Elabd E., Coquery E., Hacid M. S.. Compatibility and Replaceability Analysis of Timed Web Service Protocols. Second International Conference on Computer and Electrical Engineering, Dubai, 2009:15-19.
[99]Draluk V., Discovering Web services:An overview. In: Apers P., ed. Proc. Of the 27th Int'l Conf. on Very Large Data Bases. Roma: Morgan Kaufmann Publishers, 2001: 637-640.
[100]Maedche A., Staab S.. Ontology learning for the semantic Web. IEEE Intelligent Systems, 2001,16(2):72-79.
[101]Xudong He, William C. Chu, Hongji Yang. A new approach to verify rule-based systems using Petri nets. Information ans Software Technology, 2003,45:663-669.
[102]Murata T.. Petri Nets:Properties, analysis and applications. Proc. Of the IEEE, 1989, 77(4):541-580.
[103]Dai Yuanshun, Gregory Levitin. Reliability and performance of tree-structured grid services. IEEE Transactions on Reliability, 2006,55(2):337-349.
[104]Bause F.. Queueing Petri nets—A formalism for the combined qualitative and quantitative analysis of systems. In Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France,1993:14-23.
[105]Bolch G., Greiner S., de Meer H., Trivedi K. S.. Queueing Networks and Markov Chains. New York, John Wiley & Sons, 1998.
[106]Kounev Samuel, Buchmann Alejandro. Performance modeling of distributed e-business applications using queueing Petri nets. In Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software, Austin, Texas, 2003: 143-155.
[107]Nanda M. G., Chandra S., Sarkar V.. Decentralizing execution of composite web services. In Proceedings of the OOPSLA'04, Vancouver, British Columbia, Canada, 2004:170-187.
[108]Sato N., Trivedi K. S.. Stochastic modeling of composite Web services for closed-form analysis of their performance and reliability bottlenecks. In Proceedings of the 5th International Conference on Service Oriented Computing (ICSOC 2007), LNCS 4749. 2007:107-118.
[109]Xiong K., Perros H.. Service performance and analysis in cloud computing. In Proceedings of the 2009 Congress on Services. Los Angelea, CA,2009:693-700.
[110]汪浩,黄明和,龙浩.基于G/G/1-FCFS、M/G/1/PS和M/G/∞排队网络的Web服务组合性能分析.计算机学报,2013(1)：22-38.
[111]徐从富,郝春亮,苏保君,楼俊杰.马尔科夫逻辑网络研究.软件学报,2011,22(8)：1699-1713.
[112]范小芹,蒋昌俊,王俊丽,庞善臣.随机QoS感知的可靠Web服务组合.软件学报,2009,20(3)：546-556.
[113]王伟,张文博,魏峻,钟华,黄涛.一种资源敏感的Web应用性能诊断方法.软件学报,2010,21(2)：194-208.
[114]林闯,李雅娟,刘雪宁.非马尔科夫随机Petri网的分析方法及应用.系统仿真学报,2003,15 Suppl：71-75.
[115]张乐君,国林,张冰,杨武,王巍,杨永田.基于SPN的信息系统生存性分析建模研究.计算机研究与发展,2009,46(6)：1019-1027.
[116]金鑫,刘勇,林闯,王元卓.基于随机Petri网模型的企业网安全分析.系统仿真学报,2009,20 Suppl：176-180.
[117]李涛,钟诗胜.基于着色时间Petri网的工作流模型及其性能分析.计算机辅助设计与图形学学报,2006,18(6)：824-831.
[118]于枫,罗军舟,李伟,王鹏.一种基于进程验证的Petri网可达性判定方法.计算机学报,2010,33(2)：288-299.
[119]范小芹,蒋昌俊,方贤文,丁志军.基于离散微粒群算法的动态Web服务选择.计算机研究与发展,2010,47(1)：147-156.
[120]刘永利,白晓颖,陈光,王立军.基于策略的Web服务实时性能评价与验证.2010,38(2A)：182-187.
[121]喻坚,韩燕波.面向服务的计算——原理和应用.北京：清华大学出版社,2006.
[122]岳昆.王晓玲,周傲英.Web服务核心支撑技术：研究综述.软件学报,2004.15(3)： 428-442.
[123]丁志军,蒋昌俊.基于P/T网结构的规则系统验证方法.系统仿真学报,2005,17Suppl：151-154.
[124]吴哲辉,蒋昌俊.有界Petri网的可达图到网图的转换算法.软件学报,1992,1：23-29.
[125]郭玉彬,杜玉越,奚建清.Web服务组合的有色网模型及运算性质.计算机学报,2006,29(7)：1067-1075.
[126]苗东升.系统科学大学讲稿.北京：中国人民大学出版社,2007.
[127][美]Duncan J. Watts著,陈禹等译.小小世界.北京：中国人民大学出版社,2006.
[128]徐俊明.组合网络理论.北京：科学出版社,2007.
[129]刘兴堂,梁炳成,刘力,何广军等.复杂系统建模理论、方法与技术.北京：科学出版社,2008.
[130][英]Mike Thelwall著,孙建军,李江,张煦等译.链接分析：信息科学的研究方法.南京：东南大学出版社,2009.
[131]古天龙.软件开发的形式化方法.北京：高等教育出版社,2009.
[132]王世强.模型论基础.北京：科学出版社,2007.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |