On the complexity of occurrence and convergence problems in reaction systems
- First Online:
- Cite this article as:
- Formenti, E., Manzoni, L. & Porreca, A.E. Nat Comput (2015) 14: 185. doi:10.1007/s11047-014-9456-3
Reaction systems are a model of computation inspired by biochemical reactions introduced by Ehrenfeucht and Rozenberg. Two problems related to the dynamics (the evolution of the state with respect to time) of reaction systems, namely, the occurrence and the convergence problems, were recently investigated by Salomaa. In this paper, we prove that both problems are PSPACE-complete when the numerical parameter of the problems (i.e. the time step when a specified element must appear) is given as input. Moreover, they remain PSPACE-complete even for minimal reaction systems.