Fixed Points and Attractors of Reaction Systems

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 AC^0 to Π_2^P-completeness with several intermediate problems being either NP or coNP-complete.
Liste complète des métadonnées
Contributeur : Enrico Formenti <>
Soumis le : lundi 9 mai 2016 - 17:35:15
Dernière modification le : mercredi 31 janvier 2018 - 10:24:06




Enrico Formenti, Antonio Porreca, Luca Manzoni. Fixed Points and Attractors of Reaction Systems. Language, Life, Limits (CiE 2014), Jun 2014, Budapest, Hungary. 8493, pp.194-203, 2014, Lecture Notes in Computer Science. 〈〉. 〈10.1007/978-3-319-08019-2_20〉. 〈hal-01313294〉



Consultations de la notice