BWMC2020: Brainstorming Week in Membrane Computing (18th. 2020. Sevilla)

URI permanente para esta colecciónhttps://hdl.handle.net/11441/103494

Examinar

Mostrando 1 - 11 de 11

Alternative Space Definitions for P Systems with Active Membranes
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Alhazov, Artiom; Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Zandron, Claudio
The first definition of space complexity for P systems was based on an hypothetical real implementation by means of biochemical materials, and thus it assumes that every single object or membrane requires some constant physical space. This is equivalent to using a unary encoding to represent multiplicities for each object and membrane. A different approach can also be considered, having in mind an implementation of P systems in silico; in this case, the multiplicity of each object in each membrane can be stored using binary numbers, thus reducing the amount of needed space. In this paper, we give a formal definition for this alternative space complexity measure, we define the corresponding complexity classes and we compare such classes both with standard space complexity classes and with complexity classes defined in the framework of P systems considering the original definition of space.
An optimal solution to the SAT problem with tissue P systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Orellana Martín, David; Valencia Cabrera, Luis; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economia, Industria y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural
In the framework of membrane computing, several frontiers of e ciency have been found with respect to the resources that di erent families of P systems take to solve a decision problem. Each of these frontiers provides a new way to tackle the P versus NP problem. In this sense, optimal frontiers are needed in order to separate close variants of P systems. In a previous work, an e cient solution to SAT was given in the framework of P systems from T DC(3). In this work, we will provide an optimal solution to the SAT problem in terms of length of the rules.
Catalytic P Systems with Weak Priority of Catalytic Over Non-catalytic Rules
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu
Catalytic P systems are among the rst variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particularly the problem of using only one catalyst: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be su cient for obtaining even computational completeness with only one catalyst. In this paper we show that one catalyst is su cient for obtaining even computational completeness if catalytic rules have weak priority over the non-catalytic rules.
Contour Approximation with P Systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Ceterchi, Rodica; Orellana Martín, David; Zhang, Gexiang; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economia, Industria y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural
We model the problem of contour approximation using Hilbert's space lling curve, with a novel type of parallel array rewriting rules. We further use their pattern to introduce a special type of tissue P system, with novel features, among which is controlling their behavior with input. We propose some further developments.
Extracting Parallelism in Simulation Algorithms for PDP systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Martínez del Amor, Miguel Ángel; Doncel Ramírez, Andrés; Orellana Martín, David; Pérez Hurtado de Mendoza, Ignacio; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economia, Industria y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural
Population Dynamics P systems is a modelling framework that have been used successfully for some important real ecosystems. This model is inherently probabilistic, and the scheme of rules is very exible, allowing even cooperation between membranes. Thus, its simulation has been a challenge in the past years, leading to several simulation algorithms. The latest one, which has been proved to be the most accurate so far, is DCBA. The main drawback of DCBA is its complexity, requiring a very large table to handle all competitions. In this paper, we discuss two strategies to decrease this table, allowing a more lightweight version of DCBA that can be used in parallel implementations.
Modelling of Grey Wolf Optimization Algorithm Using 2D P Colonies
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Valenta, Daniel; Ciencialová, Lucie; Cienciala, Ludek
In this paper, we investigate a possibility of Grey wolf optimization algo- rithm simulation by 2D P colonies. We introduce a new kind of 2D P colony equipped with a blackboard. It is used by agents to store information that is reachable by all the agents from every place in the environment.
P Colonies and Reaction Systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Ciencialová, Lucie; Cienciala, Ludek; Csuhaj Varjú, Erzsébet
P colonies are abstract computing devices modeling communities of very simple reactive agents living and acting in a joint shared environment which is given with a multiset of objects. Reaction systems were proposed as a computing device, components of which represent basic chemical reactions that take place in shared environment given with a set. Although P colonies operate with multisets of objects and reaction systems work with sets, the two models can be related. In this paper, we construct a P colony simulating interactive processes in a reaction system.
P Systems with Limited Capacity
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu
P systems are a model of compartmentalized multiset rewriting inspired by the structure and functioning of the living cell. In this paper, we focus on a variant in P systems in which membranes have limited capacity, i.e., the number of objects they may hold is statically bounded. This feature corresponds to an important physical property of cellular compartments. We propose several possible semantics of limited capacity and show that one of them allows real-time simulations of partially blind register machines, while the other one allows for obtaining computational completeness.
Seven Research Suggestions
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Paun, Gheorghe
Some rather general research suggestions in membrane computing, as well as a couple of more speci c ideas are formulated.
Some open problems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Alhazov, Artiom; Research Group on Natural Computing
Some open problems for application of spiking neural P systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020) Peng, Hong

Examinar

Examinando BWMC2020: Brainstorming Week in Membrane Computing (18th. 2020. Sevilla) por Título