Minimum initial marking estimation in labeled Petri nets
Abstract
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.
References
[1]
T. Murata, "Petri nets: properties, analysis and applications," Proceedings of the IEEE, vol. 77, no. 4, pp. 541-580, April 1989.
[2]
C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, Springer, 1999.
[3]
A. Giua, "Petri net state estimators based on event observation," in Proc. 36th IEEE Int. Conf. Decision and Control, pp. 4086-4091, December 1997.
[4]
A. Giua and C. Seatzu, "Observability of place/transition nets," IEEE Trans. on Automatic Control, vol. 47, no. 9, pp. 1424- 1437, September 2002.
[5]
A. Giua, J. Julvez, and C. Seatzu, "Marking estimation of Petri nets based on partial observation," in Proc. American Control Conf., pp. 326-331, June 2003.
[6]
A. Giua, C. Seatzu, and D. Corona, "Marking estimation of Petri nets with silent transitions," IEEE Trans. on Automatic Control, vol. 52, no. 9, pp. 1695-1699, September 2007.
[7]
Y. Ru and C. N. Hadjicostis, "State estimation in discrete event systems modeled by labeled Petri nets," in Proc. 45th IEEE Int. Conf. Decision and Control, pp. 6022-6027, December 2006.
[8]
Y. Ru and C. N. Hadjicostis, "Bounds on the number of markings consistent with label observations in Petri nets." To appear in IEEE Trans. on Automation Science and Engineering.
[9]
D. Kiritsis, K.-P. Neuendorf, and P. Xirouchakis, "Petri net techniques for process planning cost estimation," Advances in Engineering Software, vol. 30, no. 6, pp. 375-387, June 1999.
[10]
L. Li and C. N. Hadjicostis, "Least-cost planning sequence estimation in labeled Petri nets." To appear in Transactions of the Institute of Measurement and Control, Special Issue on "Planning and Scheduling in Complex Systems."
[11]
S. Lin, T. Kasami, T. Fujiwara, and M. Fossorier, Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes, Kluwer Academic Publishers, 1998.
[12]
R. Bellman, Dynamic Programming, Princeton University Press, 1957.
Index Terms
- Minimum initial marking estimation in labeled Petri nets
Index terms have been assigned to the content through auto-classification.
Recommendations
Marking Observer of Labeled Petri Nets with Uncertainty in the Initial Marking
SMC '13: Proceedings of the 2013 IEEE International Conference on Systems, Man, and CyberneticsIn this paper we consider marking estimation in labeled Petri nets whose initial marking is known to belong to a given convex set. We allow for silent transitions (i.e., transitions labeled with the empty word) and indistinguishable transitions (i.e., ...
Resource Bisimilarity in Petri Nets is Decidable
Special Issue of Invited Papers in Honor of the Boris Trakhtenbrot CentenaryPetri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (a submultiset) of ...
On–The–Fly Diagnosability Analysis of Bounded and Unbounded Labeled Petri Nets Using Verifier Nets
Advanced Diagnosis and Fault-Tolerant Control Methods (special section, pp. 233-333), Vicenç Puig, Dominique Sauter, Christophe Aubrun, Horst Schulte (Eds.)AbstractThis paper considers the problem of diagnosability analysis of discrete event systems modeled by labeled Petri nets (LPNs). We assume that the LPN can be bounded or unbounded with no deadlock after firing any fault transition. Our ...
Comments
Information & Contributors
Information
Published In
June 2009
5820 pages
ISBN:9781424445233
Publisher
IEEE Press
Publication History
Published: 10 June 2009
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in