Skip to main content

From Petri Nets to Virus Machines

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2024)

Abstract

Petri nets are a classical mathematical model used for several tasks, such as simulation of business processes, modelling of complex systems and so on. This model is based on a bipartite directed graph, where the set of places and the set of transitions mark the partition. There exists marks placed in each place in a specific way, whose representation depends on the problem being solved. A virus machine is a novel model of computation inspired by the spread and replication of viruses in real life, and has been used for applications such as cryptography and power systems fault diagnosis, among others. A virus machine can be represented by three well-differentiated graphs that mark the spaces where the viruses exist and move through, called hosts and channels, the control instructions, that direct the behaviour of the virus machine, and the instruction-channel graph that represents the control of the opening and closing of the channels. In this work, we use an extension of virus machines to simulate a specific variant of Petri nets, where there exist some restrictions. In fact, a direct protocol for the simulation is explicitly given.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This is made in order to have enough viruses to sent to the hosts simulating the postset of t.

  2. 2.

    This is made in order to have enough viruses to sent to the hosts simulating the postset of t.

References

  1. Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theoret. Comput. Sci. 3(1), 85–104 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ciobanu, G., Michele Pinna, G.: Catalytic and communicating Petri nets are Turing complete. Inf. Comput. 239, 55–70 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Jensen, K.: A brief introduction to coloured Petri Nets. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 203–208. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0035389

    Chapter  MATH  Google Scholar 

  4. Pawlewski, P.: Petri nets applications. InTech, Poland (2010)

    Google Scholar 

  5. Petri, C.A.: Kommunikation mit Automaten (Ph.D. thesis). University of Bonn (1962)

    Google Scholar 

  6. Ramírez-de-Arellano, A., Orellana-Martín, D., Pérez-Jiménez, M.J.: Attacking cryptosystems by means of virus machines. Nat. Sci. Rep. 13, 21831 (2023)

    MATH  Google Scholar 

  7. Ramírez-de-Arellano, A., Orellana-Martín, D., Pérez-Jiménez, M.J.: Bridges between spiking neural membrane systems and virus machines. Int. J. Neural Syst. (2024)

    Google Scholar 

  8. Ramírez-de-Arellano, A., Orellana-Martín, D., Pérez-Jiménez, M.J.: Parallel Virus Machines. J. Membrane Comput. (accepted)

    Google Scholar 

  9. Ramírez-de-Arellano, A., Rodríguez-Gallego, J.A., Orellana-Martín, D., Ivanov, S.: Stochastic virus machines. In: Proceedings of the 19th Brainstorming Week on Membrane Computing, pp. 79–90. RGNC REPORT 1/2023, Sevilla (2023)

    Google Scholar 

  10. Romero-Jiménez, Á., Valencia-Cabrera, L., Pérez-Jiménez, M.J.: Generating Diophantine sets by virus machines. In: BIC-TA 2015. CCIS, vol. 562, pp. 331–341. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-49014-3_30

    Chapter  MATH  Google Scholar 

  11. Romero-Jiménez, Á., Valencia-Cabrera, L., Riscos-Núñez, A., Pérez-Jiménez, M.J.: Computing partial recursive functions by virus machines. In: Rozenberg, G., Salomaa, A., Sempere, J.M., Zandron, C. (eds.) CMC 2015. LNCS, vol. 9504, pp. 353–368. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-28475-0_24

    Chapter  MATH  Google Scholar 

  12. Valencia-Cabrera, L., Pérez-Jiménez, M.J., Chen, X., Wang, B., Zeng, X.: Basic virus machines. In: 16th International Conference on Membrane Computing (CMC16), pp. 323–342 (2015)

    Google Scholar 

  13. Wu, H., Ramirez-de-Arellano, A., Orellana-Martín, D., Wang, T., Wang, T., Pérez-Jiménez, M.J.: Channel parallel virus machine with production rules for power system fault diagnosis. J. Membrane Comput. (submitted)

    Google Scholar 

  14. Zaitsev, D.A.: Toward the minimal universal Petri net. IEEE Trans. Syst. Man Cybern.: Syst. 44(1), 47–58 (2013)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Orellana-Martín .

Editor information

Editors and Affiliations

Ethics declarations

Disclosure of Interests

The authors have no competing interests to declare that are relevant to the content of this article.

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Orellana-Martín, D., Romero-Jiménez, Á., Riscos-Núñez, A., Pérez-Jiménez, M.J. (2025). From Petri Nets to Virus Machines. In: Formenti, E., Durand-Lose, J. (eds) Machines, Computations, and Universality. MCU 2024. Lecture Notes in Computer Science, vol 15270. Springer, Cham. https://doi.org/10.1007/978-3-031-81202-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-81202-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-81201-9

  • Online ISBN: 978-3-031-81202-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics