For the most recent entries see the Petri Nets Newsletter.

P-Superfairness in Nets.

Fleischhack, H.

In: Universität Hildesheim, Fachbereich Informatik. 1992.

Also in: Jensen, K.: Lecture Notes in Computer Science, Vol. 616; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, pages 193-204. Springer-Verlag, June 1992.

Abstract: The notion of polynomial superfairness, which is an extension of strong fairness, is introduced for Petri nets. Superfair sequences automatically have a lot of properties which are not implied by strong fairness. Nevertheless - under reasonable circumstances - almost all infinite occurrence sequences are superfair and there are recursive - in fact exponential - such sequences. The concept of superfairness is compared to other fairness notions. Possible extensions are suggested.

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

Back to the Petri Nets Bibliography