γ演算到Action演算的转换
作者:
基金项目:

(Supported by the National Natural Science Foundation of China under Grant No.60073041 (国家自然科学基金)


Translating γ-Calculus into Action Calculus
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [11]
  • |
  • 相似文献
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    Action演算簇(action calculi)作为描述不同并发交互行为的数学框架,可以表示一大类具有某些相同特性的并发形式化模型.试图把(演算(一种基于约束的高阶并发计算模)也包含在action演算簇的框架下.首先定义了一个具体的action演算AC(Kγ),然后给出了从(演算到AC(Kγ)转换的形式描述,最后在定义AC(Kγ)的可观察性、弱互模拟关系和弱等价关系的基础上,以(演算为中间表示,证明了这种转换保持了(演算的弱行为等价性.研究表明,action演算簇可以表示基于约束的并发模型,从而充分说明了action演算簇的描述能力,并且为在action演算簇框架下把(演算与其他并发模型结合并进行比较提供了前提.

    Abstract:

    Action calculi is introduced as a mathematical framework for expressing different interactive behaviors, which shows the advantages in representing different interactive models with some common features. In this paper, action calculi is used to include γ-calculus (a computational calculus for higher-order concurrent programming) in its setting. First, a concrete action calculus AC(Kγ) is defined. Then the formal compositional translation of the γ-calculus into AC(Kγ) is presented. Finally, upon definitions of the observability, the weak barbed bisimularity as well as the weak barbed congruence for AC(Kγ), it is proved that such translation preserves the weak behavioural equivalence of the γ-calculus with the π-calculus as intermediate. This work not only shows the expressiveness of action calculi, but also provides precondition for uniting and comparing γ-calculus with other concurrent models under the theory of action calculi.

    参考文献
    [1]Milner R. Action calculi, or concrete action structures. In: Borzyszkowski AM, Sokolowski S, eds. Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science. LNCS 711, Berlin: Springer-Verlag, 1993. 105~121.
    [2]Milner R. Calculi for interaction. Acta Informatica, 1996,33(8):707~737.
    [3]Gardner P, Hasegawa M. Higher-Order and reflexive action calculi: their type theory and models. 1998. http://www.cl.cam.ac.uk/ users/pag20/horac.ps.gz.
    [4]Barber A, Gardner P, Hasegawa M, Plotkin G. From action calculi to linear logic. In: Nielsen M, Thomas W, eds. Computer Science Logic, Proceedings of the 11th International Workshop (CSL'97). LNCS 1414, Berlin: Springer-Verlag, 1998. 78~97.
    [5]Gadducci F, Montanari U. Comparing action calculi and tile logic: on the operational semantics of p-calculus. 1999. http://www.dsi. unive.it/~lopstr99/W40/PS/gadducci.pdf.
    [6]Gardner P, Wischik L. Explicit fusions. In: Nielson M, Rovan B, eds. Proceedings of the 25th International Symposium, Mathematical Foundations of Computer Science 2000. LNCS 1893, Berlin: Springer-Verlag, 2000. 373~383.
    [7]Leifer J. Operational congruences for reactive systems [Ph.D. Thesis]. Computer Laboratory, University of Cambridge, 2001.
    [8]Gardner P, Milner R, Sewell P. Calculi for interactive systems: theory and experiment. 2001. http://www.doc.ic.ac.uk/~pg/ final2001.html.
    [9]Smolka G. A foundation for higher-order concurrent constraint programming. Research Report, RR-94-16, Saarbrücken: The German Research Center for Artificial Intelligence GmbH (DFKI), 1994.
    [10]Henz M, Mehl M, Müller M, Müller T, Niehren J, Scheidhauer R, Schulte C, Smolka G, Treinen R, Würtz J. The Oz Handbook. Saarbrücken: The German Research Center for Artificial Intelligence GmbH (DFKI), 1994.
    [11]Victor B, Parrow J. Constraints as processes. In: Montanari U, Sassone V, eds. Proceedings of the CONCUR'96: Concurrency Theory. LNCS 1119, Berlin: Springer-Verlag, 1996. 389~405.
    相似文献
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

金英,金成植.γ演算到Action演算的转换.软件学报,2003,14(1):16-22

复制
分享
文章指标
  • 点击次数:3768
  • 下载次数: 5009
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2001-06-29
  • 最后修改日期:2001-12-27
文章二维码
您是第19868195位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号