Infinite behaviour and fairness in Petri nets

Several classes of ω-languages of labelled Petri nets are defined and related to each other. Since such nets can be interpreted to behave fair, these notions are compared with explicit definitions of fairness for nets.

[1]  Rüdiger Valk,et al.  Formal Properties of Place/Transition Nets , 1979, Advanced Course: Net Theory and Applications.

[2]  Rina S. Cohen,et al.  Theory of omega-Languages. I. Characterizations of omega-Context-Free Languages , 1977, J. Comput. Syst. Sci..

[3]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[4]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[5]  Hartmann J. Genrich,et al.  A Dictionary of Some Basic Notions of Net Theory , 1979, Advanced Course: Net Theory and Applications.

[6]  Rüdiger Valk.  Infinite Behaviour of Petri Nets , 1983, Theor. Comput. Sci..

[7]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..