• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Lü Jianghua and Ma Shinglong. A Denotational Semantic Description for Safe Ambient Calculus[J]. Journal of Computer Research and Development, 2009, 46(10): 1743-1749.
Citation: Lü Jianghua and Ma Shinglong. A Denotational Semantic Description for Safe Ambient Calculus[J]. Journal of Computer Research and Development, 2009, 46(10): 1743-1749.

A Denotational Semantic Description for Safe Ambient Calculus

More Information
  • Published Date: October 14, 2009
  • Since computation under network involves variants, complicated information and behaviors, it is difficult to give denotational semantic description for computing under network. As a kind of network computing model, Ambient calculus contributes to modeling mobility and distributed features of network computing. Researches on its semantics description are mostly based on reduction rules. These descriptions are brief, but based on them it is indeterminable and has disadvantage in system design and direct implementation. On the other hand, these works mostly focus on describing variants behaviors of Ambient calculus in one level, which makes it complicated to understand clearly how these variants behaviors work and how they work together. As a result, based on the unit ambient of Ambient calculus, a three-level semantics description framework is given for Ambient calculus. The three levels are: internal level of ambient, ambient level, and system level. For each of these three levels, the syntax and semantics of its behaviors is defined in detail, and the transformation relation functions between each two levels are given. In order to specify how the framework works, a practical example is given based on this framework in three levels. Finally, proof is shown to prove the correctness of this semantic framework. This layered semantics description may help users analyze behaviors of computing in Ambient calculus and understand the implementation of ambient practical systems.
  • Related Articles

    [1]Hu Jun, Chen Yan, Zhang Qinghua, Wang Guoyin. Optimal Scale Selection for Generalized Multi-Scale Set-Valued Decision Systems[J]. Journal of Computer Research and Development, 2022, 59(9): 2027-2038. DOI: 10.7544/issn1000-1239.20210196
    [2]Wang Nian, Peng Zhenghong, Cui Li. EasiFFRA: A Fast Feature Reduction Algorithm Based on Neighborhood Rough Set[J]. Journal of Computer Research and Development, 2019, 56(12): 2578-2588. DOI: 10.7544/issn1000-1239.2019.20180541
    [3]Xie Qin, Zhang Qinghua, Wang Guoyin. An Adaptive Three-way Spam Filter with Similarity Measure[J]. Journal of Computer Research and Development, 2019, 56(11): 2410-2423. DOI: 10.7544/issn1000-1239.2019.20180793
    [4]Wu Weizhi, Yang Li, Tan Anhui, Xu Youhong. Granularity Selections in Generalized Incomplete Multi-Granular Labeled Decision Systems[J]. Journal of Computer Research and Development, 2018, 55(6): 1263-1272. DOI: 10.7544/issn1000-1239.2018.20170233
    [5]Yao Sheng, Xu Feng, Zhao Peng, Ji Xia. Intuitionistic Fuzzy Entropy Feature Selection Algorithm Based on Adaptive Neighborhood Space Rough Set Model[J]. Journal of Computer Research and Development, 2018, 55(4): 802-814. DOI: 10.7544/issn1000-1239.2018.20160919
    [6]Fu Zhiyao, Gao Ling, Sun Qian, Li Yang, Gao Ni. Evaluation of Vulnerability Severity Based on Rough Sets and Attributes Reduction[J]. Journal of Computer Research and Development, 2016, 53(5): 1009-1017. DOI: 10.7544/issn1000-1239.2016.20150065
    [7]Duan Jie, Hu Qinghua, Zhang Lingjun, Qian Yuhua, Li Deyu. Feature Selection for Multi-Label Classification Based on Neighborhood Rough Sets[J]. Journal of Computer Research and Development, 2015, 52(1): 56-65. DOI: 10.7544/issn1000-1239.2015.20140544
    [8]Hu Xiaojian, Yang Shanlin, Hu Xiaoxuan, Fang Fang. Optimal Decomposition of Decision Table Systems Based on Bayesian Networks[J]. Journal of Computer Research and Development, 2007, 44(4): 667-673.
    [9]Wei Lai, Miao Duoqian, Xu Feifei, and Xia Fuchun. Research on a Covering Rough Fuzzy Set Model[J]. Journal of Computer Research and Development, 2006, 43(10): 1719-1723.
    [10]Yi Gaoxiang and Hu Heping. A Web Search Result Clustering Based on Tolerance Rough Set[J]. Journal of Computer Research and Development, 2006, 43(2): 275-280.

Catalog

    Article views (759) PDF downloads (421) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return