广义良构工作流业务过程实例时间性能分析
|
摘要
企业在激烈的市场竞争和频繁变化的服务需求下,必须经常性地调整自身的内部架构和业务过程以应对挑战。工作流技术,由于其高效、自动的任务调度模式及对业务过程重组的适应能力,正受到广泛关注。工作流管理系统实施过程中,运行中的业务过程实例的完成时间是企业和用户都十分关心的问题,它直接影响到企业的各项相关工作的安排以及客户服务质量。
本文研究业务过程实例完成时间预测中的几个关键问题。
在分析现有工作流良构性约束的不足的基础上,提出了广义良构工作流模型,扩展了工作流模型的描述能力,给出了建立符合广义良构性约束的工作流网的方法。为了便于实现广义良构工作流时间性能的自动计算,提出了工作流实例子图路由概率的计算方法、实例子图中基本工作流模式的识别规则和广义良构工作流时间性能计算方法。
研究了执行中的变迁和包含它们的工作流模式的时间性能分析问题,详细分析了一个业务过程实例运行中相应工作流网中的变迁的各种状态,对不同状态的变迁提出了不同的处理方法。针对执行中的变迁,提出了活跃变迁概念及其性能等价模型,在此基础上推导出了活跃模式的概念及相应的性能计算公式,验证了一个实例的时间性能动态计算过程。
由于业务实例的时间性能仅与其已访问和将来可能访问的网元素相关,而与被旁路的其它网元素无关,因此,提出了业务实例的可达子网概念及其建立算法,并利用实例子图分解算法将广义良构的可达子网时间性能求解问题转换为更为简单的实例子图的性能求解问题进行处理,从而得到业务实例的时间性能。文中对算法的时间复杂性进行了分析,并给出了数学证明,提出了计算优化方法。
为进一步改善业务实例时间性能分析过程的计算效率,通过对广义良构工作流网的仔细分析,提出了业务实例的归属子图集、实例子图拐点集、工作流网拐点集以及业务实例拐点集的概念,并数学证明了实例子图与其拐点集之间的一一对应关系,推导出了寻找业务实例的归属子图集的简便方法。在此基础上提出的业务实例完成时间分析算法避免了可达子网的建立与分解,从而降低了性能分析时间。
为准确预测业务过程实例在不同的系统负载状态下在各活动处的等待时间,提出了根据系统中各服务台上的排队状态估计业务过程实例在各服务台上的等待时间的仿真计算方法；设计了相应的多级串联排队系统仿真软件,利用蒙特卡罗方法进行了仿真计算并对计算结果进行了分析,在同样的环境设置下,多次仿真得到的排队等待时间较为一致,表明了仿真方法的可用性。
本文通过深入研究预测业务过程实例完成时间中的几个关键问题,构建出了一套合理的业务过程实例的实时时间性能分析框架,从而改善企业的服务质量并帮助其合理安排生产经营活动,并为工作流自动调度程序提供依据。
Nowadays, enterprises face the fierce market competition and frequently-changing demand for services, thus its internal architecture and business processes must be adjusted regularly to meet the challenge. Workflow technology, because of its high efficiency, automatic task scheduling model and ability to adapt to business process reengineering, has been receiving much attention. In implemented workflow management systems, completion time of running instances of business process is a key issue that receives much concern from both enterprises and its clients because it has a direct impact on both relevant work arrangements of enterprises and customer service quality.
This thesis focused on several key problems in predicting completion time of business process instances.
In this paper, by analyzing shortage of existing well-formed workflow models, generalized well-formed workflow model (GWFWM) was put forward to extend the ability of workflow model to describe business process; also, an algorithm to build workflow nets in conformity with GWFWM was proposed. In order to facilitate automatic calculation of time performance for generalized well-formed workflow, method to compute routing probability of instance subgraphs in workflow nets was proposed, and rules to identify basic workflow patterns were given. Lastly, an algorithm to analyze time performance for generalized well-formed workflow was put forward.
To analyze time performance for running workflow instances, first of all, states of transitions were classified, and different methods to compute time performance for transitions in different states were proposed. Specially, for executing transitions, active transition performance equivalent models were proposed to compute their time performance; furthermore, performance models for workflow patterns including active transitions were deduced.
For workflow nets in environments subject to changes, the concept of reachable subnets was proposed, and an performance analysis algorithm based on technology to decompose subnets was given, in which generalized well-formed reachable subnets were transformed into more simple instance subgraphs, thus existing reducing approaches can be used to compute time performance for it. Also, computing complexity of the algorithm was analyzed, and optimizing approach was proposed.
For workflow nets relatively stable in structure and resources, concepts of potential instance subgraphs set, inflexion set of instance subgraph, inflexion set of workflow net, and inflexion set of workflow instance were proposed, and the Corresponding relationship between workflow instance and its inflexion set was demonstrated, thus an more easy approach to find potential instance subgraph set for workflow instance was deduced. By avoid stages to build and decompose reachable subnets, this approach can reduce time spent in performance analysis for workflow instances.
Waiting time of workflow instances at activities was important part of its completion time, which varied dramatically dependent on system load. In this paper, a method to estimate waiting time of workflow instance at every activity according to current load of whole system was proposed. This approach was based on Monte Carlo simulation. Waiting time in tandem queuing systems can be estimate by a simulation program designed for tandem queuing systems with multiple service stations. Repeated simulation under same environment settings achieved consistent results, indicating the availability of the simulation method.
Based on the research on several key aspects of time performance analysis for workflow instances, this paper try to build a sound performance analysis framework to improve quality of service and work arrangement for enterprises.
本文研究业务过程实例完成时间预测中的几个关键问题。
在分析现有工作流良构性约束的不足的基础上,提出了广义良构工作流模型,扩展了工作流模型的描述能力,给出了建立符合广义良构性约束的工作流网的方法。为了便于实现广义良构工作流时间性能的自动计算,提出了工作流实例子图路由概率的计算方法、实例子图中基本工作流模式的识别规则和广义良构工作流时间性能计算方法。
研究了执行中的变迁和包含它们的工作流模式的时间性能分析问题,详细分析了一个业务过程实例运行中相应工作流网中的变迁的各种状态,对不同状态的变迁提出了不同的处理方法。针对执行中的变迁,提出了活跃变迁概念及其性能等价模型,在此基础上推导出了活跃模式的概念及相应的性能计算公式,验证了一个实例的时间性能动态计算过程。
由于业务实例的时间性能仅与其已访问和将来可能访问的网元素相关,而与被旁路的其它网元素无关,因此,提出了业务实例的可达子网概念及其建立算法,并利用实例子图分解算法将广义良构的可达子网时间性能求解问题转换为更为简单的实例子图的性能求解问题进行处理,从而得到业务实例的时间性能。文中对算法的时间复杂性进行了分析,并给出了数学证明,提出了计算优化方法。
为进一步改善业务实例时间性能分析过程的计算效率,通过对广义良构工作流网的仔细分析,提出了业务实例的归属子图集、实例子图拐点集、工作流网拐点集以及业务实例拐点集的概念,并数学证明了实例子图与其拐点集之间的一一对应关系,推导出了寻找业务实例的归属子图集的简便方法。在此基础上提出的业务实例完成时间分析算法避免了可达子网的建立与分解,从而降低了性能分析时间。
为准确预测业务过程实例在不同的系统负载状态下在各活动处的等待时间,提出了根据系统中各服务台上的排队状态估计业务过程实例在各服务台上的等待时间的仿真计算方法；设计了相应的多级串联排队系统仿真软件,利用蒙特卡罗方法进行了仿真计算并对计算结果进行了分析,在同样的环境设置下,多次仿真得到的排队等待时间较为一致,表明了仿真方法的可用性。
本文通过深入研究预测业务过程实例完成时间中的几个关键问题,构建出了一套合理的业务过程实例的实时时间性能分析框架,从而改善企业的服务质量并帮助其合理安排生产经营活动,并为工作流自动调度程序提供依据。
Nowadays, enterprises face the fierce market competition and frequently-changing demand for services, thus its internal architecture and business processes must be adjusted regularly to meet the challenge. Workflow technology, because of its high efficiency, automatic task scheduling model and ability to adapt to business process reengineering, has been receiving much attention. In implemented workflow management systems, completion time of running instances of business process is a key issue that receives much concern from both enterprises and its clients because it has a direct impact on both relevant work arrangements of enterprises and customer service quality.
This thesis focused on several key problems in predicting completion time of business process instances.
In this paper, by analyzing shortage of existing well-formed workflow models, generalized well-formed workflow model (GWFWM) was put forward to extend the ability of workflow model to describe business process; also, an algorithm to build workflow nets in conformity with GWFWM was proposed. In order to facilitate automatic calculation of time performance for generalized well-formed workflow, method to compute routing probability of instance subgraphs in workflow nets was proposed, and rules to identify basic workflow patterns were given. Lastly, an algorithm to analyze time performance for generalized well-formed workflow was put forward.
To analyze time performance for running workflow instances, first of all, states of transitions were classified, and different methods to compute time performance for transitions in different states were proposed. Specially, for executing transitions, active transition performance equivalent models were proposed to compute their time performance; furthermore, performance models for workflow patterns including active transitions were deduced.
For workflow nets in environments subject to changes, the concept of reachable subnets was proposed, and an performance analysis algorithm based on technology to decompose subnets was given, in which generalized well-formed reachable subnets were transformed into more simple instance subgraphs, thus existing reducing approaches can be used to compute time performance for it. Also, computing complexity of the algorithm was analyzed, and optimizing approach was proposed.
For workflow nets relatively stable in structure and resources, concepts of potential instance subgraphs set, inflexion set of instance subgraph, inflexion set of workflow net, and inflexion set of workflow instance were proposed, and the Corresponding relationship between workflow instance and its inflexion set was demonstrated, thus an more easy approach to find potential instance subgraph set for workflow instance was deduced. By avoid stages to build and decompose reachable subnets, this approach can reduce time spent in performance analysis for workflow instances.
Waiting time of workflow instances at activities was important part of its completion time, which varied dramatically dependent on system load. In this paper, a method to estimate waiting time of workflow instance at every activity according to current load of whole system was proposed. This approach was based on Monte Carlo simulation. Waiting time in tandem queuing systems can be estimate by a simulation program designed for tandem queuing systems with multiple service stations. Repeated simulation under same environment settings achieved consistent results, indicating the availability of the simulation method.
Based on the research on several key aspects of time performance analysis for workflow instances, this paper try to build a sound performance analysis framework to improve quality of service and work arrangement for enterprises.
引文
[1]Aaslst W, Hee K. Workflow Management:Models, Methods and Systems[M]. MIT Press,2002.
[2]范玉顺.工作流管理技术基础[M].北京：清华大学出版社,2001.
[3]工作流管理联盟官方网站[OL]. http://www.wfmc.org.
[4]Hollingsworth D. The workflow reference model[S]. Workflow Management Coalition,1995.
[5]Ultimus Inc. Business Process in Internet-Time[R]. Ultimus Technical Report,2001.
[6]Tibco. Tibco Staffware Suite[OL]. http://www.tibco.com.
[7]GEPPERT A, TOMBROS D. Event-based distributed workflow execution with EVE[R]. Technical Report.96.05. University of Zurich, Zurich, Switzerland.
[8]黄双喜,范玉顺.基于工作流的ERP系统开发与实施[J].计算机集成制造系统,2004,10(2)：139-143.
[9]Hiraishi K. performance evaluation of workflows using fluid flow approximation of discrete sets and probability distribution[C]. Industrial Electronics Society,33rd Annual Conference of the IEEE,2007,88-93.
[10]曹健,张申生,胡锦敏.面向并行工程的集成化产品开发过程管理系统研究[J].中国机械工程.2002,13(1)：80-83.
[11]郭蕾,曹华,孙树栋等.基于工作流管理的生产计划系统.机械科学与技术[J],2003,22(1)：157-159.
[12]Panagos E, Rabinovich M. Predictive workflow management[C]. In:Proceeding of the 3rd International Workshop on Next Generation Information Technologies and Systems, Neve Ilan, ISRAEL,1997.
[13]Panagos E, Rabinovich M. Escalations in workflow management systems[C], in: Proceedings of the DART'96, Rockville, MD,1996.
[14]Aalst W, Rosemann M, Dumas M. Deadline-based Escalation in Process-Aware Information Systems[J]. Decision Support Systems,2007,43(2):492-511.
[15]Workflow Management Coalition. Process Definition Interface-XML process definition Language[S]. Document Number WFMC-TC-1025.2005.
[16]Grabert M. Interoperability White Paper[S]. Document Number WfMC-TC-1008, 1995.
[17]Ogris K. Applications Invocation Interface[S]. Document Number WfMC-TC-1014, 1996.
[18]Oracle Inc. Overview of Oracle Workflow for Administrators[OL] http://download.oracle.com/docs/cd/B14117_01/workflow.101/b10283/agov.htm.
[19]lyengar A, Jessani V, Chilanti M. WebSphere Business Integration Primer:Process Server, BPEL, SCA, and SOA[M]. IBM Press,2007.
[20]David Chappell, Chappell & Associates. Understanding BizTalk Server 2006[M]. Microsoft Corporation:San Francisco,2005.
[21]杭州信雅达系统工程股份有限公司.利用SunFlow和Dorado开发流程管理[N],中国计算机报,2006-05-08.
[22]董云卫,楼文晓,郝克刚.业务流程管理与集成系统Synch roFLOW的软件体系结构[J].计算机科学.2004,31(6)：138-140.
[23]李伟平;范玉顺.基于工作流的资源受限项目调度研究[J].清华大学学报(自然科学版),2004,44(10)：1384-1388.
[24]Aalst W. Verification of Workflow Nets[C]. In:Az' ema P, Balbo G, editors. Application and Theory of Petri Nets 1997, volume 1248 of Lecture Notes in Computer Science, Berlin:Springer-Verlag,1997,407-426.
[25]Choi Y andZhao J. Decomposition-based Verification of Cyclic workfows[C]. In: Peled D, Tsay Y, editors. Proceedings of Automated Technology for Verification and Analysis (ATVA 2005), volume 3707 of Lecture Notes in Computer Science, Taipei, Taiwan:Springer-Verlag,2005,84-98.
[26]Lin H, Zhao Z, Li H, et al. A Novel Graph Reduction Algorithm to Identify Structural Conflicts[C]. In:Proceedings of the Thirty-Fourth Annual Hawaii International Conference on System Science (HICSS-35). IEEE Computer Society Press,2002, 536-550.
[27]Aalst W, Hirnschall A, and Verbeek H. An Alternative Way to Analyze Workow Graphs[C]. In:Banks-Pidduck A, Mylopoulos J, Woo C, et al, editors. Proceedings of the 14th International Conference on Advanced Information Systems Engineering (CAiSE'02), volume 2348 of Lecture Notes in Computer Science, Berlin: Springer-Verlag,2002,535-552.
[28]Sadiq W, Orlowska M. Analyzing Process Models using Graph Reduction Techniques[J]. Information Systems,2000,25(2):117-134.
[29]Dongen B, Aalst W, and Verbeek H. Verification of EPCs:Using reduction rules and Petri nets[C]. In O. Pastor and J. Falcao e Cunha, editors, Advanced Information Systems Engineering,17th International Conference, CAiSE 2005, Porto, Portugal, June 13-17,2005, Proceedings, volume 3520 of Lecture Notes in Computer Science, Springer,2005,372-386.
[30]Perumal S, Mahanti A. Cyclic Workflow Verification Algorithm for Workflow Graphs[R]. Working paper,lndian Institute of Management Calcutta, Kolkata, India. 2006.
[31]陈翔,夏国平.基于着色Petri网的工作流建模和合理性分析[J].计算机集成制造系统,2004,10(4)：381-387.
[32]周建涛,史美林,叶新铭.工作流过程建模中的形式化验证技术[J].计算机研究与发展,2005,42(1)：1-9.
[33]周建涛,史美林,叶新铭.CBR：一种支持工作流过程语义验证的组件级化简方法.电子学报[J].2005,33(6)：1060-1065.
[34]唐达,刘丹妮.基于层次时间Petri网的工作流模型可达性分析方法[J].计算机集成制造系统,2006,12(4)：487-492.
[35]赵文,袁崇义,刘刚等.基于P/T系统化简方法的工作流过程模型验证[J].软件学报,2004,15(10)：1423-1430.
[36]钟诗胜,汤新民,李涛.时间约束层次细化工作流建模及验证研究[J].计算机集成制造系统.2006,12(11)：1773-1779.
[37]BARTEK K, ARTHUR H. On structured workflow modeling [C]. In:proceedings of the 12th International Conference on Advanced Information Systems, Engineering. Stockholm,2000,431-445
[38]Jin Hyun Son, Jung Sun Kim, Myoung Ho Kim. Extracting the Workflow Critical Path from the Extended Well-Formed Workflow Schema[J]. Journal of Computer and System Sciences 2005,70(1):86-106.
[39]Li Jianqiang, Fan Yushun, Zhou Mengchu. Performance Modeling and Analysis of Workflow[J]. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, [A],2004,34(2):229-242.
[40]肖志娇,常会友,衣杨.工作流时间性能分析方法[J].计算机集成制造系统,2006,12(8)：1284-1287.
[41]林闯,田立勤,魏丫丫.工作流系统模型的性能等价分析[J].软件学报,2002,13(8)：1472-1480.
[42]姜浩,董逸生,罗军舟.一种基于扩展时间Petri网的工作流时间性能评价方法[J].计算机研究与发展,2005,42(5)：849-855.
[43]陈翔.基于广义随机petri网的工作流性能分析[J].计算机集成制造系统.2003,9(5)：399-403.
[44]Yan Pan,Yong Tang. Ji'an Xu, Kaishun Wu. Time Performance evaluation for workflow based on extended FTWF-NETS[C]. Computer Supported Cooperative Work in Design,2006. Naijing:1-5.
[45]肖志娇,常会友,衣扬.工作流时间性能分析方法[J].计算机集成制造系统.2006,12(8)：1284-1288.
[46]潘炎,汤庸,陈子聪.一种工作流模型的时间性能评估方法[J].计算机集成制造系统,2007,13(8)：1539-1544.
[47]田立勤,林闯.一类可由基本模型嵌套组成的工作流系统的性能分析方法[J].电子学报,2003,31(12A)：2167-2170.
[48]van Hee, Reijers H. Using formal analysis techniques in business process redesign-business process management[C]. In:Aalst W, Desel J, Oberweis A, eds. Business Process Management-Models, Techniques and Empirical Studies. Springer-Verlag,2000,142-160.
[49]Qianchuan Zhao. Performance Bounds for a Class of Workflow Diagrams[C].3645 of Lecture Notes in Computer Science, Springer,2005,625-636.
[50]Hui Ma, Yong Tang, Yan Pan. Upper Bound Estimation of Turnaround Time Based on Fuzzy Temporal Workflow Net[C]. In:Proceedings of the 10th International Conference on Computer Supported Cooperative Work in Design. Naijing,2006,1-5.
[51]Liu Sheng, Fan Yushun. Analysis for instance' staying-time distribution in the workflow[C]. IEEE International Conference on Industrial Technology. Hong Kong, 2005,772-777.
[52]Guang-Song Lu, Yun-Jian Ge. Analysis of Response Time Probability Distribution of Workflows[J]. Journal of Southeast University (English Edition).2006, 22(1):137-142.
[53]刘胜,范玉顺.资源约束下实例在工作流中停留时间分析方法[J].电子学报.2005,33(10)：1867-1871.
[54]Eder J and Pichler H. Duration histograms for workflow systems[C]. In Proc. Conf. EISIC'02, Kanazawa, Japan.2002,25-27.
[55]Li H, Yang Y. Dynamic checking of temporal constraints for concurrent workflows[J]. Electronic Commerce Research and Applications,2005,4(2):124-142.
[56]Panagos Euthimios, Rabinovich Michael. Methods for dynamically predicting workflow completion times and workflow escalation[P]. United States:6601035, 2003.
[57]Lee H, Suh H.Estimating the duration of stochastic workflow for product development process[J].International Journal of Production Economics.2008, 111(1):105-117.
[58]Cardoso J. Workflow Quality of Service Management using Data Mining Techniques[C].3rd International IEEE Conference on Intelligent System.London, 2006,479-482.
[59]Cardoso J, Sheth A,Miller J,et al. Modeling quality of service for workflows and web service processes[J]. Journal of Web Semantics.2004,1 (3):281-308.
[60]Sion R and Tatemura J. Dynamic stochastic models for workflow response optimization[C]. In Proc. IEEE International Conference on Web Services (ICWS'05),2005,657-664,
[61]Chen J, Yang Y. Adaptive selection of necessary and sufficient checkpoints for dynamic verification of temporal constraints in grid workflow systems[J]. ACM Transactions on Autonomous and Adaptive Systems (TAAS).2007,2(2),Article 6.
[62]Chen J, Yang Y.2005. A Minimum Proportional Time Redundancy based Checkpoint Selection Strategy for Dynamic Verification of Fixed-time Constraints in Grid Workflow Systems[C]. In Proceedings of the 12th Asia-Pacific Software Engineering Conference. Taipei, Taiwan.Dec.2005,299-306.
[63]Chen J, Yang Y. Temporal Dependency based Checkpoint Selection for Dynamic Verification of Fixed-time Constraints in Grid Workflow Systems[C]. In:proceedings of 30th International Conference on Software Engineering (ICSE 2008), Leipzig, Germany, May 2008,141-150.
[64]Li H, Groep D, and Wolters L. Efficient response time predictions by exploiting application and resource state similarities[C]. In proceedings of 6th IEEE/ACM International Workshop on Grid Computing (Grid2005), in SC'05, Seattle, Washington, USA,2005,234-241.
[65]Smith W, Foster I, and Taylor V. Predicting Application Run Times Using Historical Information[C]. In:Feitelson D and Rudolph L, eds. Job Scheduling Strategies for Parallel Processing, Springer-Verlag,1998.122-142.
[66]Li H, Chen J, Tao Y, et al. Improving a local learning technique for queue wait time predictions[C]. In:Turner S, Lee B, and Cai W, editors, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), IEEE Computer Society,2006,335-342.
[67]Smith W, Taylor V, and Foster I. Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance[C]. In:Proceedings of the 5th Annual Workshop on Job Scheduling Strategies for Parallel Processing, April 1999. Condado Plaza Hotel & Casino, San Juan, Puerto Rico.1999.202-219.
[68]BREVIK J, NURMI D, WOLSKI R. Predicting bounds on queuing delay for batch-scheduled parallel machines[C]. In Proceedings of PPoPP 2006. New York, USA.2006:110-118.
[69]曹瀚,刘大昕,富锐.基于活动的工作流关键路径算法[J].哈尔滨工程大学学报,2006,27(4)：551-555.
[70]Aalst W, Aldred L, Dumas M, et al. Design and Implementation of the YAWL System[C]. In:Persson A and Stirna J, editors. Proceedings of the 16th International Conference on Advanced Information Systems Engineering (CAiSE'04), volume 3084 of Lecture Notes in Computer Science, Berlin, Germany: Springer,2004.142-159.
[71]Aalst W, Hofstede A. YAWL:Yet Another Workflow Language[J]. Information Systems,2005,30(4):245-275.
[72]Aalst W. Three good reasons for using Petri net-based workflow management system[C], in:Navathe S, Wakayama T (Eds.), Proceedings of the international Working Conference on Information and Process Integration in Enterprises(IPIC'96),Cambridge, MA,1996,179-201.
[73]Aalst W. The application of Petri nets to workflow management[J], The Journal of Circuits Systems and Computers,1998,8(1):21-66.
[74]Aalst W. Interorganisational workflow:An approach based on message sequence charts and Petri nets[J]. Systems Analysis, Modeling, Simulation 1999,34(3): 335-367.
[75]Aalst W. Verification of Workflow Nets[C], Lecture Notes in Computer Science, vol. 1248, Springer, Berlin,1997,407-426.
[76]W.M.P. van der Aalst, Workflow verification:Finding control-flow errors using Petri net-based techniques[C], Lecture Notes in Computer Science, vol.1806, Springer, Berlin,2000,161-183.
[77]Salimifard K, Wright M. Petri net-based modeling of workflow systems:An overview[J]. Europ. J. Operat. Res.2001,134 (3),218-230.
[78]Hollingsworth D. Terminology & Glossary[S], Workflow Management Coalition, 1996.
[79]Aalst W, Hofstede A, Kiepuszewski B, et al. Advanced Workflow Patterns[C]. In CoopIS 2000, Lecture Notes in Computer Science (LNCS) vol.1901, Springer-Verlag, Heidelberg, Germany,2000,18-29.
[80]Nick Russell. Foundations of Process-Aware Information Systems:[dissertation]. Brisbane, Australia:Queensland University of Technology,2007.
[81]余鹏,周国富,屈婉玲,等.基于Petri网的工作流模式分析研究[J].系统仿真学报,2003,15(增刊)：119-122.
[82]Russell N, Hofstede A, Aalst W, et al. Workow Control-Flow Patterns:A Revised View[R]. Tech. Rep. BPM-06-22, BPMcenter.org.2006.
[83]Workflow Patterns Initiative[OL]. http://www.workflowpattern s.com.
[84]Jiang Hao, Wang Pei-an. An approach for workflow performance evaluation based on discrete stochastic Petri net[C]. Proceedings of the IEEE International Conference on e-Business Engineering.2007,327-330.
[85]Lin C, Qu Y, Ren F, et al. Performance equivalent analysis of workflow systems based on stochastic petri net models[C], Lecture Notes Computer Science#2480, 2002,64-79.
[86]余波,周龙骧,钟锡昌等.网格工作流技术综述[J],计算机工程,2006,32(2)：4-6.
[87]李维宏,张绍华,祝精荟.网格工作流研究现状及存在问题[J],计算机科学,2005,32(11)：11-15.
[88]董婧,乐美龙.基于串联排队网络的集装箱码头系统分析[J].中国水运(学术版),2006,6(12)：40-42.
[89]盛友招.排队论及其在计算机通信中的应用[M].北京：北京邮电大学出版社,1998.
[90]Gomez-Corral, A. A tandem queue with blocking and Markovian arrival process[J], Queueing Systems,2002,41(4):343-370.
[91]唐应辉,唐小我.排队论——基础与分析技术[M].北京：科学出版社,2006.
[92]Rege K. Approximate analysis of serial manufacturing lines with buffer control[J]. Information and decision technologies.1988,14(11):31-43.
[93]Mitra D, Mitrani I. Analysis of a Kanban discipline for cell coordination in production lines I[J]. MANAGEMENT SCIENCE.1990,36(12):1548-1566.
[94]Mitra D, Mitrani I. Analysis of a Kanban discipline for cell coordination in production lines II:Stochastic demands[J]. Opereations Research 39.1991,807-823.
[95]张润彤,朱晓敏.串联排队网络顾客准入的模糊控制[J],自动化学报,2000,26(2)：192-198.
[96]孙薇,王勇.简单串联服务系统的分析及应用[J].哈尔滨工业大学学报,2006,38(5)：808-810.
[97]Leeuwaarden J and Reesing J. A tandem queue with coupled processors: Computational issues[J]. Queueing Systems,.2005,51(1-2):29-52.
[98]Debicki K, Mandjes M, Uitert M. A tandem queue with Levy input:a new representation of the downstream queue length[J]. Probability in the Engineering and Informational Sciences (2007),21:83-107.
[99]Charles Knesll. An explicit solution to a tandem queueing model[J]. Queueing Systems,1998,30(3-4):261-272.
[100]Ivo Adan, Michel Mandjes, Werner Schinhardt, et al. On a generic class of two-node queueing systems, queueing system.2009,61(1):37-63.
[101]Song X, Mehmet M. A performance analysis of discrete-time tandem queues with Markovian sources. Performance Evaluation[J].2009,66(9-10):524-543.
[102]Ching W, Li T, Choi S, et al. a tandem queueing system with application to pricing strategy[J]. Journal of Industrial and Management Optimization.2009,5(1):103-114.
[103]Leskela L, Resing J. A tandem queueing network with feedback admission control[J]. In:Chahed T and Tuffin B eds. Proceedings of the First EuroFGI International Conference NET-COOP, vol.4465 of LNCS. Springer.2007,129-137.
[104]许淑艳.蒙特卡罗方法在实验核物理中的应用[M].北京：原子能出版社,1986.
[105]徐钟济.蒙特卡罗方法[M].上海：上海科学技术出版社,1982.
[106]刘军,科学计算中的蒙特卡罗策略[M],唐年胜,周勇,徐亮.北京：高等教育出版社,2009.
[107]吉庆丰,蒙特卡罗方法及其在水力学中的应用[M],南京：东南大学出版社,2004.
[108]Nagel K, Schreckenberg M. A cellular automaton model for freeway traffic[J]. J. Phys. I France,2 (1992):2221-2229.
[109]Lecchini W, Glover J, Lygeros, et al. Monte Carlo optimisation for conflcit resolution in air traffic control[C]. In:Blom H, Lygeros J, eds. Stochastic Hybrid Systems: Theory and Safety Critical Applications, LNCIS series, Springer, Berlin.2006,257-276.
[110]Wu G. Application of queueing theory with Monte Carlo simulation to the study of the intake and adverse effects of ethanol[J]. Alcohol and Alcoholism,1998,33(5): 519-527.
[111]Matthias Falkne, Michael Devetsikiotis, loannis Lambadaris. Fast simulation of networks of queues with effective and decoupling bandwidths[J]. ACM Transactions on Modeling and Computer Simulation.1999,9(1):45-58.
[112]L'Ecuyer P, L'ecot C, and Tuffin B. Randomized quasi-Monte Carlo simulation of Markov chains with an ordered state space[C]. In:H. Niederreiter and D. Talay, Eds. Monte Carlo and Quasi-Monte Carlo Methods 2004,331-342.
[113]Coates M, Nowak R. Sequential Monte Carlo inference of internal delays in nonstationary communication networks[J]. IEEE Trans. Signal Processing, Special Issue on Monte Carlo Methods for Statistical Signal Processing,2002:366-376.
[114]WANG HuiQin, KE XiZheng & ZHAO Li. MIMO free space optical communication based on orthogonal space time block code[J].Science in China(Series F:Information Sciences).2009,52(8):1483-1490.
[115]何艳生,陈忠家,韩永志.位错和溶质原子交互作用的蒙特卡罗模拟[J],合肥工业大学学报(自然科学版),2009,32(7)：989-991.
[116]卓俊,牛胜利,黄流兴等.低能电子在固体表面背散射系数的直接Monte Carlo方法模拟[J].计算物理,2009,26(4)：586-590.
[117]马俊海,杨非.可转换债券蒙特卡罗模拟定价的控制变量改进方法[J],系统工程理论与实践,2009,29(6)：77-85.
[118]Banks J, Carson J, Nelson B, et al.离散事件系统仿真(第四版)[M],肖田元,范文慧(译).北京：机械工业出版社.2007.
[119]金治明,李永乐.概率论与数理统计[M].长沙：国防科技大学出版社,1997.
[120]两级串联排队系统实验数据[OL],ftp://jsj.fjut.edu.cn/tandemqueuesystem/2ser.rar.
[121]三级串联排队系统实验数据[OL],ftp://jsj.fjut.edu.cn/tandemqueuesystem/3ser.rar
[122]4-10级串联排队系统实验数据[OL],ftp://jsj.fjut.edu.cn/tandemqueue system/Mser.rar
[2]范玉顺.工作流管理技术基础[M].北京：清华大学出版社,2001.
[3]工作流管理联盟官方网站[OL]. http://www.wfmc.org.
[4]Hollingsworth D. The workflow reference model[S]. Workflow Management Coalition,1995.
[5]Ultimus Inc. Business Process in Internet-Time[R]. Ultimus Technical Report,2001.
[6]Tibco. Tibco Staffware Suite[OL]. http://www.tibco.com.
[7]GEPPERT A, TOMBROS D. Event-based distributed workflow execution with EVE[R]. Technical Report.96.05. University of Zurich, Zurich, Switzerland.
[8]黄双喜,范玉顺.基于工作流的ERP系统开发与实施[J].计算机集成制造系统,2004,10(2)：139-143.
[9]Hiraishi K. performance evaluation of workflows using fluid flow approximation of discrete sets and probability distribution[C]. Industrial Electronics Society,33rd Annual Conference of the IEEE,2007,88-93.
[10]曹健,张申生,胡锦敏.面向并行工程的集成化产品开发过程管理系统研究[J].中国机械工程.2002,13(1)：80-83.
[11]郭蕾,曹华,孙树栋等.基于工作流管理的生产计划系统.机械科学与技术[J],2003,22(1)：157-159.
[12]Panagos E, Rabinovich M. Predictive workflow management[C]. In:Proceeding of the 3rd International Workshop on Next Generation Information Technologies and Systems, Neve Ilan, ISRAEL,1997.
[13]Panagos E, Rabinovich M. Escalations in workflow management systems[C], in: Proceedings of the DART'96, Rockville, MD,1996.
[14]Aalst W, Rosemann M, Dumas M. Deadline-based Escalation in Process-Aware Information Systems[J]. Decision Support Systems,2007,43(2):492-511.
[15]Workflow Management Coalition. Process Definition Interface-XML process definition Language[S]. Document Number WFMC-TC-1025.2005.
[16]Grabert M. Interoperability White Paper[S]. Document Number WfMC-TC-1008, 1995.
[17]Ogris K. Applications Invocation Interface[S]. Document Number WfMC-TC-1014, 1996.
[18]Oracle Inc. Overview of Oracle Workflow for Administrators[OL] http://download.oracle.com/docs/cd/B14117_01/workflow.101/b10283/agov.htm.
[19]lyengar A, Jessani V, Chilanti M. WebSphere Business Integration Primer:Process Server, BPEL, SCA, and SOA[M]. IBM Press,2007.
[20]David Chappell, Chappell & Associates. Understanding BizTalk Server 2006[M]. Microsoft Corporation:San Francisco,2005.
[21]杭州信雅达系统工程股份有限公司.利用SunFlow和Dorado开发流程管理[N],中国计算机报,2006-05-08.
[22]董云卫,楼文晓,郝克刚.业务流程管理与集成系统Synch roFLOW的软件体系结构[J].计算机科学.2004,31(6)：138-140.
[23]李伟平;范玉顺.基于工作流的资源受限项目调度研究[J].清华大学学报(自然科学版),2004,44(10)：1384-1388.
[24]Aalst W. Verification of Workflow Nets[C]. In:Az' ema P, Balbo G, editors. Application and Theory of Petri Nets 1997, volume 1248 of Lecture Notes in Computer Science, Berlin:Springer-Verlag,1997,407-426.
[25]Choi Y andZhao J. Decomposition-based Verification of Cyclic workfows[C]. In: Peled D, Tsay Y, editors. Proceedings of Automated Technology for Verification and Analysis (ATVA 2005), volume 3707 of Lecture Notes in Computer Science, Taipei, Taiwan:Springer-Verlag,2005,84-98.
[26]Lin H, Zhao Z, Li H, et al. A Novel Graph Reduction Algorithm to Identify Structural Conflicts[C]. In:Proceedings of the Thirty-Fourth Annual Hawaii International Conference on System Science (HICSS-35). IEEE Computer Society Press,2002, 536-550.
[27]Aalst W, Hirnschall A, and Verbeek H. An Alternative Way to Analyze Workow Graphs[C]. In:Banks-Pidduck A, Mylopoulos J, Woo C, et al, editors. Proceedings of the 14th International Conference on Advanced Information Systems Engineering (CAiSE'02), volume 2348 of Lecture Notes in Computer Science, Berlin: Springer-Verlag,2002,535-552.
[28]Sadiq W, Orlowska M. Analyzing Process Models using Graph Reduction Techniques[J]. Information Systems,2000,25(2):117-134.
[29]Dongen B, Aalst W, and Verbeek H. Verification of EPCs:Using reduction rules and Petri nets[C]. In O. Pastor and J. Falcao e Cunha, editors, Advanced Information Systems Engineering,17th International Conference, CAiSE 2005, Porto, Portugal, June 13-17,2005, Proceedings, volume 3520 of Lecture Notes in Computer Science, Springer,2005,372-386.
[30]Perumal S, Mahanti A. Cyclic Workflow Verification Algorithm for Workflow Graphs[R]. Working paper,lndian Institute of Management Calcutta, Kolkata, India. 2006.
[31]陈翔,夏国平.基于着色Petri网的工作流建模和合理性分析[J].计算机集成制造系统,2004,10(4)：381-387.
[32]周建涛,史美林,叶新铭.工作流过程建模中的形式化验证技术[J].计算机研究与发展,2005,42(1)：1-9.
[33]周建涛,史美林,叶新铭.CBR：一种支持工作流过程语义验证的组件级化简方法.电子学报[J].2005,33(6)：1060-1065.
[34]唐达,刘丹妮.基于层次时间Petri网的工作流模型可达性分析方法[J].计算机集成制造系统,2006,12(4)：487-492.
[35]赵文,袁崇义,刘刚等.基于P/T系统化简方法的工作流过程模型验证[J].软件学报,2004,15(10)：1423-1430.
[36]钟诗胜,汤新民,李涛.时间约束层次细化工作流建模及验证研究[J].计算机集成制造系统.2006,12(11)：1773-1779.
[37]BARTEK K, ARTHUR H. On structured workflow modeling [C]. In:proceedings of the 12th International Conference on Advanced Information Systems, Engineering. Stockholm,2000,431-445
[38]Jin Hyun Son, Jung Sun Kim, Myoung Ho Kim. Extracting the Workflow Critical Path from the Extended Well-Formed Workflow Schema[J]. Journal of Computer and System Sciences 2005,70(1):86-106.
[39]Li Jianqiang, Fan Yushun, Zhou Mengchu. Performance Modeling and Analysis of Workflow[J]. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, [A],2004,34(2):229-242.
[40]肖志娇,常会友,衣杨.工作流时间性能分析方法[J].计算机集成制造系统,2006,12(8)：1284-1287.
[41]林闯,田立勤,魏丫丫.工作流系统模型的性能等价分析[J].软件学报,2002,13(8)：1472-1480.
[42]姜浩,董逸生,罗军舟.一种基于扩展时间Petri网的工作流时间性能评价方法[J].计算机研究与发展,2005,42(5)：849-855.
[43]陈翔.基于广义随机petri网的工作流性能分析[J].计算机集成制造系统.2003,9(5)：399-403.
[44]Yan Pan,Yong Tang. Ji'an Xu, Kaishun Wu. Time Performance evaluation for workflow based on extended FTWF-NETS[C]. Computer Supported Cooperative Work in Design,2006. Naijing:1-5.
[45]肖志娇,常会友,衣扬.工作流时间性能分析方法[J].计算机集成制造系统.2006,12(8)：1284-1288.
[46]潘炎,汤庸,陈子聪.一种工作流模型的时间性能评估方法[J].计算机集成制造系统,2007,13(8)：1539-1544.
[47]田立勤,林闯.一类可由基本模型嵌套组成的工作流系统的性能分析方法[J].电子学报,2003,31(12A)：2167-2170.
[48]van Hee, Reijers H. Using formal analysis techniques in business process redesign-business process management[C]. In:Aalst W, Desel J, Oberweis A, eds. Business Process Management-Models, Techniques and Empirical Studies. Springer-Verlag,2000,142-160.
[49]Qianchuan Zhao. Performance Bounds for a Class of Workflow Diagrams[C].3645 of Lecture Notes in Computer Science, Springer,2005,625-636.
[50]Hui Ma, Yong Tang, Yan Pan. Upper Bound Estimation of Turnaround Time Based on Fuzzy Temporal Workflow Net[C]. In:Proceedings of the 10th International Conference on Computer Supported Cooperative Work in Design. Naijing,2006,1-5.
[51]Liu Sheng, Fan Yushun. Analysis for instance' staying-time distribution in the workflow[C]. IEEE International Conference on Industrial Technology. Hong Kong, 2005,772-777.
[52]Guang-Song Lu, Yun-Jian Ge. Analysis of Response Time Probability Distribution of Workflows[J]. Journal of Southeast University (English Edition).2006, 22(1):137-142.
[53]刘胜,范玉顺.资源约束下实例在工作流中停留时间分析方法[J].电子学报.2005,33(10)：1867-1871.
[54]Eder J and Pichler H. Duration histograms for workflow systems[C]. In Proc. Conf. EISIC'02, Kanazawa, Japan.2002,25-27.
[55]Li H, Yang Y. Dynamic checking of temporal constraints for concurrent workflows[J]. Electronic Commerce Research and Applications,2005,4(2):124-142.
[56]Panagos Euthimios, Rabinovich Michael. Methods for dynamically predicting workflow completion times and workflow escalation[P]. United States:6601035, 2003.
[57]Lee H, Suh H.Estimating the duration of stochastic workflow for product development process[J].International Journal of Production Economics.2008, 111(1):105-117.
[58]Cardoso J. Workflow Quality of Service Management using Data Mining Techniques[C].3rd International IEEE Conference on Intelligent System.London, 2006,479-482.
[59]Cardoso J, Sheth A,Miller J,et al. Modeling quality of service for workflows and web service processes[J]. Journal of Web Semantics.2004,1 (3):281-308.
[60]Sion R and Tatemura J. Dynamic stochastic models for workflow response optimization[C]. In Proc. IEEE International Conference on Web Services (ICWS'05),2005,657-664,
[61]Chen J, Yang Y. Adaptive selection of necessary and sufficient checkpoints for dynamic verification of temporal constraints in grid workflow systems[J]. ACM Transactions on Autonomous and Adaptive Systems (TAAS).2007,2(2),Article 6.
[62]Chen J, Yang Y.2005. A Minimum Proportional Time Redundancy based Checkpoint Selection Strategy for Dynamic Verification of Fixed-time Constraints in Grid Workflow Systems[C]. In Proceedings of the 12th Asia-Pacific Software Engineering Conference. Taipei, Taiwan.Dec.2005,299-306.
[63]Chen J, Yang Y. Temporal Dependency based Checkpoint Selection for Dynamic Verification of Fixed-time Constraints in Grid Workflow Systems[C]. In:proceedings of 30th International Conference on Software Engineering (ICSE 2008), Leipzig, Germany, May 2008,141-150.
[64]Li H, Groep D, and Wolters L. Efficient response time predictions by exploiting application and resource state similarities[C]. In proceedings of 6th IEEE/ACM International Workshop on Grid Computing (Grid2005), in SC'05, Seattle, Washington, USA,2005,234-241.
[65]Smith W, Foster I, and Taylor V. Predicting Application Run Times Using Historical Information[C]. In:Feitelson D and Rudolph L, eds. Job Scheduling Strategies for Parallel Processing, Springer-Verlag,1998.122-142.
[66]Li H, Chen J, Tao Y, et al. Improving a local learning technique for queue wait time predictions[C]. In:Turner S, Lee B, and Cai W, editors, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), IEEE Computer Society,2006,335-342.
[67]Smith W, Taylor V, and Foster I. Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance[C]. In:Proceedings of the 5th Annual Workshop on Job Scheduling Strategies for Parallel Processing, April 1999. Condado Plaza Hotel & Casino, San Juan, Puerto Rico.1999.202-219.
[68]BREVIK J, NURMI D, WOLSKI R. Predicting bounds on queuing delay for batch-scheduled parallel machines[C]. In Proceedings of PPoPP 2006. New York, USA.2006:110-118.
[69]曹瀚,刘大昕,富锐.基于活动的工作流关键路径算法[J].哈尔滨工程大学学报,2006,27(4)：551-555.
[70]Aalst W, Aldred L, Dumas M, et al. Design and Implementation of the YAWL System[C]. In:Persson A and Stirna J, editors. Proceedings of the 16th International Conference on Advanced Information Systems Engineering (CAiSE'04), volume 3084 of Lecture Notes in Computer Science, Berlin, Germany: Springer,2004.142-159.
[71]Aalst W, Hofstede A. YAWL:Yet Another Workflow Language[J]. Information Systems,2005,30(4):245-275.
[72]Aalst W. Three good reasons for using Petri net-based workflow management system[C], in:Navathe S, Wakayama T (Eds.), Proceedings of the international Working Conference on Information and Process Integration in Enterprises(IPIC'96),Cambridge, MA,1996,179-201.
[73]Aalst W. The application of Petri nets to workflow management[J], The Journal of Circuits Systems and Computers,1998,8(1):21-66.
[74]Aalst W. Interorganisational workflow:An approach based on message sequence charts and Petri nets[J]. Systems Analysis, Modeling, Simulation 1999,34(3): 335-367.
[75]Aalst W. Verification of Workflow Nets[C], Lecture Notes in Computer Science, vol. 1248, Springer, Berlin,1997,407-426.
[76]W.M.P. van der Aalst, Workflow verification:Finding control-flow errors using Petri net-based techniques[C], Lecture Notes in Computer Science, vol.1806, Springer, Berlin,2000,161-183.
[77]Salimifard K, Wright M. Petri net-based modeling of workflow systems:An overview[J]. Europ. J. Operat. Res.2001,134 (3),218-230.
[78]Hollingsworth D. Terminology & Glossary[S], Workflow Management Coalition, 1996.
[79]Aalst W, Hofstede A, Kiepuszewski B, et al. Advanced Workflow Patterns[C]. In CoopIS 2000, Lecture Notes in Computer Science (LNCS) vol.1901, Springer-Verlag, Heidelberg, Germany,2000,18-29.
[80]Nick Russell. Foundations of Process-Aware Information Systems:[dissertation]. Brisbane, Australia:Queensland University of Technology,2007.
[81]余鹏,周国富,屈婉玲,等.基于Petri网的工作流模式分析研究[J].系统仿真学报,2003,15(增刊)：119-122.
[82]Russell N, Hofstede A, Aalst W, et al. Workow Control-Flow Patterns:A Revised View[R]. Tech. Rep. BPM-06-22, BPMcenter.org.2006.
[83]Workflow Patterns Initiative[OL]. http://www.workflowpattern s.com.
[84]Jiang Hao, Wang Pei-an. An approach for workflow performance evaluation based on discrete stochastic Petri net[C]. Proceedings of the IEEE International Conference on e-Business Engineering.2007,327-330.
[85]Lin C, Qu Y, Ren F, et al. Performance equivalent analysis of workflow systems based on stochastic petri net models[C], Lecture Notes Computer Science#2480, 2002,64-79.
[86]余波,周龙骧,钟锡昌等.网格工作流技术综述[J],计算机工程,2006,32(2)：4-6.
[87]李维宏,张绍华,祝精荟.网格工作流研究现状及存在问题[J],计算机科学,2005,32(11)：11-15.
[88]董婧,乐美龙.基于串联排队网络的集装箱码头系统分析[J].中国水运(学术版),2006,6(12)：40-42.
[89]盛友招.排队论及其在计算机通信中的应用[M].北京：北京邮电大学出版社,1998.
[90]Gomez-Corral, A. A tandem queue with blocking and Markovian arrival process[J], Queueing Systems,2002,41(4):343-370.
[91]唐应辉,唐小我.排队论——基础与分析技术[M].北京：科学出版社,2006.
[92]Rege K. Approximate analysis of serial manufacturing lines with buffer control[J]. Information and decision technologies.1988,14(11):31-43.
[93]Mitra D, Mitrani I. Analysis of a Kanban discipline for cell coordination in production lines I[J]. MANAGEMENT SCIENCE.1990,36(12):1548-1566.
[94]Mitra D, Mitrani I. Analysis of a Kanban discipline for cell coordination in production lines II:Stochastic demands[J]. Opereations Research 39.1991,807-823.
[95]张润彤,朱晓敏.串联排队网络顾客准入的模糊控制[J],自动化学报,2000,26(2)：192-198.
[96]孙薇,王勇.简单串联服务系统的分析及应用[J].哈尔滨工业大学学报,2006,38(5)：808-810.
[97]Leeuwaarden J and Reesing J. A tandem queue with coupled processors: Computational issues[J]. Queueing Systems,.2005,51(1-2):29-52.
[98]Debicki K, Mandjes M, Uitert M. A tandem queue with Levy input:a new representation of the downstream queue length[J]. Probability in the Engineering and Informational Sciences (2007),21:83-107.
[99]Charles Knesll. An explicit solution to a tandem queueing model[J]. Queueing Systems,1998,30(3-4):261-272.
[100]Ivo Adan, Michel Mandjes, Werner Schinhardt, et al. On a generic class of two-node queueing systems, queueing system.2009,61(1):37-63.
[101]Song X, Mehmet M. A performance analysis of discrete-time tandem queues with Markovian sources. Performance Evaluation[J].2009,66(9-10):524-543.
[102]Ching W, Li T, Choi S, et al. a tandem queueing system with application to pricing strategy[J]. Journal of Industrial and Management Optimization.2009,5(1):103-114.
[103]Leskela L, Resing J. A tandem queueing network with feedback admission control[J]. In:Chahed T and Tuffin B eds. Proceedings of the First EuroFGI International Conference NET-COOP, vol.4465 of LNCS. Springer.2007,129-137.
[104]许淑艳.蒙特卡罗方法在实验核物理中的应用[M].北京：原子能出版社,1986.
[105]徐钟济.蒙特卡罗方法[M].上海：上海科学技术出版社,1982.
[106]刘军,科学计算中的蒙特卡罗策略[M],唐年胜,周勇,徐亮.北京：高等教育出版社,2009.
[107]吉庆丰,蒙特卡罗方法及其在水力学中的应用[M],南京：东南大学出版社,2004.
[108]Nagel K, Schreckenberg M. A cellular automaton model for freeway traffic[J]. J. Phys. I France,2 (1992):2221-2229.
[109]Lecchini W, Glover J, Lygeros, et al. Monte Carlo optimisation for conflcit resolution in air traffic control[C]. In:Blom H, Lygeros J, eds. Stochastic Hybrid Systems: Theory and Safety Critical Applications, LNCIS series, Springer, Berlin.2006,257-276.
[110]Wu G. Application of queueing theory with Monte Carlo simulation to the study of the intake and adverse effects of ethanol[J]. Alcohol and Alcoholism,1998,33(5): 519-527.
[111]Matthias Falkne, Michael Devetsikiotis, loannis Lambadaris. Fast simulation of networks of queues with effective and decoupling bandwidths[J]. ACM Transactions on Modeling and Computer Simulation.1999,9(1):45-58.
[112]L'Ecuyer P, L'ecot C, and Tuffin B. Randomized quasi-Monte Carlo simulation of Markov chains with an ordered state space[C]. In:H. Niederreiter and D. Talay, Eds. Monte Carlo and Quasi-Monte Carlo Methods 2004,331-342.
[113]Coates M, Nowak R. Sequential Monte Carlo inference of internal delays in nonstationary communication networks[J]. IEEE Trans. Signal Processing, Special Issue on Monte Carlo Methods for Statistical Signal Processing,2002:366-376.
[114]WANG HuiQin, KE XiZheng & ZHAO Li. MIMO free space optical communication based on orthogonal space time block code[J].Science in China(Series F:Information Sciences).2009,52(8):1483-1490.
[115]何艳生,陈忠家,韩永志.位错和溶质原子交互作用的蒙特卡罗模拟[J],合肥工业大学学报(自然科学版),2009,32(7)：989-991.
[116]卓俊,牛胜利,黄流兴等.低能电子在固体表面背散射系数的直接Monte Carlo方法模拟[J].计算物理,2009,26(4)：586-590.
[117]马俊海,杨非.可转换债券蒙特卡罗模拟定价的控制变量改进方法[J],系统工程理论与实践,2009,29(6)：77-85.
[118]Banks J, Carson J, Nelson B, et al.离散事件系统仿真(第四版)[M],肖田元,范文慧(译).北京：机械工业出版社.2007.
[119]金治明,李永乐.概率论与数理统计[M].长沙：国防科技大学出版社,1997.
[120]两级串联排队系统实验数据[OL],ftp://jsj.fjut.edu.cn/tandemqueuesystem/2ser.rar.
[121]三级串联排队系统实验数据[OL],ftp://jsj.fjut.edu.cn/tandemqueuesystem/3ser.rar
[122]4-10级串联排队系统实验数据[OL],ftp://jsj.fjut.edu.cn/tandemqueue system/Mser.rar