Skip to main content
SpringerLink
Log in

On the Dynamics of PB Systems with Volatile 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:

Abstract

We investigate decision problems like reachability and boundedness for extensions of PB systems with volatile membranes. Specifically, we prove that reachability and boundedness are decidable for PB systems extended with rules for membrane dissolution. For PB systems extended with membrane creation, reachability is still decidable whereas boundedness becomes undecidable. Furthermore, we show that both problems are undecidable for PB systems extended with both dissolution and creation rules. Finally, we prove that reachability and boundedness become decidable for PB systems with dissolution rules and in which only one instance of each type of membrane can be created during a computation. Our work extends the results in [4] obtained by Dal Zilio and Formenti for PB systems with static membrane structure.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aziz-Abdulla, P., Nylén, A.: On Efficient Verification of Infinite-State Systems. In: LICS 2000, pp. 132–140 (2000)

    Google Scholar 

  2. Bernardini, F., Manca, V., Systems, P.: P Systems with Boundary Rules. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 107–118. Springer, Heidelberg (2003)

    Google Scholar 

  3. 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 

  4. Dal Zilio, S., Formenti, E.: On the Dynamics of PB Systems: A Petri Net View. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing. LNCS, vol. 2933, pp. 153–167. Springer, Heidelberg (2004)

    Google Scholar 

  5. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103–115. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Franco, G., Manca, V.: A Membrane System for the Leukocyte Selective Recruitment. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing. LNCS, vol. 2933, pp. 181–190. Springer, Heidelberg (2004)

    Google Scholar 

  7. Frisco, P.: P-systems, Petri Nets and Program Machines. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 209–223. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Ibarra, O.H., Dang, Z., Egecioglu, Ö.: Catalytic P Systems, Semilinear Sets, and Vector Addition Systems. TCS 312(2-3), 379–399 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Karp, R.M., Miller, R.E.: Parallel Program Schemata. JCSS 3, 147–195 (1969)

    MATH  MathSciNet  Google Scholar 

  10. Kosaraju, S.R.: Decidability of Reachability in Vector Addition Systems. STOC, 267–281 (1982)

    Google Scholar 

  11. Li, C., Dang, Z., Ibarra, O.H., Yen, H.-C.: Signaling P Systems and Verification Problems. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1462–1473. Springer, Heidelberg (2005)

    Google Scholar 

  12. Martin-Vide, C., Păun, G., Rodriguez-Paton, A.: On P Systems with Membrane Creation Comp. Sc. J. of Moldova 9(2), 134–145 (2001)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  15. Păun, G.: Computing with Membranes. JCSS 61(1), 108–143 (2000)

    Google Scholar 

  16. Petri, C.A.: Kommunikation mit Automaten. Ph.D. Thesis. U. of Bonn (1962)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Genova, Italy

    Giorgio Delzanno

  2. Université Libre de Bruxelles, Belgium

    Laurent Van Begin

Authors
  1. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Van Begin
    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

Delzanno, G., Van Begin, L. (2007). On the Dynamics of PB Systems with Volatile 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_15

Download citation

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

  • 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

Search

Navigation