University of Cambridge, Computer Laboratory, Technical Report No. 148, October 1988.
Abstract: A class of extended Coloured Petri Nets (CP-nets), known as P-nets, is defined that includes the capacity function and the threshold inhibitor extension. Two transformations from P-nets to CP-nets are presented which preserve interleaving behaviour. The graphical form of P-nets, known as P-Graph, is presented formally, and an interpretation of the P-Graph is given in terms of the corresponding P-net. Classes of the P-Graph, known as Many-sorted Algebraic Nets and Many-sorted Predicate/Transition Nets, are defined.