Decidability of Weak Fairness in Petri Nets.

For the most recent entries see the Petri Nets Newsletter.

Decidability of Weak Fairness in Petri Nets.

In: Monien, B.; Cori, R.: Lecture Notes in Computer Science, Vol. 349; STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, Germany, Feb. 16-18, 1989, pages 446-457. Springer-Verlag, 1989.

Abstract: The paper proves the decidability of the problem if there is an infinite weakly fair occurrence sequence for a given Petri net. Thereby an open problem of H. Carstensen (1987) and R. Howell et al. (1988) is solved.

Keywords: fairness decidability, (weak); fair occurrence sequence, (infinite weakly).

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

Back to the Petri Nets Bibliography