Language, Life, Limits

Volume 8493 of the series Lecture Notes in Computer Science pp 194-203

Fixed Points and Attractors of Reaction Systems

  • Enrico FormentiAffiliated withCNRS, I3S, UMR 7271, Univ. Nice Sophia Antipolis
  • , Luca ManzoniAffiliated withCNRS, I3S, UMR 7271, Univ. Nice Sophia Antipolis
  • , Antonio E. PorrecaAffiliated withDipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca

* Final gross prices may vary according to local VAT.

Get Access


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 AC 0 to \({\Pi_2^{\rm P}}\)-completeness with several intermediate problems being either NP or coNP-complete.