Skip to main content
SpringerLink
Log in

Parallel Rewriting P Systems without Target Conflicts

  • Conference paper
  • First Online:
Book cover Membrane Computing (WMC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2597))

Included in the following conference series:

Abstract

We consider rewriting P systems with parallel application of evolution rules, where no conflicts on the communication of objects can arise. Different parallelism methods are used and only rules which have the same target indication can be simultaneously applied to a common string. The computational power is analyzed, with respect to Lindenmayer systems, and some relations among different parallel rewriting P systems are studied. Some open problems are also formulated.

Work partially supported by contribution of EU commission under The Fifth Framework Programme, project “MolCoNet” IST-2001-32008.

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. D. Besozzi, C. Ferretti, G. Mauri, C. Zandron, Parallel Rewriting P Systems with Deadlock, Pre-Proceedings of DNA8 Conference (M. Hagiya, A. Ohuchi, eds.), Hokkaido University, Japan, June 2002, 171–183.

    Google Scholar 

  2. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.

    Google Scholar 

  3. C. Ferretti, G. Mauri, C. Zandron, G. Păun, On Three Variants of Rewriting P Systems, Theoretical Computer Science, to appear.

    Google Scholar 

  4. S. N. Krishna, Languages of P systems: Computability and Complexity, PhD Thesis, 2001.

    Google Scholar 

  5. S. N. Krishna, R. Rama, A Note on Parallel Rewriting in P Systems, Bulletin of the EATCS, 73 (February 2001), 147–151.

    Google Scholar 

  6. S. N. Krishna, R. Rama, On the Power of P Systems Based on Sequential/Parallel Rewriting, Intern. J. Computer Math., 77, 1–2(2000), 1–14.

    Google Scholar 

  7. Gh. Păun, Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143 (see also Turku Center for Computer Science-TUCS Report No 208, 1998, www.tucs..).

    Article  MathSciNet  MATH  Google Scholar 

  8. G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.

    MATH  Google Scholar 

  9. G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.

    MATH  Google Scholar 

  10. C. Zandron, AMo del for Molecular Computing: Membrane Systems, PhD Thesis, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Chimiche, Fisiche e Matematiche, Università degli Studi dell’Insubria, Via Valleggio 11, 22100, Como, Italy

    Daniela Besozzi

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi 8, 20126, Milano, Italy

    Giancarlo Mauri & Claudio Zandron

Authors
  1. Daniela Besozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giancarlo Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Claudio Zandron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe PĂun

  2. Leiden University, Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

  4. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi, 8, 20126, Milano, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besozzi, D., Mauri, G., Zandron, C. (2003). Parallel Rewriting P Systems without Target Conflicts. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00611-4

  • Online ISBN: 978-3-540-36490-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation