Local Synchronization on Asynchronous Tissue P Systems With Symport/Antiport Rules

被引:14
|
作者
Pan, Linqiang [1 ]
Alhazov, Artiom [2 ]
Su, Housheng [1 ]
Song, Bosheng [3 ]
机构
[1] Huazhong Univ Sci & Technol, Key Lab Image Informat Proc & Intelligent Control, Sch Artificial Intelligence & Automat, Wuhan 430074, Peoples R China
[2] Vladimir Andrunachievici Inst Math & Comp Sci, MD-2028 Kishinev, Moldova
[3] Hunan Univ, Coll Informat Sci & Engn, Changsha 410082, Peoples R China
基金
中国国家自然科学基金;
关键词
Bio-inspired computing; membrane computing; tissue P system; asynchronization; local synchronization; MINIMAL SYMPORT/ANTIPORT; EFFICIENCY; DIVISION; POWER;
D O I
10.1109/TNB.2020.2973332
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Asynchronous tissue P systems with symport/antiport rules are a class of parallel computing models inspired by cell tissue working in a non-synchronized way, where the use of rules is not obligatory, that is, at a computation step, an enabled rule may or may not be applied. In this work, the notion of local synchronization is introduced at three levels: rules, channels, and cells. If a rule in a locally synchronous set of rules (resp., cells or channels) is used, then all enabled rules in the same locally synchronous set of rules (resp., whose involved channels or cells) should be applied in a maximally parallel manner and the implementation of these rules is finished in one computation step. The computational power of local synchronization on asynchronous tissue P systems with symport/antiport rules at the three levels is investigated. It is shown that asynchronous tissue P systems with symport/antiport rules and with locally synchronous sets of rules, channels, or cells are all Turing universal. By comparing the computational power of asynchronous tissue P systems with or without local synchronization, it can be found that the local synchronization is a useful tool to achieve a desired computational power.
引用
收藏
页码:315 / 320
页数:6
相关论文
共 50 条
  • [31] On the size of P systems with minimal symport/antiport
    Vaszil, G
    [J]. MEMBRANE COMPUTING, 2004, 3365 : 404 - 413
  • [32] Symport/antiport P systems with three objects are universal
    Paun, G
    Pérez-Jiménez, MJ
    Pazos, J
    Rodríguez-Patón, A
    [J]. FUNDAMENTA INFORMATICAE, 2005, 64 (1-4) : 353 - 367
  • [33] Generating Languages by P Systems with Minimal Symport/Antiport
    Alhazov, Artiom
    Rogozhin, Yurii
    [J]. COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2006, 14 (03) : 299 - 323
  • [34] P systems with symport/antiport simulating counter automata
    Pierluigi Frisco
    Hendrik Jan Hoogeboom
    [J]. Acta Informatica, 2004, 41 : 145 - 170
  • [35] Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division
    Song, Bosheng
    Perez-Jimenez, Mario J.
    Pan, Linqiang
    [J]. BIOSYSTEMS, 2015, 130 : 51 - 58
  • [36] On symport/antiport P systems with a small number of objects
    Ibarra, Oscar H.
    Woodworth, Sara
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2006, 83 (07) : 613 - 629
  • [37] P systems with symport/antiport simulating counter automata
    Frisco, P
    Hoogeboom, HJ
    [J]. ACTA INFORMATICA, 2004, 41 (2-3) : 145 - 170
  • [38] The computational power of monodirectional tissue P systems with symport rules
    Song, Bosheng
    Huang, Shengye
    Zeng, Xiangxiang
    [J]. INFORMATION AND COMPUTATION, 2021, 281
  • [39] Simulating counter automata by P systems with symport/antiport
    Frisco, P
    Hoogeboom, HJ
    [J]. MEMBRANE COMPUTING, 2003, 2597 : 288 - 301
  • [40] On the power of P systems with symport rules
    Martín-Vide, C
    Paun, A
    Paun, G
    [J]. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2002, 8 (02): : 317 - 331