Time–Independent P Systems

Cavaliere, Matteo; Sburlan, Dragoş

doi:10.1007/978-3-540-31837-8_14

Cited by 47 publications

(45 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the following two sets, O x and O y , denote two input binary numbers, V x = (1011) 2 and V y = (1101) 2 .…”

Section: Input and Outputmentioning

confidence: 99%

“…For considering the asynchronous parallelism, a number of P systems [1,2,3,5,6,7] have been proposed. For example, some sequential P systems [5,7], which assume sequential application of applicable evolution rules, have been proposed.…”

Section: Introductionmentioning

confidence: 99%

“…In other words, applicable rules in another membranes are applied synchronously, and some kind of synchronicity is assumed in the model. In addition, time-free P systems are considered in [1,2]. Although the time-free P systems has also been proved to be universal, no P system has been proposed for solving a hard problem.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Arithmetic Operations and Factorization using Asynchronous P Systems

Murakawa

Fujiwara

2012

IJNC

View full text Add to dashboard Cite

In the present paper, we consider the asynchronous parallelism in membrane computing, and propose asynchronous P systems that perform two basic arithmetic operations and factorization. Since there is no restrictive assumption for application of rules, sequential and maximal parallel executions are allowed on the asynchronous P system.We first propose a P system that computes addition of two binary numbers of m bits. The P system works in O(m) sequential and parallel steps using O(m) types of objects. We next propose a P system for multiplication of the two binary numbers of m bits, and show that the P system works in O(m log m) parallel steps or O(m 3 ) sequential steps using O(m 2 ) types of objects. Finally, we propose a P system for factorization of a positive integer of m bits using the above P system as a sub-system. The P system computes the factorization in O(m log m) parallel steps or O(4 m × m 2 log m) sequential steps using O(m 2 ) types of objects.

show abstract

“…For example, the following two sets, O x and O y , denote two input binary numbers, V x = (1011) 2 and V y = (1101) 2 .…”

Section: Input and Outputmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Arithmetic Operations and Factorization using Asynchronous P Systems

Murakawa

Fujiwara

2012

IJNC

View full text Add to dashboard Cite

show abstract

“…In [8] a timed P system is introduced by associating to each rule a natural number representing the time of its execution. Then a P system which always produces the same result, independently from the execution times of the rules, is called a time-independent P systems.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Adding Lifetime to Objects and Membranes in P Systems

Aman¹,

Ciobanu²

2010

INT J COMPUT COMMUN

View full text Add to dashboard Cite

Membrane systems are computing devices inspired from the cell functioning. A feature of membrane systems is the fact that objects and membranes are persistent. In fact, this is not quite true in the real world: cells and intracellular proteins have a well-defined lifetime. Inspired from these biological facts, we define a model of membrane systems in which each membrane and each object has attached a lifetime. Some results show that this model is at least as powerful as the usual one.

show abstract

“…Starting from the idea that different reactions may take different times to be executed (or to be started, when enabled) a timed model of P system was introduced in [5], where to each rule of the system is associated a time of execution. The goal was to understand how time could be used to influence the result produced by the P system (see, e.g., [6]) and, possibly, how to design computational powerful time-free systems where the output produced is independent of the timings associated to the rules, e.g., [2].…”

Section: Introduction and Motivationsmentioning

confidence: 99%

Experiments on the reliability of stochastic spiking neural P systems

Cavaliere

Mura

2008

Nat Comput

Self Cite

View full text Add to dashboard Cite

In the area of membrane computing, time-freeness has been defined as the ability for a timed membrane system to produce always the same result, independently of the execution times associated to the rules. In this paper, we use a similar idea in the framework of spiking neural P systems, a model inspired by the structure and the functioning of neural cells. In particular, we introduce stochastic spiking neural P systems where the time of firing for an enabled spiking rule is probabilistically chosen and we investigate when, and how, these probabilities can influence the ability of the systems to simulate, in a reliable way, universal machines, such as register machines.

show abstract

Time–Independent P Systems

Cited by 47 publications

References 5 publications

Arithmetic Operations and Factorization using Asynchronous P Systems

Arithmetic Operations and Factorization using Asynchronous P Systems

Adding Lifetime to Objects and Membranes in P Systems

Experiments on the reliability of stochastic spiking neural P systems

Contact Info

Product

Resources

About