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

### 移动网可达树

1. 同济大学嵌入式系统与服务计算教育部重点实验室 上海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: 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.

 [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
 No related articles found!
Viewed
Full text

Abstract

Cited

Shared
Discussed
 [1] 雷丽晖,王静. 可能性测度下的LTL模型检测并行化研究[J]. 计算机科学, 2018, 45(4): 71 -75, 88 . [2] 夏庆勋,庄毅. 一种基于局部性原理的远程验证机制[J]. 计算机科学, 2018, 45(4): 148 -151, 162 . [3] 厉柏伸,李领治,孙涌,朱艳琴. 基于伪梯度提升决策树的内网防御算法[J]. 计算机科学, 2018, 45(4): 157 -162 . [4] 王欢,张云峰,张艳. 一种基于CFDs规则的修复序列快速判定方法[J]. 计算机科学, 2018, 45(3): 311 -316 . [5] 孙启,金燕,何琨,徐凌轩. 用于求解混合车辆路径问题的混合进化算法[J]. 计算机科学, 2018, 45(4): 76 -82 . [6] 张佳男,肖鸣宇. 带权混合支配问题的近似算法研究[J]. 计算机科学, 2018, 45(4): 83 -88 . [7] 伍建辉,黄中祥,李武,吴健辉,彭鑫,张生. 城市道路建设时序决策的鲁棒优化[J]. 计算机科学, 2018, 45(4): 89 -93 . [8] 刘琴. 计算机取证过程中基于约束的数据质量问题研究[J]. 计算机科学, 2018, 45(4): 169 -172 . [9] 钟菲,杨斌. 基于主成分分析网络的车牌检测方法[J]. 计算机科学, 2018, 45(3): 268 -273 . [10] 史雯隽,武继刚,罗裕春. 针对移动云计算任务迁移的快速高效调度算法[J]. 计算机科学, 2018, 45(4): 94 -99, 116 .