Log in

Networks of evolutionary processors: wheel graph simulation

  • Research Paper
  • Published:
Journal of Membrane Computing Aims and scope Submit manuscript

Abstract

We propose a simulation of an arbitrary network of evolutionary processors by a network having a special underlying graph, namely a wheel (ring-star) graph. This work continues a series of papers devoted to simulations between networks of evolutionary processors with various topologies. Somehow unexpected, the simulation is time complexity preserving at the price of a much larger network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Alarcón, P., Arroyo, F., & Mitrana, V. (2014). Networks of polarized evolutionary processors. Information Sciences, 265, 189–197.

    Article  MathSciNet  Google Scholar 

  2. Bottoni, P., Labella, A., Manea, F., Mitrana, V., & Sempere, J. M. (2009). Filter position in networks of evolutionary processors does not matter: A direct proof. Proc 15th International Meeting on DNA Computing and Molecular Programming, LNCS (Vol. 5877, pp. 1–11). Berlin, Heidelberg: Springer.

    Chapter  Google Scholar 

  3. Bottoni, P., Labella, A., Manea, F., Mitrana, V., Petre, I., & Sempere, J. M. (2011). Complexity-preserving simulations among three variants of accepting networks of evolutionary processors. Natural Computing, 10, 429–445.

    Article  MathSciNet  Google Scholar 

  4. Bottoni, P., Labella, A., & Mitrana, V. (2014). Accepting networks of evolutionary picture processors. Fundamenta Informaticae, 131, 337–349.

    Article  MathSciNet  Google Scholar 

  5. Bottoni, P., Labella, A., & Mitrana, V. (2017). Networks of polarized multiset processors. Journal of Computer and System Sciences, 85, 93–103.

    Article  MathSciNet  Google Scholar 

  6. Castellanos, J., Martín-Vide, C., Mitrana, V., & Sempere, J. M. (2003). Networks of evolutionary processors. Acta Informatica, 39, 517–529.

    Article  MathSciNet  Google Scholar 

  7. Csuhaj-Varjú, E., Martín-Vide, C., & Mitrana, V. (2005). Hybrid networks of evolutionary processors are computationally complete. Acta Informatica, 41(4–5), 257–272.

    Article  MathSciNet  Google Scholar 

  8. Diaz, M. A., de Mingo, L. F., & Gómez Blas, N. (2008). Networks of evolutionary processors: Java implementation of a threaded processor. International Journal of Information Theories & Applications, 15, 37–43.

    Google Scholar 

  9. Diaz, M. A., de Mingo, L. F., Gómez Blas, N., & Castellanos, J. (2008). Implementation of massive parallel networks of evolutionary processors (MPNEP): 3-colorability problem. Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence (Vol. 129, pp. 399–408). Berlin, Heidelberg: Springer.

    Google Scholar 

  10. Drăgoi, C., Manea, F., & Mitrana, V. (2007). Accepting networks of evolutionary processors with filtered connections. Journal of Universal Computer Science, 13, 1598–1614.

    MathSciNet  Google Scholar 

  11. Gómez-Canaval, S., Ortega, A., & Orgaz, P. (2015). Distributed simulation of NEPs based on-demand cloud elastic computation. Advances in Computational Intelligence. LNCS 9094 (pp. 40–54). Berlin, Heidelberg: Springer.

    Chapter  Google Scholar 

  12. Gómez-Canaval, S., Ordozgoiti, B., & Mozo, A. (2015). NPEPE: Massive natural computing engine for optimally solving NP-complete problems in Big Data scenarios. Communications in Computer and Information Science (Vol. 539, pp. 207–217). Berlin, Heidelberg: Springer.

    Google Scholar 

  13. Loos, R., Manea, F., & Mitrana, V. (2010). Small universal accepting networks of evolutionary processors. Acta Informatica, 47, 133–146.

    Article  MathSciNet  Google Scholar 

  14. Manea, F., Martín-Vide, C., & Mitrana, V. (2010). Accepting networks of evolutionary word and picture processors: A survey. Scientific Applications of Language Methods, Mathematics, Computing, Language, and Life. Frontiers in Mathematical Linguistics and Language Theory (Vol. 2, pp. 523–560). Singapore: World Scientific Publishing.

    Google Scholar 

  15. Manea, F., Margenstern, M., Mitrana, V., & Pérez-Jiménez, M. J. (2010). A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors. Theory of Computing Systems, 46, 174–192.

    Article  MathSciNet  Google Scholar 

  16. Margenstern, M., Mitrana, V., & Pérez-Jiménez, M. J. (2004). Accepting hybrid networks of evolutionary processors. Proc. 10th International Workshop on DNA Computing. LNCS (Vol. 3384, pp. 235–246). Berlin, Heidelberg: Springer.

    Google Scholar 

  17. Mitrana, V., & Negru, M. C. (2021). Filters defined by random contexts versus polarization in networks of evolutionary processors. Theoretical Computer Science, 862, 214–223.

    Article  MathSciNet  Google Scholar 

  18. Mitrana, V., & Sánchez Martín, J. A. (2022). Simulating polarization by random context filters in networks of evolutionary processors. Journal of Applied Mathematics and Computing, 68(1), 553–569.

    Article  MathSciNet  Google Scholar 

  19. Navarrete, C. B., et al. (2011). Parallel simulation of NEPs on clusters. Proc International Joint Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2011 (pp. 171–174). IEEE Computer Society.

    Google Scholar 

  20. Sánchez Martín, J. A., & Mitrana, V. (2021). Simulations between network topologies in networks of evolutionary processors. Axioms, 10(3), 183.

    Article  Google Scholar 

  21. Sánchez Martín, J. A., Mitrana, V., & Păun, M. (2023). Networks of splicing processors: Simulations between topologies. Journal of Membrane Computing, 5(2), 108–115.

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was performed through the Core Program within the National Research, Development and Innovation Plan 2022-2027, carried out with the support of MRID, project no. 23020101(SIA-PRO), contract no. 7N/2022, and project no. 23020301(SAFE-MAPS), contract no 7N/2022. It was also supported by a grant of the Ministry of Research, Innovation and Digitization through Program 1: Development of the National R &D System, Subprogram 1.2 Institutional Performance, Projects for Excellence Financing in RDI, contract no. 2PFE?2021. his work was supported by the MRID, project no 842027778., contract no 760096.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Victor Mitrana.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Martín, J.Á.S., Mitrana, V. & Păun, M. Networks of evolutionary processors: wheel graph simulation. J Membr Comput 5, 221–237 (2023). https://doi.org/10.1007/s41965-023-00131-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41965-023-00131-y

Keywords

Navigation