Formalizing the resurrecting duckling into hierarchical coloured Petri nets

The Resurrecting Duckling is a powerful security policy widely used in ad-hoc networks having devices with low processing capabilities. Focusing the master-slave relationship between any two network nodes, The Resurrecting Duckling is aimed at secure transient association. Hierarchical Coloured Petri Nets are descendants of Coloured Petri Nets which facilitates to organize a large model of any system into multiple coordinating subnets. This paper presents a formal model of The Resurrecting Duckling in terms of hierarchical Coloured Petri Nets. Firstly, the two entities called the duck and the duckling have been mathematically specified as two subnets. Then the dynamics of the security policy i.e the three cases of death namely; death by service completion, death by time and death by duck's instruction, have been modeled and each of them is verified using Reachability Graph. Finally the complete formal model of the Resurrecting Duckling has been verified using Simulation of CPN Tools.