In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 179-208. Berlin, Germany: Springer-Verlag, 1990.
Abstract: Predicate Transition Nets (PrT-Nets) describe distributed systems as first order dynamic structures. A single PrT-net can present a whole family of related systems in the same way as a set of logical formulae may describe a whole family of (static) systems, ie the class of its set-theoretical models. In the paper two PrT-nets are called equivalent if they describe the same family of systems. A list of formal transformations (re-writing rules) for PrT-nets that are consistent with equivalence is presented. For a non-trivial subclass of PrT-nets this set of rules is shown to characterize equivalence; it is also complete.
Keywords: equivalence transformation; predicate/transition net; re-writing rule.
Back to the Petri Nets Bibliography