Skip to main content

P Systems with Chained Rules

  • Conference paper

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

Abstract

In this paper we introduce a new model of P systems that uses vectors of rules to describe a causal dependence relation between the executions of the rules. We also study their computational power by considering several restrictions on the types of the rules.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Busi, N.: Causality in Membrane Systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 160–171. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Ciobanu, G., Lucanu, D.: Events, Causality, and Concurrency in Membrane Systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 209–227. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally Universal P Systems Without Priorities: Two Catalysts Are Sufficient. Theoretical Computer Science 330(2), 251–266 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    Book  MATH  Google Scholar 

  6. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press Inc., New York (2010)

    MATH  Google Scholar 

  7. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)

    MATH  Google Scholar 

  8. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Berlin (1997)

    MATH  Google Scholar 

  9. Sburlan, D.: Non-cooperative P Systems with Priorities Characterize PsET0L. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 363–370. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Sburlan, D.: Further Results on P Systems with Promoters/Inhibitors. International Journal of Foundations of Computer Science 17(1), 205–221 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sburlan, D. (2012). P Systems with Chained Rules. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28024-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28023-8

  • Online ISBN: 978-3-642-28024-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics