Reachability in Resource-Bounded Reaction Systems

Abstract : Reaction systems, a formalism describing biochemical reactions in terms of sets of reactants, inhibitors, and products, are known to have a PSPACE-complete configuration reachability problem. We show that the complexity of the problem remains unchanged even for some classes of resource-bounded reaction systems, where we disallow either inhibitors or reactants. We also prove that the complexity decreases to NP in the specific case of inhibitorless reaction systems using only one reactant per reaction.
Type de document :
Communication dans un congrès
LATA 2016, Mar 2016, Prague, Czech Republic. Springer, 9618, pp.592-602, 2016, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-319-30000-9_45>. <10.1007/978-3-319-30000-9_45>
Liste complète des métadonnées

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

Identifiants

Collections

Citation

Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio Porreca. Reachability in Resource-Bounded Reaction Systems. LATA 2016, Mar 2016, Prague, Czech Republic. Springer, 9618, pp.592-602, 2016, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-319-30000-9_45>. <10.1007/978-3-319-30000-9_45>. <hal-01313690>

Partager

Métriques

Consultations de la notice

63