Skip to main content

On the Qualitative Analysis of Conformon P Systems

  • Conference paper
Membrane Computing (WMC 2008)

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

Included in the following conference series:

Abstract

We study computational properties of conformon P systems, an extension of P systems in which symbol objects are labeled by their current amount of energy. We focus here our attention to decision problems like reachability and coverability of a configuration and give positive and negative results for the full model and for some of its fragments. Furthermore, we investigate the relation between conformon P systems and other concurrency models like nested Petri nets and constrained multiset rewriting systems.

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

Access this chapter

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. Abdulla, P.A., Čerāns, K., Jonsson, B., Yih-Kuen, T.: General decidability theorems for infinite-state systems. In: Proc. LICS 1996, pp. 313–321 (1996)

    Google Scholar 

  2. Abdulla, P.A., Delzanno, G.: On the coverability problem for constrained multiset rewriting systems. In: AVIS 2006 (ETAPS-workshop) (2006)

    Google Scholar 

  3. Dang, Z., Ibarra, O.H., Li, C., Xie, G.: On model-checking of P systems. In: Calude, C.S., Dinneen, M.J., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 82–93. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Sci. 256, 63–92 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Frisco, P.: The conformon-P system: a molecular and cell biology-inspired computability model. Theoretical Computer Sci. 312, 295–319 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Frisco, P., Corne, D.W.: Dynamics of HIV infection studied with cellular automata and conformon-P systems. BioSystems 91, 531–544 (2008)

    Article  Google Scholar 

  7. Higman, G.: Ordering by divisibility in abstract algebras. London Math. Soc. 3, 326–336 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lomazova, I.A.: Nested Petri nets. Fundamenta Informaticae 43, 195–214 (2000)

    MathSciNet  MATH  Google Scholar 

  9. Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested Petri nets. In: Ershov Mem. Conf., pp. 208–220 (1999)

    Google Scholar 

  10. Păun, G.: Computing with membranes. J. Computer and System Sci. 61, 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdulla, P.A., Delzanno, G., Van Begin, L. (2009). On the Qualitative Analysis of Conformon P Systems. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2008. Lecture Notes in Computer Science, vol 5391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95885-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95885-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-95885-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics