Richelle Ann B. Juayong

Relating Computations in Non-cooperative Transition P Systems and Evolution-Communication P Systems with Energy

This paper explores the relation of computations in Evolution-Communication P systems with energy (ECPe systems) and non-cooperative Transition P systems without dissolution (TP systems). We have shown that for every non-cooperative TP system, we can construct an ECPe system that, (i) generates the same language, and (ii) each halting computation that takes τ steps in the TP system can be simulated in at most 3τ + 1 steps in its corresponding ECPe system.

Computing on Evolution-Communication P Systems with Energy Using Symport Only

In this paper, we refine the matrix representation for computations in Evolution-Communication P systems with energy (ECPe systems), given in a previous work, to highlight localization of regions in a defined system. We use this representation to answer the problem of computing backwards in ECPe systems where communication rules of the symport form are the only rules allowed. Such technique is employed to refine the solution to the initial problem of computing forwards, i.e. finding all application vectors that yield the next possible configurations from a given configuration in one computational step.

On Communication Complexity of Some Hard Problems in ECPe Systems

In this paper, we present non-confluent solutions to some NP-complete problems using recognizer Evolution-Communication P systems with Energy (ECPe systems). We then evaluate the communication resources used in these systems using dynamical communication measures proposed for computations in ECPe systems. Specifically, we evaluate based on number of communication steps, communication rules and energy required for all communication.

A SIMULATION OF TRANSITION P SYSTEMS IN WEIGHTED SPIKING NEURAL P SYSTEMS

Two of the general families of membrane systems in Membrane computing are cell-like and neural-like systems. Transition P systems or TP systems and Spiking Neural P systems or SNP systems are part of the cell-like and neural-like families, respectively. In this work we provide a relation between TP systems with noncooperative rules or nTP systems and SNP systems with weighted synapses or wSNP systems (both are synchronous and nondeterministic). In particular we define a reasonable operating mode of nTP systems we refer to as k-restricted object-minimal region-maximal parallelism or k-Omin, Rmax mode. We show that there exists a simulation of nTP systems operating in 1Omin, Rmax mode with wSNP systems. Remarks for further study of cell-like and neural-like relations are also provided.

On simulating cooperative transition P systems in evolution–communication P systems with energy

In this paper, we investigate simulations of transition P systems (TP systems) in evolution–communication P systems with energy (ECPe systems). We only focus on TP systems where an object that triggers a cooperative rule also triggers a non-cooperative rule. In this way, the presence of a rule trigger always implies that a rule will be applied. In our constructed ECPe systems, a transition in the TP system is simulated by a k-step computation where k is a factor of the cardinality of the alphabet in the original system. Also, the maximum energy needed for communication rules depends on the number of copies of a trigger in a cooperative rule.

On Evolution-Communication P Systems with Energy Having Bounded and Unbounded Communication.

We explore the computing power of Evolution-Communication P systems with energy (ECPe systems) considering dynamical communication measures, ComN, ComR and ComW. These measures consider the number of communication steps, communication rules and total energy used per communication step, respectively. In this paper, we address a previous conjecture that states that only semilinear sets can be generated with bounded ComX, \(X \in \{N,R,W\}\). Our result on bounded ComW seems to support such conjecture while the conjecture is not true for bounded ComN and ComR. We also show that the class of recursively enumerable sets can be computed using ECPe systems with two membranes. This improves a previous result that makes use of four membranes to show computational completeness.

Solution to Motif Finding Problem in Membranes

The study of genes is an important field of biology. A way to understand genetic composition is through finding regularly occurring nucleotide sequences, or motifs, in a DNA sequence. However, finding these motifs is difficult and is shown to be NP-complete. In this paper, we use a variant of P systems called Evolution-Communication P systems with Energy using string objects to solve the Motif Finding Problem in O(lt)-time where l is the length of the motif and t is the number of DNA sequences given.

On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems

In this paper, the communication complexity of non-confluent solutions for Vertex Cover Problem (VCP) and 3-Satisfiability Problem (3SP) in Evolution-Communication P systems (ECP) are analyzed. We use dynamical communication measures suggested by previous literature in our analysis. Solutions are constructed in several modes of operation: when communication is prioritized over evolution (CPE), when evolution is prioritized over communication (EPC) and when no priority is imposed (CME). VCP and 3SP are problems that have already been problems of interest for works that investigate communication complexity in an ECP system variant called Evolution-Communication P system with Energy (ECPe system). In this paper, we are interested in employing the technique used in ECPe system, this time for solutions in ECP system.

Relating the Languages of Transition P Systems and Evolution-Communication P Systems with Energy

In this work, we explored the relation of languages generated by Evolution-Communication P systems with energy (ECPe systems) and Transition P systems without dissolution (TP systems). In particular, we have shown that for every language generated by a non-cooperative TP system, there exists an ECPe system that can generate the same language. We also look into languages for some cooperative TP systems, specifically TP systems where every object required for a cooperative rule can also evolve independently. The languages of TP systems with such property can also be generated by ECPe systems.

A Grammar for Detecting Well-Handled 2-split, 2-join Workflow Nets without Cycles

In this paper, we propose a grammar-based technique to analyze the property of well-handledness in a class of Petri net used for workflows called Workflow net (WF-net). In particular, a set of rewriting rules is presented for a restricted type of WF-net. Using this grammar, we determine the conditions needed to assure such property and show that these conditions can be utilized to detect a well-handled 2-split, 2-join WF-net without cycles.