Traditional High-Level Petri Nets

The two net models Predicate/Transition Nets and Coloured Petri Nets are very similar and the main differences concern the methods to calculate and interpret place and transition invariants.

Nevertheless they are defined and presented in two rather different ways:

Predicate/Transition Nets are defined using the notation and concepts of many-sorted algebras and
Coloured Petri Nets are defined using types, variables and expressions - as known from (functional) programming languages and from lambda calculus.

References

K. Jensen, G. Rozenberg: High-level Petri Nets - Theory and Application [jr91]

BACK