期刊文献+

Inference systems for observation equivalences in the π-calculus

Inference systems for observation equivalences in the π-calculus
原文传递
导出
摘要 Inference systems for observation equivalences in the pi-calculus with recursion are proposed, and their completeness over the finite-control fragment with guarded recursions are proven. The inference systems consist of inference rules and equational axioms. The judgments are conditional equations which characterise symbolic bisimulations between process terms. This result on the one hand generalises Milner’s complete axiomatisation of observation equivalence for regular CCS to the pi-calculus, and on the other hand extends the proof systems of strong bisimulations for guarded regular pi-calculus to observation equivalences. Inference systems for observation equivalences in the pi-calculus with recursion are proposed, and their completeness over the finite-control fragment with guarded recursions are proven. The inference systems consist of inference rules and equational axioms. The judgments are conditional equations which characterise symbolic bisimulations between process terms. This result on the one hand generalises Milner’s complete axiomatisation of observation equivalence for regular CCS to the pi-calculus, and on the other hand extends the proof systems of strong bisimulations for guarded regular pi-calculus to observation equivalences.
作者 林惠民
出处 《Science China(Technological Sciences)》 SCIE EI CAS 1999年第6期657-669,共13页 中国科学(技术科学英文版)
基金 Project supported by the National Natural Science Foundation of China (Grant No. 69683003) and the Chinese Academy of Sciences.
关键词 INFERENCE SYSTEM EQUIVALENCE π-calculus. inference system equivalence π-calculus
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部