Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Membrane Computing: An Introduction
Membrane Computing: An Introduction
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes
The conformon-P system: a molecular and cell biology-inspired computability model
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Journal of Computer and System Sciences
Tau leaping stochastic simulation method in p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
BioSimWare: a software for the modeling, simulation and analysis of biological systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
Energy-Based models of p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
An excursion in reaction systems: From computer science to biology
Theoretical Computer Science
Hi-index | 0.00 |
Taking inspiration from some laws of Nature--energy transformation and chemical reactions--we consider two different paradigms of computation in the framework of Membrane Computing. We first study the computational power of energy-based P systems, a model of membrane systems where a fixed amount of energy is associated with each object and the rules transform objects by manipulating their energy. We show that if we assign local priorities to the rules, then energy-based P systems are as powerful as Turing machines; otherwise, they can be simulated by vector addition systems, and hence are not universal. Then, we consider stochastic membrane systems where computations are performed through chemical networks. We show how molecular species and chemical reactions can be used to describe and simulate the functioning of Fredkin gates and circuits. We conclude the paper with some research topics related to computing with energy-based P systems and with chemical reactions.