In: Chytil, M.P.; Janiga, L.; Koubek, V.: Mathematical Foundations of Computer Science 1988, Lecture Notes in Computer Science, Vol. 324, pages 210-219. Berlin, Heidelberg, New York: Springer-Verlag, 1988.
Abstract: Many concurrent systems are designed to run without explicit termination. This leads to the investigation of infinite behaviour, especially for Petri nets. Real systems mostly have the property that changes resulting from action are determined by the action and the situation in which it appears. This leads to deterministic Petri nets. The infinite behaviour of these nets is investigated.