On some LP problems for performance evaluation of timed marked graphs

Three linear programming (LP) formulations are known for performance evaluation of timed marked graphs. Two of these are dual. This paper shows that the third problem is isomorphic to one of the dual problems. An illustrative example is also given.<
>