Abstract
The issue of reversibility in computational paradigms has gained interest in recent years. In this paper we investigate how to reverse steps in membrane systems computations. The problem is that computation steps in membrane systems do not preserve all the information that has to be used when reversing them. We try to formalize the relevant information needed, and we show that the proposed approach enjoy the so called loop lemma, which basically assures that the undoing obtained by reversely applying rules is correct.
Work partially supported by RAS, Sardinia Regional Government, Convenzione triennale tra la Fondazione di Sardegna e gli Atenei Sardi Regione Sardegna, (CUP: F72F16003030002), and P.I.A. 2013 “NOMAD”.
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 subscriptionsNotes
- 1.
This is testified by the series of workshops and conferences entitled Reversible Computation (RC) organized since 2009, which is a conference since 2013.
- 2.
This requirement is reasonable when one imagine that reversing means undoing the effects of a rule, thus if a rule just serves to annihilate all the objects to be rewritten then one can imagine that such a rule can be always reversed, in any multiplicity.
References
Agrigoroaiei, O., Ciobanu, G.: Reversing computation in membrane systems. J. Logic Algebraic Program. 79(3–5), 278–288 (2010)
Agrigoroaiei, O., Ciobanu, G.: Rule-based and object-based event structures for membrane systems. J. Logic Algebraic Program. 79(6), 295–303 (2010)
Alhazov, A., Freund, R., Morita, K.: Sequential and maximally parallel multiset rewriting: reversibility and determinism. Nat. Comput. 11(1), 95–106 (2012)
Aman, B., Ciobanu, G.: Computational power of protein interaction networks. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 248–249. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39074-6_25
Ciobanu, G., Pan, L., Păun, G., Pérez-Jiménez, M.J.: P systems with minimal parallelism. Theoret. Comput. Sci. 378(1), 117–130 (2007)
Ciobanu, G., Pinna, G.M.: Catalytic Petri nets are turing complete. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 192–203. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28332-1_17
Ciobanu, G., Pinna, G.M.: Catalytic and communicating Petri nets are Turing complete. Inf. Comput. 239, 55–70 (2014)
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28644-8_19
Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoret. Comput. Sci. 330(2), 251–266 (2005)
Giachino, E., Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent reversibility in a tuple-based language. In: Daneshtalab, M., Aldinucci, M., Leppänen, V., Lilius, J., Brorsson, M. (eds.) PDP 2015, pp. 467–475. IEEE Computer Society (2015)
Ibarra, O.H.: On strong reversibility in P systems and related problems. Int. J. Found. Comput. Sci. 22(1), 7–14 (2011)
Kleijn, J., Koutny, M.: A Petri net model for membrane systems with dynamic structure. Nat. Comput. 8(4), 781–796 (2009)
Kleijn, J.H.C.M., Koutny, M., Rozenberg, G.: Towards a Petri net semantics for membrane systems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 292–309. Springer, Heidelberg (2006). https://doi.org/10.1007/11603047_20
Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order Pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 478–493. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15375-4_33
Lanese, I., Mezzina, C.A., Stefani, J.: Reversibility in the higher-order \(\pi \)-calculus. Theoret. Comput. Sci. 625, 25–84 (2016)
Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent reversibility. Bull. EATCS (114) (2014)
Leporati, A., Zandron, C., Mauri, G.: Reversible P systems to simulate Fredkin circuits. Fundamenta Informaticae 74(4), 529–548 (2006)
Nishida, T.Y.: Reversible P systems with symport/antiport rules. In: Paun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A. (eds.) WMC 2010, pp. 452–460 (2010)
Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. J. Logic Algebraic Methods Program. 84(6), 781–805 (2015)
Pinna, G.M., Saba, A.: Modeling dependencies and simultaneity in membrane system computations. Theoret. Comput. Sci. 431, 13–39 (2012)
Păun, A., Păun, G.: The power of communication: P systems with Symport/Antiport. New Gener. Comput. 20(3), 295–306 (2002)
Păun, G.: Computing with membranes: an introduction. Bull. EATCS 67, 139–152 (1999)
Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Song, T., Shi, X., Xu, J.: Reversible spiking neural P systems. Front. Comput. Sci. 7(3), 350–358 (2013)
Acknowledgement
The author acknowledge the useful remarks and suggestions by the anonymous reviewers.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Michele Pinna, G. (2018). Reversing Steps in Membrane Systems Computations. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2017. Lecture Notes in Computer Science(), vol 10725. Springer, Cham. https://doi.org/10.1007/978-3-319-73359-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-73359-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73358-6
Online ISBN: 978-3-319-73359-3
eBook Packages: Computer ScienceComputer Science (R0)