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.
Formenti, E., Manzoni, L., Porreca, A. (2015). On the complexity of occurrence and convergence problems in reaction systems. NATURAL COMPUTING, 14(1), 185-191 [10.1007/s11047-014-9456-3].
On the complexity of occurrence and convergence problems in reaction systems
MANZONI, LUCA;PORRECA, ANTONIO ENRICO
2015
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Paper.pdf
Solo gestori archivio
Dimensione
183.11 kB
Formato
Adobe PDF
|
183.11 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
