Analyzing for deadlock is one challenge that poses most devastating problems to real-time concurrent Petri net based systems. It is even further compounded when the underlying system is timed,object-oriented, real-time and concurrent. Recent advances in Petri net theory have offered interesting results in modeling and analyzing behavioral properties of systems. However, most of the analysis techniques used are reachability trees based which suffer from state explosion problem and void of Petri net timing preservation. This thesis introduces a token flow path equivalent timed Petri net and time preserving Petri nets reduction rules and use the results to detect deadlock in object-oriented Petri net system models (also known as OOPN nets). In particular, the thesis targets analyzing for deadlock in timed OOPN nets derived from an object-oriented Petri net integrated development environment(OOPN-IDE) tool.This thesis presents a deadlock detection approach that validates an object Petri net in a first step and then constructs its observable reduced token path equivalent net in the second step. The constructed net is then analysed for deadlock as in ordinary Petri nets. To realize this, a timed OOPN net model (defined as a TOOPN) and time preserving Petri net reduction rules to contain Petri net complexity problems are developed. The use and benefits of this approach is illustrated by analyzing for deadlock in an information exchanging command and control system subsystems.