Conference on Computability in Europe

CiE 2014: Language, Life, Limits pp 194-203

Fixed Points and Attractors of Reaction Systems

  • Enrico Formenti
  • Luca Manzoni
  • Antonio E. Porreca
Conference paper

DOI: 10.1007/978-3-319-08019-2_20

Volume 8493 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Formenti E., Manzoni L., Porreca A.E. (2014) Fixed Points and Attractors of Reaction Systems. In: Beckmann A., Csuhaj-Varjú E., Meer K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham

Abstract

We investigate the computational complexity of deciding the occurrence of many different dynamical behaviours in reaction systems, with an emphasis on biologically relevant problems (i.e., existence of fixed points and fixed point attractors). We show that the decision problems of recognising these dynamical behaviours span a number of complexity classes ranging from FO-uniform AC0 to \({\Pi_2^{\rm P}}\)-completeness with several intermediate problems being either NP or coNP-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Enrico Formenti
    • 1
  • Luca Manzoni
    • 1
  • Antonio E. Porreca
    • 2
  1. 1.CNRS, I3S, UMR 7271Univ. Nice Sophia AntipolisSophia AntipolisFrance
  2. 2.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità degli Studi di Milano-BicoccaMilanoItaly