A performance bound solver for Probabilistic Timed Petri Nets

The solver computes:
1. Transitions maximum throughput bound 
2. Transitions minimum cycle times (in case of live nets) and identifies the slowest subnet.

The computation is performed using Linear Programming techniques.