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.