Mobile Ambients and P-Systems

The mobile ambients and the P-systems are models developed in different areas of computer science, based on very similar concepts and structures. Given their resemblance, we point out how to transfer ideas and results from one framework to the other. Along this line, we prove that any P-system can be simulated in ambient calculus. We also introduce the mobile P-systems, well suited to model security features for membrane computing.

[1]  Luca Cardelli,et al.  Mobility Types for Mobile Ambients , 1999, ICALP.

[2]  Gheorghe Paun,et al.  On Synchronization in P Systems , 1999, Fundam. Informaticae.

[3]  Ion Petre,et al.  A Normal form for P-Systems , 1999, Bull. EATCS.

[4]  Andrei Păun,et al.  On membrane computing based on splicing , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[5]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[6]  Gheorghe Paun,et al.  On the Power of Membrane Computing , 1999, J. Univers. Comput. Sci..

[7]  Luca Cardelli,et al.  Abstractions for Mobile Computation , 2001, Secure Internet Programming.

[8]  Rudolf Freund.  Generalized P-Systems , 1999, FCT.

[9]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[10]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[11]  Gheorghe Paun,et al.  Simulating H Systems by P Systems , 2000, J. Univers. Comput. Sci..

[12]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

[13]  Luca Cardelli,et al.  Equational properties of mobile ambients , 1999, Mathematical Structures in Computer Science.

[14]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.