Abstract

In this paper we define partial orders associated to process terms of place/transition nets. Further, we construct a set of partial orders from a given set of process terms. For place/transition nets without loops we prove the following result:The set of minimal partial orders constructed from process terms is in a one-to-one correspondence with the set of minimal partial orders defined by processes of the given net.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call