Abstract
We study the transition graphs, and thus, the possible computational paths of reaction systems which are reversible according to different notions of reversibility. We show that systems which are reversible in the sense of our earlier work produce very simple types of transition graphs. A somewhat more complicated, but still quite simple class of transition graphs is obtained if we consider so-called initialized reversible systems. Finally we introduce the notion of reversibility with lookbehind, and show that systems which are reversible in this sense produce the same transition graphs (and thus, the same computations) as the state transition diagrams of reversible finite transition systems.
The work of Gy. Vaszil was supported by the National Research, Development and Innovation Fund of Hungary through project no. K 120558, financed under the K 16 funding scheme.
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
Aman, B., Ciobanu, G.: Controlled reversibility in reaction systems. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 40–53. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73359-3_3
Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741–765 (1982)
Bagossy, A., Vaszil, G.: Simulating reversible computation with reaction systems. J. Membr. Comput. 2(3), 179–193 (2020). https://doi.org/10.1007/s41965-020-00049-9
Brijder, R., Ehrenfeucht, A., Main, M., Rozenberg, G.: A tour of reaction systems. Int. J. Found. Comput. Sci. 22, 1499–1517 (2011)
Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E.: Reachability in resource-bounded reaction systems. In: Dediu, A.-H., Janoušek, J., Martín-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 592–602. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30000-9_45
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundam. Inf. 75(1–4), 263–280 (2007)
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.: Events and modules in reaction systems. Theor. Comput. Sci. 376, 3–16 (2007)
Genova, D., Hoogeboom, H.J., Jonoska, N.: A graph isomorphism condition and equivalence of reaction systems. Theor. Comput. Sci. 701, 109–119 (2017)
Holzer, M., Kutrib, M.: Reversible nondeterministic finite automata. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 35–51. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59936-6_3
Męski, A., Penczek, W., Rozenberg, G.: Model checking temporal properties of reaction systems. Inf. Sci. 313, 22–42 (2015)
Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992). https://doi.org/10.1007/BFb0023844. https://hal.archives-ouvertes.fr/hal-00019977
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Bagossy, A., Vaszil, G. (2021). Transition Graphs of Reversible Reaction Systems. In: Freund, R., Ishdorj, TO., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2020. Lecture Notes in Computer Science(), vol 12687. Springer, Cham. https://doi.org/10.1007/978-3-030-77102-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-77102-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-77101-0
Online ISBN: 978-3-030-77102-7
eBook Packages: Computer ScienceComputer Science (R0)