On the reachability problem in P systems with mobile membranes

Authors:
Bogdan Aman;Gabriel Ciobanu
Affiliations:
Romanian Academy, Institute of Computer Science, IaŞi, Romania;"A.I.Cuza" University of IaŞi, Faculty of Computer Science, IaŞi, Romania and Romanian Academy, Institute of Computer Science, IaŞi, Romania
Venue:
WMC'07 Proceedings of the 8th international conference on Membrane computing
Year:
2007

Citing 8
Cited 3

Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
P Systems with Mobile Membranes

Natural Computing: an international journal
When ambients cannot be opened

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
On the dynamics of PB systems with volatile membranes

WMC'07 Proceedings of the 8th international conference on Membrane computing
Deciding reachability in mobile ambients

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Mutual mobile membranes with objects on surface

Natural Computing: an international journal
A temporal logic for mutual mobile membranes with objects on surface

Computation, cooperation, and life
Reachability problems in BioAmbients

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of reaching a configuration from another configuration in mobile membranes, and prove that the reachability can be decided by reducing it to the reachability problem of a version of pure and public ambient calculus without the capability open.