Journal of Shanghai Jiaotong University ›› 2011, Vol. 45 ›› Issue (07): 980-984.

• Automation Technique, Computer Technology • Previous Articles     Next Articles

Representing Bounded Petri Nets by Process Calculi

 DONG  Zhen-Hua-a, b , DONG  Xiao-Ju-a, b   

  1. (a.BASICS, Department of Computer Science; b.MOEMS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiaotong University, Shanghai 200240, China)
  • Received:2010-07-18 Online:2011-07-29 Published:2011-07-29

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 relation between nets.

Key words: Petri nets, process calculi, encoding

CLC Number: