A Survey on the Decidability Questions for Classes of FIFO Nets.

For the most recent entries see the Petri Nets Newsletter.

A Survey on the Decidability Questions for Classes of FIFO Nets.

In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 340: Advances in Petri Nets 1988, pages 106-132. Springer-Verlag, 1988.

Abstract: FNs are a generalization of both PNs and systems of CFSM's, a marriage that utilizes the transition mechanism of PNs in conjunction with the fifo channels of systems of CFSM's. Transitions in FNs enqueue/dequeue words to/from each fifo in the net. In this survey, an attempt is made to categorize the main decidability results concerning FNs.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography