Finite Axiomatization for Symbolic Probabilistic π-Calculus
Finite Axiomatization for Symbolic Probabilistic π-Calculus作者机构:Department of Computer Science and EngineeringShanghai Jiaotong University
出 版 物:《Journal of Shanghai Jiaotong university(Science)》 (上海交通大学学报(英文版))
年 卷 期:2009年第14卷第5期
页 面:536-541页
核心收录:
学科分类:07[理学] 08[工学] 0701[理学-数学] 070101[理学-基础数学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:the National Basic Research Program (973) of China (No.2003CB317005) the National Nature Science Foundation of China (Nos.60573002 and 60703033)
主 题:probabilistic process calculus axiomatization symbolic bisimulation
摘 要:This paper focuses on the problem of seeking complete axiomatization for finite processes in the process calculus called symbolic probabilistic π-calculus introduced by Wu,Palamidessi and *** provide inference systems for both strong and weak symbolic probabilistic bisimulations and also prove their soundness and *** is the first work,to our knowledge,that provides complete axiomatization for symbolic probabilistic bisimulations in the presence of both nondeterministic and probabilistic choice.