Abstract
Reaction systems are a recent formal model inspired by the chemical reactions that happen inside cells and possess many different dynamical behaviours. In this work we continue a recent investigation of the complexity of detecting some interesting dynamical behaviours in reaction system. We prove that detecting global behaviours such as the presence of global attractors is PSPACE-complete. Deciding the presence of cycles in the dynamics and many other related problems are also PSPACE-complete. Deciding bijectivity is, on the other hand, a coNP-complete problem. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Formenti, E., Manzoni, L., & Porreca, A. E. (2014). Cycles and global attractors of reaction systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 114–125). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
