The document discusses using timed process Petri nets (TPPN) to model systems with shared resources. TPPNs use vectors to represent average transition times and rates. Linear programming problems (LPPs) can identify bottlenecks, but iterative strategies are weak and slow. Instead, heuristics provide better performance estimation and resource optimization. As a case study, the document applies TPPN modeling to a secure database system, examining the network, parameters, and results of sensitivity analysis. It concludes that TPPNs are useful for modeling but that heuristic algorithms are needed to reduce experiment time when modeling larger systems.