Dynamic programming (DP) is a very general optimization technique, which can be applied to numerous management decision problems. In order to develop a software system that automates many of the tasks a user encounters when attempting to solve an instance of an optimization problem with discrete DP an intermediate problem representation in the form of a Petri net (PN) turns out to be useful. The specialized PN model presented in this paper captures the essential components of a DP problem instance. It uses the standard semantics of place/transition nets, a low-level PN class, whereas previous work [3, 4, 5] relied on high-level PNs. This approach is illustrated by a simple .nancing example, but the methodology works for a wide range of management problems and can be applied to more complex instances. Among the bene.ts of this representation are the possibility to perform consistency checks on the PN level and the existence of a simple procedure to translate a model instance into executable code that could be integrated into existing solvers. Also, a software system currently under development will automate the task of transforming a DP functional equation into the PN model suggested in this paper. Users need not construct the PN model directly.