Petri nets semantics ofπ-calculus  

作　　者：Zhenhua YU Yuanli CAI Haiping XU 

机构地区：[1]School of Electronic and Information Engineering,Xi’an Jiaotong University,Xi’an 710049,China [2]The 205th Institute of China Ordnance Industry Corporation Group,Xi’an 710065,China [3]Department of Computer and Information Science,University of Massachusetts Dartmouth,North Dartmouth,MA 02747,USA

出　　处：《Frontiers of Electrical and Electronic Engineering in China》2008年第3期290-294,共5页中国电气与电子工程前沿（英文版）

摘　　要：As π-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools,it is translated into Petri nets.π-calculus is divided into basic elements,sequence,concurrency,choice and recursive modules.These modules are translated into Petri nets to construct a complicated system.Petri nets semantics for π-calculus visualize system structure as well as system behaviors.The structural analysis techniques allow direct qualitative analysis of the system properties on the structure of the nets.Finally,Petri nets semantics for π-calculus are illustrated by applying them to mobile telephone systems.

关 键 词：Petri nets Π-CALCULUS CONCURRENCY structual characteristics ANALYSIS 

分 类 号：O17[理学—数学]