Secrecy Verification by Transforming Cryptographic Protocol Descriptions to Coloured Petri Nets

Verification of the safety of cryptographic protocols can be mechanized by reducing the safety to the reachability of Coloured Petri Nets (CPNs) since the reachability of CPNs is known to be decidable. In this paper, we propose an algorithm that transforms cryptographic protocol descriptions to CPNs, and show that the protocol is secure if no critical states are reachable from the initial states in the CPN obtained by the transformation from a given cryptographic protocol.