Abstract
The computational complexity of problems related to reaction systems (RSs) such as, e.g., reachability, simulation, etc., are well understood. We investigate the complexity of some of these problems for reversible RSs. Since some of the computational complexity (lower bound) proofs in the general case rely on reductions from Turing machine problems here the main challenge is to present constructions that ensure the reversibility of the RS that encodes Turing machine configurations by sets, which allows ambiguous representation. For the problems under consideration we can show that there is no difference in complexity for reversible RSs compared to the general case. One exception is the question of the existence of a reversible subcomputation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Azimi, S., Iancu, B., Petre, I.: Reaction system models for the heat shock response. Fund. Inform. 131(3–4), 299–312 (2014)
Bagossy, A., Vaszil, G.: Simulating reversible computation with reaction systems. J. Membrane Comput. 2, 179–193 (2020)
Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E.: About reversibility in SP colonies and reaction systems. Natural Comput., October (2022)
Dennunzio, A., Formenti, E., Manzoni, L.: Reaction systems and extremal combinatorics properties. Theor. Comput. Sci. 598, 138–149 (2015)
Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E.: Complexity of the dynamics of reaction systems. Inf. Comput. 267, 96–109 (2019)
Ehrenfeucht, A., Kleijn, J., Koutny, M., Rozenberg, G.: Minimal reaction systems. In: Priami, C., Petre, I., de Vink, E. (eds.) Transactions on Computational Systems Biology XIV. LNCS, vol. 7625, pp. 102–122. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35524-0_5
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fund. Inform. 75, 263–280 (2007)
Galil, Z.: Hierarchies of complete problems. Acta Informatica 6(1), 77–88 (1976). https://doi.org/10.1007/BF00263744
Holzer, M., Rauch, C.: On the computational complexity of reaction systems, revisited. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 170–185. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79416-3_10
Lange, K.-J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60(2), 354–367 (2000)
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 (1994)
Salomaa, A.: Functions and sequences generated by reaction systems. Theor. Comput. Sci. 466, 87–96 (2012)
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)
Sipser, M.: Halting space-bounded computations. Theor. Comput. Sci. 10, 335–338 (1980)
Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proceedings of the 5th Symposium on Theory of Computing, pp. 1–9 (1973)
Teh, W.C., Atanasiu, A.: Minimal reaction system revisited and reaction system rank. Int. J. Found. Comput. Sci. 28(3), 247–261 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Holzer, M., Rauch, C. (2023). Computational Complexity of Reversible Reaction Systems. In: Kutrib, M., Meyer, U. (eds) Reversible Computation. RC 2023. Lecture Notes in Computer Science, vol 13960. Springer, Cham. https://doi.org/10.1007/978-3-031-38100-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-38100-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-38099-0
Online ISBN: 978-3-031-38100-3
eBook Packages: Computer ScienceComputer Science (R0)