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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Brijder, R., Ehrenfeucht, A., Main, M., Rozenberg, G.: A tour of reaction systems. Int. J. Found. Comput. Sci. 22(7), 1499–1517 (2011)
Brijder, R., Ehrenfeucht, A., Rozenberg, G.: Reaction systems with duration. In: Kelemen, J., Kelemenová, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 191–202. Springer, Heidelberg (2011)
Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E.: Ancestors, descendants, and gardens of Eden in reaction systems. Theor. Comput. Sci. 608, 16–26 (2015)
Dudley, U.: Elementary Number Theory. W.H. Freeman and Company, New York (1969)
Ehrenfeucht, A., Rozenberg, G.: Basic notions of reaction systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 27–29. Springer, Heidelberg (2004)
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundamenta Informaticae 75, 263–280 (2007)
Formenti, E., Manzoni, L., Porreca, A.E.: Cycles and global attractors of reaction systems. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 114–125. Springer, Heidelberg (2014)
Formenti, E., Manzoni, L., Porreca, A.E.: Fixed points and attractors of reaction systems. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 194–203. Springer, Heidelberg (2014)
Formenti, E., Manzoni, L., Porreca, A.E.: On the complexity of occurrence and convergence problems in reaction systems. Nat. Comput. 14(1), 185–191 (2015)
Granas, A., Dugundji, J.: Fixed point theory. Springer Monographs on Mathematics. Springer, New York (2003)
Manzoni, L., Poças, D., Porreca, A.E.: Simple reaction systems and their classification. Int. J. Found. Comput. Sci. 25(4), 441–457 (2014)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1993)
Salomaa, A.: Minimal and almost minimal reaction systems. Nat. Comput. 12(3), 369–376 (2013)
Tošić, P.T.: On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules. In: Fatès, N., Kari, J., Worsch, T. (eds.) Discrete Mathematics and Theoretical Computer Science Proceedings, DMTCS, Automata 2010–16th International Workshop on CA and DCS, 14–16 June 2010, Nancy, France, pp. 125–144 (2010)
Acknowledgments
This work has been partially supported by Fondo di Ateneo (FA) 2013 grants of Università degli Studi di Milano-Bicocca: “Complessità computazionale in modelli di calcolo bioispirati: Sistemi a membrane e sistemi a reazioni” and “Sistemi complessi e incerti: Teoria ed applicazioni”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-319-30000-9_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-30000-9_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29999-0
Online ISBN: 978-3-319-30000-9
eBook Packages: Computer ScienceComputer Science (R0)