Minimum initial marking estimation in labeled Petri nets

This paper develops an algorithm for estimating the minimum initial marking based on the observation of a sequence of labels that is produced by underlying transition activity in a given labeled Petri net. We assume that the structure of the net is completely known while the initial marking of the net is unknown. Given the observation of the sequence of labels, we aim to estimate the minimum initial marking of the net, i.e., an initial marking that (i) allows for the firing of at least one sequence of transitions that is consistent with both the observed sequence of labels and the net structure; and (ii) has the least total number of tokens (i.e., the minimum number of tokens summed over all places). We develop a recursive algorithm that can be used online to find the minimum initial marking with complexity that is polynomial in the length of the observed label sequence. Such minimum initial markings are useful for characterizing the minimum number of resources required at initialization for a variety of systems.

[1]  Christoforos N. Hadjicostis,et al.  Bounds on the Number of Markings Consistent With Label Observations in Petri Nets , 2009, IEEE Transactions on Automation Science and Engineering.

[2]  Dimitris Kiritsis,et al.  Petri net techniques for process planning cost estimation , 1999 .

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

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

[5]  Alessandro Giua,et al.  Marking Estimation of Petri Nets With Silent Transitions , 2007, IEEE Transactions on Automatic Control.

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

[7]  Stéphane Lafortune,et al.  Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case , 2011, IEEE Transactions on Automatic Control.

[8]  Christoforos N. Hadjicostis,et al.  Least-cost planning sequence estimation in labelled Petri nets , 2011 .

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

[10]  Toshimasa Watanabe.  Minimum initial marking problems of Petri nets , 1989 .

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

[12]  Panos J. Antsaklis,et al.  Petri net supervisors for DES with uncontrollable and unobservable transitions , 2000, IEEE Trans. Autom. Control..

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

[14]  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.

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

[16]  Christoforos N. Hadjicostis,et al.  Fault Diagnosis in Discrete Event Systems Modeled by Partially Observed Petri Nets , 2009, Discret. Event Dyn. Syst..

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