In: Chytil, M.P.; Janiga, L.; Koubek, V.: Mathematical Foundations of Computer Science 1988, Lecture Notes in Computer Science, Vol. 324, pages 351-359. Berlin, Heidelberg, New York: Springer-Verlag, 1988.
Abstract: In a preceding paper, the authors had examined the complexity of the fair nontermination problem for conflict-free Petri nets with respect to several definitions of fairness. In this paper, this study is extended to general Petri nets, examining 24 different versions of fairness.