An introduction to FIFO nets- monogeneous nets: A subclass of FIFO nets

We introduce a new model of parallel computation, the FIFO nets. We show how it can simulate Petri nets and coloured Petri nets and prove that a restriction of it (alphabetical FIFO nets) has the power of Turing machines. Furthermore, we define monogeneous FIFO nets and use the coverability graph for proving that it is decidable whether or not a monogeneous net is bounded and whether or not its language is regular.