Reduced MDP Representation of a Logistical Planning Problem Using Petri-Nets

This paper describes a method for unfolding a Predicate-net representation of a logistical planning problem, such that it possesses the Markov property. The problem can then be easily converted into a Markov Decision Process (MDP) which can be solved in a tractable manner using standard Dynamic Programming algorithms.

[1]  Maciej Koutny,et al.  Branching Processes of High-Level Petri Nets , 2003, TACAS.

[2]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[3]  Tadao Murata,et al.  A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs , 1988, IEEE Trans. Software Eng..

[4]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[5]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[6]  Maciej Koutny,et al.  Towards an Efficient Algorithm for Unfolding Petri Nets , 2001, CONCUR.

[7]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[8]  Albert Benveniste,et al.  Markov nets: probabilistic models for distributed and concurrent systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[9]  Maciej Koutny,et al.  Parallelisation of the Petri Net Unfolding Algorithm , 2002, TACAS.