Skip to main content
SpringerLink
Log in

Preimage Problems for Reaction Systems

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

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

Abstract

We investigate the computational complexity of some problems related to preimages and ancestors of states of reaction systems. In particular, we prove that finding a minimum-cardinality preimage or ancestor, computing their size, or counting them are all intractable problems, with complexity ranging from \(\mathbf{FP}^{\mathbf{NP}[\log n]}\) to \(\mathbf{FPSPACE}(\mathrm{poly})\).

This work has been supported by Fondo d’Ateneo (FA) 2013 of Università degli Studi di Milano-Bicocca: “Complessità computazionale in modelli di calcolo bioispirati: Sistemi a membrane e sistemi a reazioni”, by the Italian MIUR PRIN 2010–2011 grant “Automata and Formal Languages: Mathematical and Applicative Aspects” H41J12000190001, and by the French National Research Agency project EMC (ANR-09-BLAN-0164).

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. Chen, Z.Z., Toda, S.: On the complexity of computing optimal solutions. International Journal of Foundations of Computer Science 2(3), 207–220 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ehrenfeucht, A., Rozenberg, G.: Basic notions of reaction systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 27–29. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundamenta Informaticae 75, 263–280 (2007)

    MATH  MathSciNet  Google Scholar 

  4. Formenti, E., Manzoni, L., Porreca, A.E.: Cycles and global attractors of reaction systems. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 114–125. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  5. Formenti, E., Manzoni, L., Porreca, A.E.: Fixed points and attractors of reaction systems. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 194–203. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  6. Krentel, M.W.: The complexity of optimization problems. Journal of Computer and System Sciences 36, 490–509 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ladner, R.E.: Polynomial space counting problems. SIAM Journal on Computing 18(6), 1087–1097 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1993)

    Google Scholar 

  9. Porreca, A.E., Murphy, N., Pérez-Jiménez, M.J.: An optimal frontier of the efficiency of tissue P systems with cell division. In: García-Quismondo, M., Macías-Ramos, L.F., Păun, Gh., Valencia-Cabrera, L. (eds.) Tenth Brainstorming Week on Membrane Computing, vol. II, pp. 141–166. Fénix Editora (2012)

    Google Scholar 

  10. Salomaa, A.: Minimal and almost minimal reaction systems. Natural Computing 12(3), 369–376 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università Degli Studi di Milano-Bicocca, Viale Sarca 336/14, 20126, Milano, Italy

    Alberto Dennunzio, Luca Manzoni & Antonio E. Porreca

  2. CNRS, I3S, UMR 7271, Université Nice Sophia Antipolis, 06900, Sophia Antipolis, France

    Enrico Formenti

Authors
  1. Alberto Dennunzio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luca Manzoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Antonio E. Porreca
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio E. Porreca .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (2015). Preimage Problems for Reaction Systems. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation