Skip to main content
SpringerLink
Log in

Deadlock Decidability in Partial Parallel P Systems

  • Conference paper
DNA Computing (DNA 2003)

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

Included in the following conference series:

Abstract

In parallel rewriting P systems, the notion of deadlock is used to describe situations where evolution rules with different target indications are simultaneously applied on a common string. In this paper we claim that the generative power of partial parallel P systems (PPP, in short) with deadlock is equivalent to matrix grammars without appearance checking, and we prove that it is decidable whether or not a PPP will ever reach a deadlock configuration.

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. Besozzi, D.: Computational and Modelling Power of P Systems, PhD Thesis (2003)

    Google Scholar 

  2. Besozzi, D., Ferretti, C., Mauri, G., Zandron, C.: Parallel Rewriting P Systems with Deadlock. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 302–314. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Besozzi, D., Mauri, G., Zandron, C.: Parallel Rewriting P Systems without Target Conflicts. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 119–133. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Besozzi, D., Ferretti, C., Mauri, G., Zandron, C.: P Systems with Deadlock. Biosystems 70(2), 95–105 (2003)

    Article  Google Scholar 

  5. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  8. Zandron, C.: A Model for Molecular Computing: Membrane Systems, PhD Thesis (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Daniela Besozzi, Giancarlo Mauri & Claudio Zandron

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi 8, 20136, 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. Department of Chemistry, New York University, 10003, New York, NY, USA

    Junghuei Chen

  2. Department of Computer Science, Duke University, Durham, NC, USA

    John Reif

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besozzi, D., Mauri, G., Zandron, C. (2004). Deadlock Decidability in Partial Parallel P Systems. In: Chen, J., Reif, J. (eds) DNA Computing. DNA 2003. Lecture Notes in Computer Science, vol 2943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24628-2_7

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20930-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation