In: Chytil, M.P.; Janiga, L.; Koubek, V.: Mathematical Foundations of Computer Science 1988, Lecture Notes in Computer Science, Vol. 324, pages 542-551. Berlin, Heidelberg, New York: Springer-Verlag, 1988.
Also in: Acta Informatica, Vol. 26, pages 333-348. Springer-Verlag, 1989.
Abstract: One can construct labelled P/T-nets in a modular fashion by exchanging subnets such that the behaviour of the whole net remains the same. It is investigated which subnets can be exchanged such that deadlock-freeness is preserved, and, shown that some variations of failure semantics, which have been developed for TCSP, are useful in this context.