The main objective of this thesis is to investigate possibilities of automatic verification of TAPN. We focus on translations of various subclasses of TAPN into TA. Our aim is to verify the reachability properties of TAPN by verifying the translated TA using verification tool Uppaal.
Our reduction technique works for a sub-class of TAPN namely k-conservative nets. And the translator is implemented on Java platform considering both input and output files as XML files. Moreover we present two case studies on Fischer's protocol and Alternating Bit Protocol.