动态P系统及其在自组织网络中的应用
|
摘要
目前发展最为迅速的是生物学和信息科学，这两门学科的交叉领域是分子计算。分子计算的两大主要方向是：DNA计算和膜计算，膜计算是近年来刚兴起的研究领域，凭借着膜计算的特点和现有研究中表现出来的优势，膜计算系统得到了蓬勃发展，受到众多科学家的关注，膜计算系统的研究成为国际上的一个研究热点。
膜计算系统是近几年应用研究中最广泛的一个前沿领域，是生物科学与其他自然科学交叉的产物，是一个分布式的、不确定性的、并行的、动态进化的计算机器。随着研究的深入，膜计算系统在理论研究中表现出了很强的优势，而且在生物计算、计算机科学、语言学、图形学、社会学等很多领域取得了突破性的成果，有部分研究表明膜计算系统的计算能力有超越图灵机的可能性。这些研究表明膜计算系统具有广泛的发展前景。然而在应用研究中，膜计算系统研究相对滞后，尤其是在国内，膜计算系统的潜力没有得到发挥。膜计算系统的研究侧重于系统建模，目前很多科学家将眼光转向膜计算系统的本质和应用领域。
本文受到细胞型P系统的启发，对规则进行全面研究，指出规则存在的一些弊端，从而提出动态规则及动态P系统。并且运用动态P系统解决了自组织网络中的棘手问题，如构建广播模型问题，广播算法问题。具体体现在以下三方面：
1首先从膜计算系统的基础知识，系统结构，系统运行原则，规则的利弊及改进历程等多方面整体掌握膜计算系统的发展历程。在本文中指出了传统规则存在的一些弊端，这些弊端严重限制了P系统的应用范围，从而提出动态规则及其动态P系统。并通过求解图论中最短路径的实例，展示动态P系统的灵活性和广泛的应用性。
2本文受到一种新型的仿生学思想的启发，提出一种基于动态P系统的自组织网络广播模型。在此模型中充分考虑到自组织网络中的三种现实情况，合理使用组织型P系统的通信规则，设计了一种高效的广播模型。基于P系统的广播模型有效地避免了传统广播模型存在的一些弊端，此模型在时间性能上可以达到甚至是能够超越CLBM，特别是在模拟树型拓扑结构具有很强规律的自组织网络广播时，所使用的广播时间相对更少，并且通过实验给出了证明。
3本文提出了一种基于动态P系统的自组织网络广播算法。在此系统中，转播信息的优先权是由节点间距离及邻居个数决定的，通过系统的信息数与门限值的比较减少转播节点。此系统能够适合不同密度的网络，并且具有高可达率和高转播节省率。并通过实验证明了DPBA是个可行的高效的广播算法，DP系统是个易于通信的设备，同时为解决一些分布式的、并行的棘手难题提供了新思路。
膜计算是自然计算的一个新分枝，是生物科学与其他各领域交叉的产物。目前，膜计算的研究仅处在数学模型的建立和理论研究的初级阶段，然而指导并解决各个领域中的难题以及对实现技术的研究还是很匮乏。本文的研究是在这样一个背景下展开的，本文的研究成果促进了膜计算的应用研究，并且为解决自组织网络中的棘手问题提供了新思路。
In recent years, biology and information science are the most rapid development.The crossfields of these two disciplines are molecular computing. Two main research directions ofMolecular computing are DNA computing and membrane computing. In recent years, membranecomputing is a just rise field. Because of the characteristics and showing the advantage,membrane system has developed vigorously; membrane system has become a hotspot of theinternational.
Over several years, the application of membrane system is the most widely. Membranesystem is the outcome between biological science and other natural science. The character of themembrane system is distributivity, uncertainty, concurrency, dynamic evolutionary. With thedevelopment of research, membrane system shows strong advantage in the theoretical study, andhas achieved breakthrough results in the biological calculation, computer science, linguistics,graphics, sociology and many other fields. Some research shows that the calculation ofmembrane system to be beyond Turing machines. These studies show the membrane system havebroad development prospects. However in the application study, the research of membranesystem relatively lags behind, especially in domestic, the potential of membrane system has notbeen mobilized. The research of computing systems focuses on system modeling, but manyscientists are studying the nature of membrane system for researching more widely applicationfields.
Inspired by the cell-like P systems, this paper gives a comprehensive study of the rules, andpoints out the deficiencies of the rules which seriously impact the applicable scope of the system.We propose dynamic rules and dynamic P system. Using dynamic P system can solve the toughquestions of the Self-Organizing Network. Such as it can solve the broadcasting model and thebroadcasting algorithm. The results obtained are as follows:
First we master the membrane calculation system development course by Basic knowledge,System structure, the principle of System’s operation, the advantages and disadvantages of therules and improvement process of rules. This paper gives a comprehensive study of the rules, andpoints out the deficiencies of the rules which seriously impact the applicable scope of the system.We propose dynamic rules and dynamic P system. An example that solving the shortest pathshows the dynamic P system is the flexibility of the system and wide range of application.
Sencond we present A New broadcasting Model Based on Membrane Computing Systemwhich is the principle of bionics design broadcasting model. In this model, three situations of theorganization network is fully considered, and We reasonable use communication rules of thetissue P system and are inspired by bionic thought, we design a kind of broadcasting model with high efficient. In theory, the time performance of the membrane model can reach even higherthan CLBM, especially simulation strong regularity structure of tree topology, it has moreadvantages.
The last dynamic membrane computing systems based on self-organizing networkbroadcasting algorithm is presented, In this system, the priority of the information on node isdetermined by the distance between nodes and the number of neighbors, so it suitable for variousnetwork density. According to comparative the number of information and the threshold value,cancel the right of broadcast information of node, so as to improve reachability and save morerebroadcasts. Experiment results show that this system used to broadcast is feasible and moreefficient, and it provides new ideas for solving a few distributed and parallel thorny problems.
Membrane computing is a new branch of natural computing, and is product between thebiological science and other fields. At present, the membrane system’s research focus on themathematical model and is primary stage of theoretical research, however the research of thesolving the difficult problems in all fields and technology research is very scarce.
This paper work helps the future direction of the research and incentive film the faith ofcalculation membrane system, can provide a useful tools, techniques, and models for a widespectrum of applications.
膜计算系统是近几年应用研究中最广泛的一个前沿领域，是生物科学与其他自然科学交叉的产物，是一个分布式的、不确定性的、并行的、动态进化的计算机器。随着研究的深入，膜计算系统在理论研究中表现出了很强的优势，而且在生物计算、计算机科学、语言学、图形学、社会学等很多领域取得了突破性的成果，有部分研究表明膜计算系统的计算能力有超越图灵机的可能性。这些研究表明膜计算系统具有广泛的发展前景。然而在应用研究中，膜计算系统研究相对滞后，尤其是在国内，膜计算系统的潜力没有得到发挥。膜计算系统的研究侧重于系统建模，目前很多科学家将眼光转向膜计算系统的本质和应用领域。
本文受到细胞型P系统的启发，对规则进行全面研究，指出规则存在的一些弊端，从而提出动态规则及动态P系统。并且运用动态P系统解决了自组织网络中的棘手问题，如构建广播模型问题，广播算法问题。具体体现在以下三方面：
1首先从膜计算系统的基础知识，系统结构，系统运行原则，规则的利弊及改进历程等多方面整体掌握膜计算系统的发展历程。在本文中指出了传统规则存在的一些弊端，这些弊端严重限制了P系统的应用范围，从而提出动态规则及其动态P系统。并通过求解图论中最短路径的实例，展示动态P系统的灵活性和广泛的应用性。
2本文受到一种新型的仿生学思想的启发，提出一种基于动态P系统的自组织网络广播模型。在此模型中充分考虑到自组织网络中的三种现实情况，合理使用组织型P系统的通信规则，设计了一种高效的广播模型。基于P系统的广播模型有效地避免了传统广播模型存在的一些弊端，此模型在时间性能上可以达到甚至是能够超越CLBM，特别是在模拟树型拓扑结构具有很强规律的自组织网络广播时，所使用的广播时间相对更少，并且通过实验给出了证明。
3本文提出了一种基于动态P系统的自组织网络广播算法。在此系统中，转播信息的优先权是由节点间距离及邻居个数决定的，通过系统的信息数与门限值的比较减少转播节点。此系统能够适合不同密度的网络，并且具有高可达率和高转播节省率。并通过实验证明了DPBA是个可行的高效的广播算法，DP系统是个易于通信的设备，同时为解决一些分布式的、并行的棘手难题提供了新思路。
膜计算是自然计算的一个新分枝，是生物科学与其他各领域交叉的产物。目前，膜计算的研究仅处在数学模型的建立和理论研究的初级阶段，然而指导并解决各个领域中的难题以及对实现技术的研究还是很匮乏。本文的研究是在这样一个背景下展开的，本文的研究成果促进了膜计算的应用研究，并且为解决自组织网络中的棘手问题提供了新思路。
In recent years, biology and information science are the most rapid development.The crossfields of these two disciplines are molecular computing. Two main research directions ofMolecular computing are DNA computing and membrane computing. In recent years, membranecomputing is a just rise field. Because of the characteristics and showing the advantage,membrane system has developed vigorously; membrane system has become a hotspot of theinternational.
Over several years, the application of membrane system is the most widely. Membranesystem is the outcome between biological science and other natural science. The character of themembrane system is distributivity, uncertainty, concurrency, dynamic evolutionary. With thedevelopment of research, membrane system shows strong advantage in the theoretical study, andhas achieved breakthrough results in the biological calculation, computer science, linguistics,graphics, sociology and many other fields. Some research shows that the calculation ofmembrane system to be beyond Turing machines. These studies show the membrane system havebroad development prospects. However in the application study, the research of membranesystem relatively lags behind, especially in domestic, the potential of membrane system has notbeen mobilized. The research of computing systems focuses on system modeling, but manyscientists are studying the nature of membrane system for researching more widely applicationfields.
Inspired by the cell-like P systems, this paper gives a comprehensive study of the rules, andpoints out the deficiencies of the rules which seriously impact the applicable scope of the system.We propose dynamic rules and dynamic P system. Using dynamic P system can solve the toughquestions of the Self-Organizing Network. Such as it can solve the broadcasting model and thebroadcasting algorithm. The results obtained are as follows:
First we master the membrane calculation system development course by Basic knowledge,System structure, the principle of System’s operation, the advantages and disadvantages of therules and improvement process of rules. This paper gives a comprehensive study of the rules, andpoints out the deficiencies of the rules which seriously impact the applicable scope of the system.We propose dynamic rules and dynamic P system. An example that solving the shortest pathshows the dynamic P system is the flexibility of the system and wide range of application.
Sencond we present A New broadcasting Model Based on Membrane Computing Systemwhich is the principle of bionics design broadcasting model. In this model, three situations of theorganization network is fully considered, and We reasonable use communication rules of thetissue P system and are inspired by bionic thought, we design a kind of broadcasting model with high efficient. In theory, the time performance of the membrane model can reach even higherthan CLBM, especially simulation strong regularity structure of tree topology, it has moreadvantages.
The last dynamic membrane computing systems based on self-organizing networkbroadcasting algorithm is presented, In this system, the priority of the information on node isdetermined by the distance between nodes and the number of neighbors, so it suitable for variousnetwork density. According to comparative the number of information and the threshold value,cancel the right of broadcast information of node, so as to improve reachability and save morerebroadcasts. Experiment results show that this system used to broadcast is feasible and moreefficient, and it provides new ideas for solving a few distributed and parallel thorny problems.
Membrane computing is a new branch of natural computing, and is product between thebiological science and other fields. At present, the membrane system’s research focus on themathematical model and is primary stage of theoretical research, however the research of thesolving the difficult problems in all fields and technology research is very scarce.
This paper work helps the future direction of the research and incentive film the faith ofcalculation membrane system, can provide a useful tools, techniques, and models for a widespectrum of applications.
引文
[1] Gheorghe Pǎun. Computing with Membranes [J]. Journal of Computer and System Sciences,2000, 61: 108_143.
[2] Gheorghe Pǎun, Pérez-Jiménez M.J. Fourth Brainstorming Week on Membrane Computing[J]. Theoretical Computer Science, 2007, 372(2-3): 123-124.
[3] Gheorghe Pǎun. Computing with Membranes: A Variant [J]. Institute of Mathematics of theRomanian Academy Po Box 1-764, 70700 Bucuresti, Romania.
[4] Gheorghe Pǎun. Membrane Computing [M]. Fundamentals of Computation Theory,Proceedings, 2003, 2751:284-295.
[5] A Pǎun. G. Pǎun, The Power of communication: P systems with symport/antiport [J]. NewGeneratiion Computing, 2002, 20(3):295-305.
[6] A Obtulowicz. G Pǎun. (In search of) Probabilistic P systems [J].BioSystems, 2003,70(2):107-121.
[7]张葛祥,潘林强,自然计算的新分支—膜计算[J],计算机学报,2010.33(2):208-214.
[8]黄亮.膜计算优化方法研究[D],博士学位论文.浙江大学,杭州, 2007.
[9] G Pǎun, G Rozenberg. A guide to membrane computing.Theoretical [J]. Computer Science,2002, 287(1): 73-100.
[10] G Pǎun, Y Suzuki, H Tanaka. On the Power of membrane division in P systems [J].Theoretical Computer Science, 2004, 324(1): 61-85.
[11]姜岚.最小并行使用规则的SNP系统的研究[D],硕士论文.华中科技大学,2008.
[12]付杰.受膜计算启发的优化算法研究[D],硕士论文.浙江大学，2010年.
[13] Waldemar Korczynski Pǎun’s Systems as Models of Economic Systems [J]. Progress inNatural Science Vol.17, No.4, April 2007.
[14] Gemma Bel Enguix and M. Modelling Parallel Phenomena in Conversations with P Systems[J]. Dolores Jimenez Lopez Research Group on Mthematical Linguistics Universitat Rovirai Virgili.Tarragona.Spain.2005.
[15] Oscar H Ibarra, G Pǎun. Membrane Computing: A general view [J]. Annals of EuropeanAcademy of Sciences (online edition), 2008: 83-10.
[16] Carlos Martin-Vide .Gheorghe Pǎun.Juan Pazos.Alfonso Rodriguez-Paton[J]. Tissue PSystems. Theoretical Computer Science 296 .2003: 295–326.
[17] Rudolf Freund. Gheorghe Pǎun. Mario J. Pérez-Jiménez. Tissue P systems with channelstates Theoretical [J]. Computer Science 330 .2005:101–116.
[18] Gheorghe Pǎun. Tracing Some Open Problems in Membrane Computing [J]. RomanianJournal of Information Science and Technology, 2007, 10(4):303-314.
[19] G Pǎun. Introduction to membrane computing//Proceedings of Brainstorming Workshop onUncertainty in Membrane Computing [J]. Palma de Mallorca, Espa a, 2004: 1-4.
[20] Alhazov A, Sburlan D. Static sorting algorithms for P systems//Proceedings of the Workshopon Membrane Computing [J]. Tarragona, 2003: 17-40.
[21] Ceterchi R, Martín-Vide C. P systems with communication for static sorting// Proceedingsof the Brainstorming Week on Membrane Computing [J]. Tarragona, 2003: 101-117.
[22] T. Y. Nishida. Membrane Algorithms. In Rudolf Freund, Gheorghe Pǎun, GrzegorzRozenberg, Arto Salomaa (Eds.) Membrane Computing[J]: 6th International Workshop,WMC 2005, Vienna, Austria, July 18{21, 2005, LNCS 3850, Springer-Verlag, 2006, PP.55-66.
[23] G Pǎun, R Pǎun. Membrane Computing and economics: Numerical P systems [J].Fundamenta Informaticae, 2006, 73(1-2): 213-227.
[24] T.Y.Nishida. An application of P-system: A new algorithm for NP-complete optimizationProblems//Proceedings of the 8th World Multi-Conference on Systemics [J], Cyberneticsand Informatics. Orlando, IIIS, 2004: 109-112.
[25] Leporati A, Pagani D. A membrane algorithm for the min storage Problem//Proceedings ofthe Workshop on Membrane Computing [J]. Lecture Notes in Computer Science4361.Berlin: Springer, 2006: 443-462.
[26] Huang L, Sun L, Wang N, Jin X. Multiobjective optimization of simulated moving bed bytissue P system [J]. Chinese Journal of Chemical Engineering, 2007, 15(5): 683-690.
[27] Huang L, Suh I H. Controller design for a marine diesel engine using membrane Computing[J]. International Journal of Innovative Computing Information and Control, 2009, 5(4):899-912.
[28] Bernardini F, Gheorghe M. Population P Systems.Journal of Universal ComputerSciences,2004,10(5):509-539
[29] Csuhaj-Varju E, Kelemen J, Kelemenova A, Pǎun G, Vaszil G. Computing with cells inenvironment: P colonies. Journal of Multiple-Valued Logic and SoftComputig,2006,12(3-4):201-215
[30] Freund R, Oswald M. P colonies working in the maximally Parellel and in the sequentialmode//Proceedings of 7th international Symposium on Symbolic and Numeric Algorithmsfor Scientific Computing, Timisoara, Romania,2005:419-426
[31] Kelemen J, Kelemenova A, Pǎun G. On the Power of a biochemically inspired simpleComputing model P colonies//Proceedings of the Workshop on Artificial Chemistry and ItsApplications. Boston, ECSL, 2005:82-86
[32] S.N.Krishna, A.Pǎun.Three universality results on P systems[C].In: First BrainstormingWeek on Membrane Computing, 2003:198-206.
[33] P.Sosik.About P systems with symport/antiport[C].In: Second Brainstorming Week onMembrane Computing, 2004:224-236.
[34] A.Atanasiu.Arithmetic with membranes [J].Romanian Journal of Information Science andTechnology, 2001, 4(1-2):5-20.
[35] C.Bonchis, G.Ciobanu, C.Izbasa.Encodings and arithmetic operations in membraneComputing[C].In: Theory and Applications of Models of Computation, LNCS, Springer,2006, 3959:618-627.
[36] P.Guo, J.Chen.Arithmetic operation in membrane system[C].In: the Proceedings ofInternational Conference on BioMedical Engineering and Informatics, 2008:231-234.
[37] P.Guo, H.Zhang.Arithmetic operation in single membrane[C].In: the Proceedings ofInternational Conference on Computer Science and Software Engineering, 2008:532-535.
[38] P.Guo,M.Luo.Signed numbers arithmetic operation in multi-membrane[C].In theProceedings of International Conference on Information Science andEngineering,2009:393-396.
[39] M.J.Pérez-Jiménez, A.Riscos-Núez.A linear time solution to the Knapsack Problem usingactive membranes[C].In: Membrane Computing, LNCS, Springer, Heidelberg, 2004,2933:250-268.
[40] A.LePorati, D.Pagani. A membrane algorithm for the min storage Problem[C].In:Proceedings of the Workshop on Membrane Computing, LNCS, Berlin, Springer, 2006,4361:
[41] T.Y.Nishida.Membrane algorithms: an approximate algorithm for NP-complete optimizationProblems exploiting P systems [M].In: Application of Membrane Computing, Springer,Berlin, 2006:303-314.
[42] M.A.Gutiérrez-Naranjo, M.J.Pérez-Jiménez, and F.J.Romero-Campero.A uniform solutionto SAT using membrane creation [J] .Theoretical Computer Science, 2007, 371(1-2):54-61.
[43] M.A.Gutiérrez-Naranjo, M.J.Pérez-Jiménez, A.Riscos-Núez. A fast P system for finding abalanced 2-Partition [J].Soft Computing, 2005, 9(9):673-678.
[44] L.Pan, A.Alhazov.Solving HPP and SAT by P systems with active membranes andseparation rules [J].Acta Informatica, 2006, 43(2):131-145.
[45] M.A.Gutierrez-Naranjo, M.J.PerezeJimenez, A.Riscos-Nunez.Available membraneComputing software [M]. In: Application of Membrane Computing, Springer, Berlin,2006:411-436.
[46] M. Garcia-Quismondo, R. Gutierrez-Escudero, M. A. Martinez-Del-Amor, E.Orejuela-Pinedo, I. Perez-Hurtado. P-Lingua2.0: A software framework for cell-like Psystems [J].International Journal of Computers Communications&Control, 2009,4(3):234-243.
[47] L.Bianco, A.Castellini. Psim:A comPutational Platform for metabolic P systems[C].In:Proceedings of the International Workshop on Membrane Computing, LNCS,Springer-Verlag, Berlin, 2007, 4860:199-208.
[48] B.Daniela, C.Paolo, et al...Modelling metapopulations with stochastic membrane systems[J]. Biosystem, 2008, 91(3):499-514.
[49] G.Enguix, M.D.JiménezLópez.Linguistic membrane systems and applications [M].In:Application of Membrane Computing, Springer, Berlin, 2006:347-388.
[50] L.Bianco, F.Fontana, V.Manca.P systems with reaction maPs [J].International Journal ofFndamental Computation, 2006, 17(1):27-48.
[51] F.Bernardini, M.Gheorghe, N.Krasnogor, et al.On P systems as a modeling tool forbiological systems[C].LNCS, 2006, 3850:114-133.
[52] F.Bernardini, M.Gheorghe.Cell communication in tissue P systems: Universality results[J].Soft Computing, 2005, 9(9):640-649.
[53] R.Freund, Gh.Pǎun, M.J.Pérez-Jiménez. Tissue P systems with channel states [J].Theoretical Computer Science, 2005, 330(1):101-116.
[54] D.Diaz-Pernil,A.Miguel,et al.A uniform family of tissue P systems with cell divisionsolving 3-COL in a linear time[J].Theoretical Computer Seience,2008,404(l-2):76-87.
[55] S.Annadurai, T.Kalyani, et al.P systems generating ISO-Picture languages [J].Process inNatural Science, 2008, 18(5):617-622.
[56] Gh.Pǎun.Tracing some open Problems in membrane Computing [J].Romanian Journal ofInformation Science and Technology, 2007, 10(4):303-314.
[57]张兴义,曾湘祥,潘林强,罗斌.脉冲神经膜系统求解任意两个自然数的乘积[J].计算机学报,2009,32(12):2362-2372.
[58] T.Ishdorj, A.Leporati.Uniform solutions to SAT and 3-SAT by spiking neural P systems withPre-computed resources [J].Natural Computing, 2008, 7(4):519-534.
[59] A.Leporati, M.A.Gutierrez-Naranjo.Solving SUBSET/SUM by spiking neural P systemswith Pre-computed resources [J].Fundamenta Informaticae, 2008, 87:61-77.
[60]张兴义.脉冲神经膜系统的计算能力研究[D].武汉:华中科技大学,2009.
[61]刘沙沙,窦全胜,伏开磊.基于动态膜计算系统的自组织网络广播算法[J].计算机应用研究, 2012.
[62] Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino. Shermer. NonadaptiveBroadcasting in Trees [J]. Networks. 2011, 57(2):157-168.
[63]胡宁宁等.智能表广播模型[J].计算机学报.1999, 22(8).
[64]刘沙沙,窦全胜,伏开磊.基于膜计算系统的广播模型[J],计算机工程, 2012(待见刊).
[65]周伯生,吴介一,费翔.一种适合于无线网络的竞争广播算法[J].电子学报,2003,31(2):280-283.
[2] Gheorghe Pǎun, Pérez-Jiménez M.J. Fourth Brainstorming Week on Membrane Computing[J]. Theoretical Computer Science, 2007, 372(2-3): 123-124.
[3] Gheorghe Pǎun. Computing with Membranes: A Variant [J]. Institute of Mathematics of theRomanian Academy Po Box 1-764, 70700 Bucuresti, Romania.
[4] Gheorghe Pǎun. Membrane Computing [M]. Fundamentals of Computation Theory,Proceedings, 2003, 2751:284-295.
[5] A Pǎun. G. Pǎun, The Power of communication: P systems with symport/antiport [J]. NewGeneratiion Computing, 2002, 20(3):295-305.
[6] A Obtulowicz. G Pǎun. (In search of) Probabilistic P systems [J].BioSystems, 2003,70(2):107-121.
[7]张葛祥,潘林强,自然计算的新分支—膜计算[J],计算机学报,2010.33(2):208-214.
[8]黄亮.膜计算优化方法研究[D],博士学位论文.浙江大学,杭州, 2007.
[9] G Pǎun, G Rozenberg. A guide to membrane computing.Theoretical [J]. Computer Science,2002, 287(1): 73-100.
[10] G Pǎun, Y Suzuki, H Tanaka. On the Power of membrane division in P systems [J].Theoretical Computer Science, 2004, 324(1): 61-85.
[11]姜岚.最小并行使用规则的SNP系统的研究[D],硕士论文.华中科技大学,2008.
[12]付杰.受膜计算启发的优化算法研究[D],硕士论文.浙江大学，2010年.
[13] Waldemar Korczynski Pǎun’s Systems as Models of Economic Systems [J]. Progress inNatural Science Vol.17, No.4, April 2007.
[14] Gemma Bel Enguix and M. Modelling Parallel Phenomena in Conversations with P Systems[J]. Dolores Jimenez Lopez Research Group on Mthematical Linguistics Universitat Rovirai Virgili.Tarragona.Spain.2005.
[15] Oscar H Ibarra, G Pǎun. Membrane Computing: A general view [J]. Annals of EuropeanAcademy of Sciences (online edition), 2008: 83-10.
[16] Carlos Martin-Vide .Gheorghe Pǎun.Juan Pazos.Alfonso Rodriguez-Paton[J]. Tissue PSystems. Theoretical Computer Science 296 .2003: 295–326.
[17] Rudolf Freund. Gheorghe Pǎun. Mario J. Pérez-Jiménez. Tissue P systems with channelstates Theoretical [J]. Computer Science 330 .2005:101–116.
[18] Gheorghe Pǎun. Tracing Some Open Problems in Membrane Computing [J]. RomanianJournal of Information Science and Technology, 2007, 10(4):303-314.
[19] G Pǎun. Introduction to membrane computing//Proceedings of Brainstorming Workshop onUncertainty in Membrane Computing [J]. Palma de Mallorca, Espa a, 2004: 1-4.
[20] Alhazov A, Sburlan D. Static sorting algorithms for P systems//Proceedings of the Workshopon Membrane Computing [J]. Tarragona, 2003: 17-40.
[21] Ceterchi R, Martín-Vide C. P systems with communication for static sorting// Proceedingsof the Brainstorming Week on Membrane Computing [J]. Tarragona, 2003: 101-117.
[22] T. Y. Nishida. Membrane Algorithms. In Rudolf Freund, Gheorghe Pǎun, GrzegorzRozenberg, Arto Salomaa (Eds.) Membrane Computing[J]: 6th International Workshop,WMC 2005, Vienna, Austria, July 18{21, 2005, LNCS 3850, Springer-Verlag, 2006, PP.55-66.
[23] G Pǎun, R Pǎun. Membrane Computing and economics: Numerical P systems [J].Fundamenta Informaticae, 2006, 73(1-2): 213-227.
[24] T.Y.Nishida. An application of P-system: A new algorithm for NP-complete optimizationProblems//Proceedings of the 8th World Multi-Conference on Systemics [J], Cyberneticsand Informatics. Orlando, IIIS, 2004: 109-112.
[25] Leporati A, Pagani D. A membrane algorithm for the min storage Problem//Proceedings ofthe Workshop on Membrane Computing [J]. Lecture Notes in Computer Science4361.Berlin: Springer, 2006: 443-462.
[26] Huang L, Sun L, Wang N, Jin X. Multiobjective optimization of simulated moving bed bytissue P system [J]. Chinese Journal of Chemical Engineering, 2007, 15(5): 683-690.
[27] Huang L, Suh I H. Controller design for a marine diesel engine using membrane Computing[J]. International Journal of Innovative Computing Information and Control, 2009, 5(4):899-912.
[28] Bernardini F, Gheorghe M. Population P Systems.Journal of Universal ComputerSciences,2004,10(5):509-539
[29] Csuhaj-Varju E, Kelemen J, Kelemenova A, Pǎun G, Vaszil G. Computing with cells inenvironment: P colonies. Journal of Multiple-Valued Logic and SoftComputig,2006,12(3-4):201-215
[30] Freund R, Oswald M. P colonies working in the maximally Parellel and in the sequentialmode//Proceedings of 7th international Symposium on Symbolic and Numeric Algorithmsfor Scientific Computing, Timisoara, Romania,2005:419-426
[31] Kelemen J, Kelemenova A, Pǎun G. On the Power of a biochemically inspired simpleComputing model P colonies//Proceedings of the Workshop on Artificial Chemistry and ItsApplications. Boston, ECSL, 2005:82-86
[32] S.N.Krishna, A.Pǎun.Three universality results on P systems[C].In: First BrainstormingWeek on Membrane Computing, 2003:198-206.
[33] P.Sosik.About P systems with symport/antiport[C].In: Second Brainstorming Week onMembrane Computing, 2004:224-236.
[34] A.Atanasiu.Arithmetic with membranes [J].Romanian Journal of Information Science andTechnology, 2001, 4(1-2):5-20.
[35] C.Bonchis, G.Ciobanu, C.Izbasa.Encodings and arithmetic operations in membraneComputing[C].In: Theory and Applications of Models of Computation, LNCS, Springer,2006, 3959:618-627.
[36] P.Guo, J.Chen.Arithmetic operation in membrane system[C].In: the Proceedings ofInternational Conference on BioMedical Engineering and Informatics, 2008:231-234.
[37] P.Guo, H.Zhang.Arithmetic operation in single membrane[C].In: the Proceedings ofInternational Conference on Computer Science and Software Engineering, 2008:532-535.
[38] P.Guo,M.Luo.Signed numbers arithmetic operation in multi-membrane[C].In theProceedings of International Conference on Information Science andEngineering,2009:393-396.
[39] M.J.Pérez-Jiménez, A.Riscos-Núez.A linear time solution to the Knapsack Problem usingactive membranes[C].In: Membrane Computing, LNCS, Springer, Heidelberg, 2004,2933:250-268.
[40] A.LePorati, D.Pagani. A membrane algorithm for the min storage Problem[C].In:Proceedings of the Workshop on Membrane Computing, LNCS, Berlin, Springer, 2006,4361:
[41] T.Y.Nishida.Membrane algorithms: an approximate algorithm for NP-complete optimizationProblems exploiting P systems [M].In: Application of Membrane Computing, Springer,Berlin, 2006:303-314.
[42] M.A.Gutiérrez-Naranjo, M.J.Pérez-Jiménez, and F.J.Romero-Campero.A uniform solutionto SAT using membrane creation [J] .Theoretical Computer Science, 2007, 371(1-2):54-61.
[43] M.A.Gutiérrez-Naranjo, M.J.Pérez-Jiménez, A.Riscos-Núez. A fast P system for finding abalanced 2-Partition [J].Soft Computing, 2005, 9(9):673-678.
[44] L.Pan, A.Alhazov.Solving HPP and SAT by P systems with active membranes andseparation rules [J].Acta Informatica, 2006, 43(2):131-145.
[45] M.A.Gutierrez-Naranjo, M.J.PerezeJimenez, A.Riscos-Nunez.Available membraneComputing software [M]. In: Application of Membrane Computing, Springer, Berlin,2006:411-436.
[46] M. Garcia-Quismondo, R. Gutierrez-Escudero, M. A. Martinez-Del-Amor, E.Orejuela-Pinedo, I. Perez-Hurtado. P-Lingua2.0: A software framework for cell-like Psystems [J].International Journal of Computers Communications&Control, 2009,4(3):234-243.
[47] L.Bianco, A.Castellini. Psim:A comPutational Platform for metabolic P systems[C].In:Proceedings of the International Workshop on Membrane Computing, LNCS,Springer-Verlag, Berlin, 2007, 4860:199-208.
[48] B.Daniela, C.Paolo, et al...Modelling metapopulations with stochastic membrane systems[J]. Biosystem, 2008, 91(3):499-514.
[49] G.Enguix, M.D.JiménezLópez.Linguistic membrane systems and applications [M].In:Application of Membrane Computing, Springer, Berlin, 2006:347-388.
[50] L.Bianco, F.Fontana, V.Manca.P systems with reaction maPs [J].International Journal ofFndamental Computation, 2006, 17(1):27-48.
[51] F.Bernardini, M.Gheorghe, N.Krasnogor, et al.On P systems as a modeling tool forbiological systems[C].LNCS, 2006, 3850:114-133.
[52] F.Bernardini, M.Gheorghe.Cell communication in tissue P systems: Universality results[J].Soft Computing, 2005, 9(9):640-649.
[53] R.Freund, Gh.Pǎun, M.J.Pérez-Jiménez. Tissue P systems with channel states [J].Theoretical Computer Science, 2005, 330(1):101-116.
[54] D.Diaz-Pernil,A.Miguel,et al.A uniform family of tissue P systems with cell divisionsolving 3-COL in a linear time[J].Theoretical Computer Seience,2008,404(l-2):76-87.
[55] S.Annadurai, T.Kalyani, et al.P systems generating ISO-Picture languages [J].Process inNatural Science, 2008, 18(5):617-622.
[56] Gh.Pǎun.Tracing some open Problems in membrane Computing [J].Romanian Journal ofInformation Science and Technology, 2007, 10(4):303-314.
[57]张兴义,曾湘祥,潘林强,罗斌.脉冲神经膜系统求解任意两个自然数的乘积[J].计算机学报,2009,32(12):2362-2372.
[58] T.Ishdorj, A.Leporati.Uniform solutions to SAT and 3-SAT by spiking neural P systems withPre-computed resources [J].Natural Computing, 2008, 7(4):519-534.
[59] A.Leporati, M.A.Gutierrez-Naranjo.Solving SUBSET/SUM by spiking neural P systemswith Pre-computed resources [J].Fundamenta Informaticae, 2008, 87:61-77.
[60]张兴义.脉冲神经膜系统的计算能力研究[D].武汉:华中科技大学,2009.
[61]刘沙沙,窦全胜,伏开磊.基于动态膜计算系统的自组织网络广播算法[J].计算机应用研究, 2012.
[62] Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino. Shermer. NonadaptiveBroadcasting in Trees [J]. Networks. 2011, 57(2):157-168.
[63]胡宁宁等.智能表广播模型[J].计算机学报.1999, 22(8).
[64]刘沙沙,窦全胜,伏开磊.基于膜计算系统的广播模型[J],计算机工程, 2012(待见刊).
[65]周伯生,吴介一,费翔.一种适合于无线网络的竞争广播算法[J].电子学报,2003,31(2):280-283.