期刊文献+

网络服务行为的进程代数验证方法研究及其应用 被引量:1

A Study on Network Service Behavior Verification with Process Algebra and Its Application
下载PDF
导出
摘要 通过形式化建模分析了系统特点,确认系统行为,从而尽可能避免系统的冲突等情况.文中提出了一种使用进程代数描述网络服务组件的行为建模方法,包括强模拟、强互模拟、时效性、触发器、服务环境等网络服务交互行为描述方法,然后给出了P2P节点的节点发现、防火墙穿越等行为的描述,提出了适用于托管的RCMMS网络自管理协议,并使用代数的方法描述协议行为,确认其合理性,从而验证文中所提出的方法. With formalization and modeling system, we can analyze system characteristics, verify system behavior and try to avoid conflicts through. This paper presents a behavior modeling method for network services components using process algebra, including strong simulation, strong bisimulation, timeliness, service triggers, and service content. Then the P2P discovery of nodes and firewall traversal behavior description are presented. And a network self management protocol named RCMMS is proposed with process algebra description to verify the proposed method.
出处 《计算机学报》 EI CSCD 北大核心 2011年第9期1660-1668,共9页 Chinese Journal of Computers
基金 国家"八六三"高技术研究发展计划项目基金(2009AA01Z251 2008AA01A303) 国家"九七三"重点基础研究发展规划项目基金(2009CB320505) 国家科技支撑项目(2008BAH37B05) 国家自然科学基金(60873192 61070182 60873193 60803123) 中央高校基本科研业务费专项资金(2010XJ025)资助~~
关键词 进程代数 Π演算 服务行为 交互系统演算 process algebra π calculus, service behavior interactive systems calculus
  • 相关文献

参考文献30

  • 1McCarthy J. A basis for a mathematical theory of computa- tion//Braffort P, Hirshberg D eds. Computer Programming and Formal Systems. Amsterdam: North Holland, 1963: 33-70.
  • 2Scott D S, Strachey C. Towards a mathematical semantics for computer languages//Fox J ed. Proceedings Symposium Computers and Automata. New York: Polytechnic Institute of Brooklyn Press, 1971: 19-46.
  • 3Floyd R W. Assigning meanings to programs//Schwartz J T ed. Proceedings Symposium in Applied Mathematics. Mathe- matical Aspects of Computer Science, AMS, 1967:19- 32.
  • 4Milner Robin. A calculus of communicating systems//Lec- ture Notes in Computer Science 92. Springer Verlag, 1980.
  • 5Petri C A. Kommunikation mit automaten [Ph. D. disserta- tion]. University of Bonn, Bonn, West Germany, 1962.
  • 6Morris J H. Lambda-calculus models of programming lan- guages[Ph. D. dissertation]. MIT, Cambridge, MA, USA, 1969.
  • 7Bekic H. Towards a Mathematical Theory of Processes. IBM Laboratory, Vienna:Technical Report TR 25. 125, 1971.
  • 8Milne G J, Milner R. Concurrent processes and their syntax. Journal of the ACM, 1979, 26(2): 302- 321.
  • 9Park D M. Concurrency on automata and infinite sequences// Deussen P ed. Proceedings of the Conference on Theoretical Computer Science. Lecture Notesin Computer Science 104. Springer-Verlag, 1981.
  • 10Hoare C A R. Communicating sequential processes. Commu- nications of the ACM, 1978, 21(8): 666-677.

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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