On the complexity of occurrence and convergence problems in reaction systems

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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01313680
Contributeur : Enrico Formenti <>
Soumis le : mardi 10 mai 2016 - 11:50:30
Dernière modification le : mercredi 11 mai 2016 - 01:07:28

Identifiants

  • HAL Id : hal-01313680, version 1

Collections

Citation

Enrico Formenti, Luca Manzoni, Antonio Porreca. On the complexity of occurrence and convergence problems in reaction systems. Natural Computing, Springer Verlag, 2015, 14 (1), pp.185-191. <http://link.springer.com/article/10.1007%2Fs11047-014-9456-3>. <hal-01313680>

Partager

Métriques

Consultations de la notice

55