Survey on bigraph and its applications

被引：0
|
作者：
Xu D. [1 ]
Wang J.-J. [1 ]
Li J. [1 ]
机构：
[1] School of Computer Engineering and Science, Shanghai University, Shanghai
来源：
Ruan Jian Xue Bao/Journal of Software | 2016年 / 27卷 / 02期
关键词：
Bigraph; Bigraphical application; Bigraphical category; Bigraphical reactive system; Category theory;
D O I：
10.13328/j.cnki.jos.004939
中图分类号：
学科分类号：
摘要：
Bigraph was proposed by Robin Milner in 2001 as a formal theoretical model based on graphs in attempt to provide a design, simulation and analysis platform for ubiquitous computing and present a unified, extensible framework for the existing process algebra. In this paper first introduces the basic concepts of bigraph and reveals relationships among precategory, category, s-category and symmetric partial monoidal category which form the mathematical basis of bigraph, and then summarizes bigraphical algebra system while providing a simplified representation of the discrete normal form in bigraph with a proof. Next, it discusses some questions related to the definition of bigraphical categories and quotient translations after making a survey of the development of bigraph and its applications. This study argues that bigraphical category should be small category other than large category. Moreover, the paper illustrates how to convert the large category derived by quotient to small category. Finally, it outlines the extensions of bigraphical models and their applications. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：195 / 208
页数：13
相关论文
共 58 条
  • [1] Milner R., Bigraphical reactive systems, Proc. of the 12th Int'l Conf. on Concurrency Theory, pp. 16-35, (2001)
  • [2] Milner R., A calculus of communicating systems, Lecture Notes in Computer Science, 92, (1980)
  • [3] Milner R., Communicating and Mobile Systems: The π-Calculus, (1999)
  • [4] Cardelli L., Gordon A.D., Mobile ambients, Theoretical Computer Science, 240, pp. 177-213, (2000)
  • [5] Milner R., Calculi for interaction, Acta Informatica, 33, 8, pp. 707-737, (1996)
  • [6] Sewell P., From rewrite rules to bisimulation congruences, Theoretical Computer Science, 274, 1, pp. 183-230, (2002)
  • [7] Leifer J.J., Milner R., Deriving bisimulation congruences for reactive systems, Proc. of the 11th Int'l Conf. on Concurrency Theory (CONCUR 2000), pp. 243-258, (2000)
  • [8] Leifer J., Operational congruences for reactive systems, (2001)
  • [9] Cattani G.L., Leifer J.J., Milner R., Contexts and embeddings for closed shallowaction graphs, Technical Report, (2000)
  • [10] Sassone V., Sobocinski P., Deriving bisimulation congruences: A 2-categorical approach, Electronic Notes in Theoretical Computer Science, 68, 2, pp. 105-123, (2002)
123456