Least-Cost Transition Firing Sequence Estimation in Labeled Petri Nets

This paper develops a recursive algorithm for estimating the least-cost transition firing sequence(s) based on the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each transition in the given net is associated with a nonnegative cost which could represent its likelihood (e.g., in terms of the amount of workload or power required to execute the transition). Given the structure of a labeled Petri net and the observation of a sequence of labels, we aim at finding the transition firing sequence(s) that has (have) the least total cost and is (are) consistent with both the observed label sequence and the Petri net. We develop a recursive algorithm that finds the least-cost transition firing sequence(s) with complexity that is polynomial in the length of the observed label sequence and is thus amenable to online event estimation and monitoring. An example of two parallel working machines is also provided to illustrate the algorithm

[1]  Toshimasa Watanabe,et al.  An approximation algorithm for the legal firing sequence problem of Petri nets , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[2]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[3]  Alessandro Giua.  Petri net state estimators based on event observation , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[4]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[5]  Alessandro Giua,et al.  Observability of place/transition nets , 2002, IEEE Trans. Autom. Control..

[6]  Francesco Basile,et al.  Petri net control using event observers and timing information , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[7]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[8]  Jean-Marie Proth,et al.  Petri nets : a tool for design and management of manufacturing systems , 1996 .

[9]  Toshimasa Watanabe,et al.  Legal firing sequence and related problems of Petri nets , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[10]  Alessandro Giua,et al.  Marking estimation of Petri nets with silent transitions , 2004 .

[11]  Shu,et al.  TRELLISES AND TRELLIS-BASED DECODING ALGORITHMS FOR LINEAR BLOCK CODES Part 3 , .

[12]  Toshimasa Watanabe,et al.  A linear time algorithm solving the legal firing sequence problem for a class of edge-weighted cactuses , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[13]  C.N. Hadjicostis,et al.  State Estimation in Discrete Event Systems Modeled by Labeled Petri Nets , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[14]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[15]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[16]  T. Watanabe,et al.  The legal firing sequence problem of Petri nets with state machine structure , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[17]  C. Seatzu,et al.  Marking estimation of Petri nets based on partial observation , 2003, Proceedings of the 2003 American Control Conference, 2003..

[18]  Simon Peck,et al.  Practice of Petri Nets in Manufacturing , 1993 .