摘要
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 Lin.We provide inference systems for both strong and weak symbolic probabilistic bisimulations and also prove their soundness and completeness.This is the first work,to our knowledge,that provides complete axiomatization for symbolic probabilistic bisimulations in the presence of both nondeterministic and probabilistic choice.
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 Lin. We provide inference systems for both strong and weak symbolic probabilistic bisimulations and also prove their soundness and completeness. This is the first work, to our knowledge, that provides complete axiomatization for symbolic probabilistic bisimulations in the presence of both nondeterministic and probabilistic choice.
基金
the National Basic Research Program (973) of China (No.2003CB317005)
the National Nature Science Foundation of China (Nos.60573002 and 60703033)
