期刊文献+

基于Pi演算的跨组织工作流建模研究 被引量:16

Research on Cross-Organizational Workflow Modeling Based on Pi-Calculus
下载PDF
导出
摘要 传统的工作流建模方法主要用于描述组织内部流程,因而难以描述跨组织工作流面向流程、组合、抽象、涉及多个自治系统通信合作的新特点.针对此问题,提出了一种基于Pi演算的跨组织工作流建模方法,利用Pi演算的并发计算操作符,将跨组织业务流程建模为一组自治且并发执行的组织内子流程的组合,子流程建模为组织内本地流程定义和组织间控制约束的组合.基于Pi演算的弱互相似理论,验证了两个跨组织子流程外部行为的相等性,用于帮助组织内私有流程的外部抽象.基于该方法建立的跨组织工作流模型在子流程间建立了一种松耦合的关系,适用于动态的跨组织环境,同时基于严格的形式化方法,便于分析和验证. Cross-organizational workflow has some different characteristics compared with normal workflow, such as process-oriented, compositionality, abstraction, involving communication, and collaboration of several systems. Traditional workflow modeling methods cannot meet these new requirements because they don' t have mechanisms to support abstraction, and there are no standards and concurrency operations to obtain bigger models by combining small ones in these modeling methods. Aimed at this problem, a cross-organizational workflow modeling method based on Pi-calculus is presented and the consistency and compositionality of the model are analyzed. Using concurrent operators Pi-calculus provided, a cross-organizational business process is modeled as a composition of a set of autonomy and concurrent intra-organizational sub-processes, and an intra-organizational sub-process is modeled as a composition of a local business process definition and control constraints between organizations as well. Based on weak bisimulation theory of Pi-calculus, external behavior equivalence of two cross-organizational sub-processes is defined, which can help building abstract of an internal private business process. Compared with the traditional methods, this new cross-organizational workflow modeling method builds a loosely coupled relationship among sub-processes, which makes this model adapt to dynamic cross-organizational environment. And this model is based on strict formal method, which facilitates the analysis and verification of business process models.
出处 《计算机研究与发展》 EI CSCD 北大核心 2007年第7期1243-1251,共9页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60673130)
关键词 跨组织工作流 PI演算 业务流程建模 抽象 组合 cross-organizational workflow Pi-calculus business process modeling abstract composition
  • 相关文献

参考文献3

二级参考文献50

  • 1T. Murata. Petri nets: Properties, analysis and applications.Proceedings of the IEEE, 1989, 77(4) : 541-580.
  • 2W. Sadiq, M. Orlowska. Applying graph reduction techniques for identifying structural conflicts in process models. In: Proc. of the 11th Int'l Conf. on Advanced Information Systems Engineering(CAiSE'99). Berlin: Springer Verlag, 1999. 195-209.
  • 3W. Sadiq, M. Orlowska. Analyzing process models using graph reduction techniques. Information System, 2000, 25(2): 117-134.
  • 4H. Lin, Z. Zhao, H. Li, et al. A novel graph reduction algorithm to identify structural conflicts. In: Proc. of the 35th Hawaii Int'l Conf. on System Sciences (HICSS-35) . LosAlamitos, CA: IEEE Computer Society Press, 2002. 289-290.
  • 5Li Pei-wu, Lu Zheng-ding. Reduction techniques of workflow verification and its implementation. In: Hart Yanbo, Shi Meilin eds. Proc. of Int'l Workshop on Grid and Cooperative Computing. Beijing: Publishing House of Electronics Industry,2002. 703--710.
  • 6H. Genrich. Equivalence transformations of PrT-Nets. In: G.Rozenberg ed.. Advances in Petri nets. Berlin: Springer, 1990.179-- 208.
  • 7S. Haddad. A reduction theory for coloured nets. In: K. Jensen,G. Rozenberg eds.. LNCS: High Level Petri Nets, Theory and Application. Berlin: Springer Verlag, 1991. 399-425.
  • 8R. Sloan, U. Buy. Reduction rules for time Petri nets. Acta Informatica, 1996, 33(7): 687--706.
  • 9K. Schmidt. Applying reduction rules to algebraic Petri nets.Helsinki University of Technology, Tech. Rep. : 44, 1997.
  • 10C. Ramamoortht, Y. Yaw. A Petri net reduction algorithm forprotocol analysis. In: W. Kosinsky, et al. eds.. Communications and Architecture & Protocols. New York: Association for Computing Machinery, 1986. 157-- 166.

共引文献59

同被引文献94

引证文献16

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部