Reduction of coloured Petri nets based on resource bisimulation

A pair consisting of a place and a token in a coloured Petri net is considered as an elementary resource for this net, and a resource is a multiset of elementary resources. Two resources are bisimilar, if replacement of one by another in any marking doesn't change the net behaviour. Due to this fact, bisimilar resources can be merged. The paper presents an algorithm for computing resource bisimulation for coloured Petri nets and describes some ways of net reduction based on merging bisimilar resources.