移动网可达树

doi:10.11896/j.issn.1002-137X.2016.11.010

计算机科学 ›› 2016, Vol. 43 ›› Issue (11): 55-60.doi: 10.11896/j.issn.1002-137X.2016.11.010

• 2015 第十五届全国Petri 网理论与应用学术会议 • 上一篇下一篇

移动网可达树

张瑞华,杨茹,丁志军

同济大学嵌入式系统与服务计算教育部重点实验室上海201804,同济大学嵌入式系统与服务计算教育部重点实验室上海201804,同济大学嵌入式系统与服务计算教育部重点实验室上海201804

出版日期:2018-12-01 发布日期:2018-12-01
基金资助:
本文受国家自然科学基金项目(61173042,61472004),上海市产学研合作项目(沪CXY-2013-40)资助

Reachability Tree of Mobile Net

ZHANG Rui-hua, YANG Ru and DING Zhi-jun

Online:2018-12-01 Published:2018-12-01

摘要/Abstract

摘要： 随着计算机技术和网络通信技术的高速发展,对于并发分布式系统,已经提出了进程代数以及Petri网等形式化分析方法。近年来由于移动互联网的出现和快速发展,通过在进程代数中增加移动性得到了pi演算,与此同时,Petri网领域也采用谓词/变迁网、颜色网等构建移动系统模型。但它们仍存在一些不足之处。在此基础上,A.Asperti和N.Busi提出了移动网这一系统模型。移动网是在Petri网的基础上增加了移动性并结合了进程代数的优势得到的,适用于描述和刻画移动计算系统。然而,目前并没有对于移动网相应分析方法的研究。为此开展了移动网模型分析方法的研究,给出了移动网可达树的构造算法,提供了移动网模型可达性分析方法,并对移动车辆电话通信系统实例进行了分析。

关键词: 移动网,移动系统,可达树,算法

Abstract: With the fast development of computer technology and network communication technology,process algebra,Petri net and other formal analysis methods were proposed for concurrent distributed systems.Due to the emergence and rapid development of the mobile internet in recent years,pi calculus is developed by adding mobility to process algebra,and at the same time,Petri nets field also uses predicate/transition net and color net to model the mobile system.But there still exist some weakness of them.Based on all previous works,A.Asperti and N.Busi proposed mobile net.Mobile net is obtained by adding mobility to Petri net and combining with the strengths of process algebra.It is suitable for the description of mobile computing system.However,no corresponding analysis method of mobile net has been developed now.Hence,this paper studied the analysis method for mobile net.The construct algorithm of the reachability tree of mobile net was proposed,and the reachability analysis method based on its reachability tree was provided.In addition,an example of the mobile vehicle telephone communication system was illustrated to demonstrate the effectiveness of this method.

Key words: Mobile net,Mobile system,Reachability tree,Algorithm

张瑞华,杨茹,丁志军. 移动网可达树[J]. 计算机科学, 2016, 43(11): 55-60. https://doi.org/10.11896/j.issn.1002-137X.2016.11.010

ZHANG Rui-hua, YANG Ru and DING Zhi-jun. Reachability Tree of Mobile Net[J]. Computer Science, 2016, 43(11): 55-60. https://doi.org/10.11896/j.issn.1002-137X.2016.11.010

参考文献

[1] Asperti A,Busi N.Mobile Petri Nets[J].Mathematical Structures in Computer Science,2009:19(6):1265-1278
[2] Berry G,Boudol G.The chemical abstract machine[J].Theoretical Computer Science,1992,6(1):217-248
[3] Du X T.Concurrent computing paradigm:CCS and calculus[J].Computer Science,2002,29(10):1-4(in Chinese) 杜旭涛.计算范型:CCS和π演算[J].计算机科学,2002,29(10):1-4
[4] Fournet C,Gonthier G.The reflexive cham and the join-calculus[C]∥Proceedings of the 23rd Symposium on Principles of Programming Languages.1996:372-385
[5] Jensen K.Coloured Petri Nets[M].EATCS Monographs in Com-puter Science,SpringerVerlag,1992:10-110
[6] Peterson J L.Petri Net Theory and the Modeling of Systems[M].Englewood Cliffs,NJ:Prentice-Hall,1981
[7] Milner R,Parrow J,Walker D.A calculus of mobile processes[J].Information and Computation,1992,0(1):1-77
[8] Montanari U,Rossi F.Contextual nets[J].Acta Inf.,1995,2(6):545-596
[9] Reisig W.An Introduction to Petri Nets[M].EATCS Mono-graphs in Computer Science,SpringerVerlag,1985:1-164
[10] Robin Milner.Communicating and mobile systems:the pi-calculus[M].Cambridge,the University of Cambridge,1999:82-85
[11] Sangiorgi D.Expressing Mobility in Process Algebra[D].University of Edin-burgh,1993
[12] Aggarwal S,Pathak H.Modelling of hierarchical location ma-nagement schemes to locate mobile multi agents using colored Petri Net[M].Computer Engineering and Applications,2015:821-825
[13] Wolfgang Reisig:Understanding Petri Nets[M].Springer Verlag,2013:13-23
[14] 吴哲辉.Petri网导论[M].北京,2006:47-193

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed

移动网可达树

Reachability Tree of Mobile Net

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

Metrics

本文评价

推荐阅读 0