期刊文献+

复制受限的环境演算中模态逻辑的内涵性

Intensionality of Modal Logic for Ambient Calculus with Restricted Replication
下载PDF
导出
摘要 环境演算(MA)的模态逻辑AL进行了研究.在考虑了复制操作和限制操作的情况下,提出了逻辑等价的协归纳操作描述,并利用协归纳关系与进程结构同余关系进行比较,证明了若对MA加上约束条件得到子集MAsynIF,此时逻辑等价(=L)与结构同余关系是等价的,即AL在MAsynIF中是内涵的.同时发现由于复制操作的存在,AL的内涵性受到了影响,使得AL的区分能力被削弱,但通过对复制公式的构造验证了AL的表达能力. The Ambient Logic(AL) that has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients(MA) has been researched. In details, in MA with replication operator and restrication operator, we gived the coinductive characterisations of the logic equivalence(=_L), and compared =_L with the structural congruence(≡). As a result, when in , subset of MA, obtained by imposing constraints on MA, AL is intensional because =L is equivalent with ≡. Due to the presence of replication operator, the intensionality of AL has been influenced and its separability has been weaken, but according to the construction of characteristic formulas the expressiveness of AL has been proved.
出处 《武汉大学学报(理学版)》 CAS CSCD 北大核心 2004年第5期595-600,共6页 Journal of Wuhan University:Natural Science Edition
基金 国家重点基础研究发展规划973项目资助(2002CB312002) 国家自然科学基金资助项目(60273034) 江苏省自然科学基金资助项目(BK2002203 BK2002409)
关键词 移动计算 进程代数 移动环境演算 模态逻辑 内涵性 同余关系 mobile computation process algebra mobile ambient modal logic intensionality
  • 相关文献

参考文献11

  • 1Cardelli L, Gordon AD. Mobile ambient[J]. Theoretical Computer Science,2000,240(1):177-213.
  • 2Milner R, Parrow J, Walker D. A Calculus of Mobile Process, Part Ⅰ/Ⅱ[J]. Journal of Information and Computation,1992,100:1-77.
  • 3Cardelli L, Gordon AD.Anytime, Anywhere: Modal Logic for Mobile Ambients[A]. In Proc. 27th POPL'00[C]. Boston, Massachusetts: ACM Press,2000. 365-377.
  • 4Cardelli L, Gordon AD. Logical Properties of Name Restriction[J]. Lecture Notes in Computer Science,2001,2044:46-60.
  • 5Sangiorgi D. Extensionality and Intensionality of the Ambient Logic[J]. In Proc of 28th POPL'01[M]. London: ACM Press, 2001. 4-17.
  • 6Hirschkoff D, Lozes E, Sangiorgi D.Separability, Expressiveness, and Decidability in the Ambient Logic[A]. In Proceedings of the 17th IEEE Symposium on Logic in Computer Science[C]. Copenhagen, Danmark: IEEE, 2002.423-432.
  • 7Chen Tao-lue, Han Ting-ting, lu Jian. Intensionality of Modal Logic for Robust Ambient Calculus[J]. Electronic Notes in Theoretical Computer Science,2003,85(1):50-64.
  • 8Berry G,Boudol G. The Chemical Abstract Machine[J]. Theoretical Computer Science,1992,96(1):217-248.
  • 9Howe DJ. Proving Congruence of Bisimulation in Functional Programming Languages[J]. Information and Computation,1996,124(2):103-112.
  • 10Graf S, Sifakis J. A Modal Characterization of Observational Congruence on Finite Terms of CCS[J]. Information and Control,1986,68:125-145.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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