Fifo nets without order deadlock
We introduce a generalization of free choice nets to fifo. These fifo nets are free from deadlocks caused by the order of messages in fifo queues. We describe some tools for their analysis, using the facts that they are weakly monotonous, and that there is a close relation between their languages and those of the associated coloured nets. Therefore, quasi-liveness, finite termination and liveness are decidable properties.
scientific article; zbMATH DE number 3995068