Equivalence transformations of PrT-nets

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.

[1]  P. S. Thiagarajan,et al.  Elementary Net Systems , 1986, Advances in Petri Nets.

[2]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[3]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[4]  Hartmann J. Genrich,et al.  Projections of C/E systems , 1985, Applications and Theory in Petri Nets.

[5]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[6]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.