Equivalence transformations of PrT-Nets

Abstract

There is a net theoretical system model called Predicate Transition Nets (PrT-Nets) that describes 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 — the class of its set-theoretical models.

In this note 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.