首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有界Petri网的进程演算表达
引用本文:董振华,董笑菊.有界Petri网的进程演算表达[J].上海交通大学学报,2011,45(7):980-984.
作者姓名:董振华  董笑菊
作者单位:(上海交通大学 a.计算机科学与工程系BASICS实验室; b.智能计算与智能系统教育部 微软重点实验室, 上海 200240)
基金项目:国家自然科学基金资助项目(60873034); 上海市自然基金资助项目(10ZR1416800)
摘    要:为了进一步探讨Petri网与进程演算的关系,给出了一种使用进程演算模型(CCS)表示有界Petri网的方法.对于任意的有界Place/Transition网,可以用该方法构建一个与之相对应的有限进程.并且证明了所得进程与原网之间满足操作一致性和观察一致性.同时,证明了该方法在网的标号互模拟上满足完全抽象性.

关 键 词:Petri网    进程演算    编码  
收稿时间:2010-07-18

Representing Bounded Petri Nets by Process Calculi
DONG Zhen-huaa,b,DONG Xiao-jua,b.Representing Bounded Petri Nets by Process Calculi[J].Journal of Shanghai Jiaotong University,2011,45(7):980-984.
Authors:DONG Zhen-huaa  b  DONG Xiao-jua  b
Institution:(a.BASICS, Department of Computer Science; b.MOE MS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiaotong University, Shanghai 200240, China)
Abstract:A formal encoding method was given to represent bounded Petri nets by CCS which is one kind model of process calculi for researching the relationship between Petri nets and process calculi.A Place/Transition net could be encoded to a finite process by this method.The process and the original net satisfy the operational and observational correspondence.In this view,they have the same behaviors.It shows that the encoding method is fully Abstract with respect to the labeled bisimulation,which is an equivalence...
Keywords:Petri nets  process calculi  encoding  
本文献已被 CNKI 等数据库收录!
点击此处可从《上海交通大学学报》浏览原始摘要信息
点击此处可从《上海交通大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号