Skip to main content
Springer Nature Link
Log in

On the Reachability Problem in P Systems with Mobile Membranes

  • Conference paper
Membrane Computing (WMC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4860))

Included in the following conference series:

  • 426 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boneva, I., Talbot, J.-M.: When Ambients Cannot be Opened. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol. 2620, pp. 169–184. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 248–262. Springer, Heidelberg (2005)

    Google Scholar 

  3. Cardelli, L., Gordon, A.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Ciobanu, G.: Distributed Algorithms over Communicating Membrane Systems. BioSystems 70, 123–133 (2003)

    Article  Google Scholar 

  5. Delzanno, G., Van Begin, L.: On the Dynamics of PB Systems with Volatile Membranes. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007, vol. 4860, pp. 240–256. Springer, Heidelberg (2007)

    Google Scholar 

  6. Krishna, S.N., Păun, G.: P Systems with Mobile Membranes. Natural Computing 4(3), 255–274 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing 13(3), 441–460 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  8. Milner, R.: Communicating and Mobile Systems: The π-Calculus. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  9. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MathSciNet  Google Scholar 

  10. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. “A.I.Cuza” University of Iaşi, Faculty of Computer Science, Blvd. Carol I no.11, 700506 Iaşi, Romania

    Gabriel Ciobanu

  2. Romanian Academy, Institute of Computer Science, Blvd. Carol I no.8, 700505 Iaşi, Romania

    Bogdan Aman & Gabriel Ciobanu

Authors
  1. Bogdan Aman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

George Eleftherakis Petros Kefalas Gheorghe Păun Grzegorz Rozenberg Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aman, B., Ciobanu, G. (2007). On the Reachability Problem in P Systems with Mobile Membranes. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2007. Lecture Notes in Computer Science, vol 4860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77312-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77312-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77311-5

  • Online ISBN: 978-3-540-77312-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics