Flattening the transition P systems with dissolution

Authors:
Oana Agrigoroaiei;Gabriel Ciobanu
Affiliations:
Romanian Academy, Institute of Computer Science, Iaşi, Romania;"A.I.Cuza" University, Iaşi, Romania,
Venue:
CMC'10 Proceedings of the 11th international conference on Membrane computing
Year:
2010

Citing 4
Cited 3

Membrane Computing: An Introduction

Membrane Computing: An Introduction
A P Systems Flat Form Preserving Step-by-step Behaviour

Fundamenta Informaticae
Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors

Electronic Notes in Theoretical Computer Science (ENTCS)
A formal framework for static (tissue) P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing

Quantitative causality in membrane systems

CMC'11 Proceedings of the 12th international conference on Membrane Computing
Catalytic petri nets are turing complete

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Modeling membrane systems using colored stochastic Petri nets

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a transition P system Π with dissolution, promoters and inhibitors having several membranes, we construct a P system Πf with promoters and inhibitors and with only one membrane. The evolution of this "flat" P system Πf simulates the evolution of initial transition P system Π by replacing any dissolution stage of a configuration in Π by specific rules application in a configuration of Πf. The transition P systems without dissolution represent a special case.