Reachability in Resource-Bounded Reaction Systems
- First Online:
- Cite this paper as:
- Dennunzio A., Formenti E., Manzoni L., Porreca A.E. (2016) Reachability in Resource-Bounded Reaction Systems. In: Dediu AH., Janoušek J., Martín-Vide C., Truthe B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science, vol 9618. Springer, Cham
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.