In: Theoretical Computer Science, Vol 64, No. 1, pages 25-38. 1989.
Abstract: A method of finding the behaviour of Place/Transition nets is presented. The behaviour of a net is a set of processes, i.e. strings of transitions. It is described by a predicate expression (prex) defined in the paper. The prex for a net is easily calculated by the synchronization of standard prexes describing the behaviour of single-place subnets.