This paper proposes a study of deterministic P systems with active membranes in the context of discrete time dynamical systems. First of all, we prove that, for a fixed set of objects and labels, the set of all P system configuration is countable and that the dynamical behaviors defining a chaotic system are not possible. Then, we define a notion of distance between membrane configurations encoding the intuitive concept of “dissimilarity” between configurations. We prove that all functions defined by evolution, communication, and division rules are continuous under that distance and that the resulting topological space is discrete but not complete. Furthermore, we adapt in a natural way the classical notions of sensitivity to initial conditions and topological transitivity to P systems, and we show that P systems exhibiting those new properties exist. Finally, we prove that the proposed distance is efficiently computable, i.e., its computation only requires polynomial time with respect to the size of the input configurations

A topology for P‑systems with active membranes

Luca Manzoni;Giuliamaria Menara
2023-01-01

Abstract

This paper proposes a study of deterministic P systems with active membranes in the context of discrete time dynamical systems. First of all, we prove that, for a fixed set of objects and labels, the set of all P system configuration is countable and that the dynamical behaviors defining a chaotic system are not possible. Then, we define a notion of distance between membrane configurations encoding the intuitive concept of “dissimilarity” between configurations. We prove that all functions defined by evolution, communication, and division rules are continuous under that distance and that the resulting topological space is discrete but not complete. Furthermore, we adapt in a natural way the classical notions of sensitivity to initial conditions and topological transitivity to P systems, and we show that P systems exhibiting those new properties exist. Finally, we prove that the proposed distance is efficiently computable, i.e., its computation only requires polynomial time with respect to the size of the input configurations
2023
29-nov-2023
Pubblicato
https://dx.doi.org/10.1007/s41965-023-00132-x
File in questo prodotto:
File Dimensione Formato  
s41965-023-00132-x.pdf

accesso aperto

Tipologia: Documento in Versione Editoriale
Licenza: Creative commons
Dimensione 1.49 MB
Formato Adobe PDF
1.49 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11368/3066739
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact