RS-Repo / library

Reaction Systems Repository (RSR)
8 stars 2 forks source link

On the complexity of occurrence and convergence problems in reaction systems, Formenti, E., Manzoni, L., & Porreca, A. E. #38

Open RS-Repo opened 6 years ago

RS-Repo commented 6 years ago

Formenti, E., Manzoni, L., & Porreca, A. E. (2015). On the complexity of occurrence and convergence problems in reaction systems. Natural Computing, 14(1), 185-191.

Abstract 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.

Link to the online copy

Bibtex file

@article{formenti2015complexity, title={On the complexity of occurrence and convergence problems in reaction systems}, author={Formenti, Enrico and Manzoni, Luca and Porreca, Antonio E}, journal={Natural Computing}, volume={14}, number={1}, pages={185--191}, year={2015}, publisher={Springer} }