A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On State Estimation of Timed Choice-Free Petri Nets
2011
IFAC Proceedings Volumes
In this paper, we present an online algorithm for state estimation of timed choice-free Petri nets. We assume that the net structure and initial marking are known, and that the set of transitions is divided in observable and unobservable one. Given an observed word and assuming that the time durations associated to the unobservable transitions are unknown, our problem is to estimate the possible states in which the timed net system can be. This work extends the notion of basis markings defined
doi:10.3182/20110828-6-it-1002.01523
fatcat:xn4lmulom5emnamymf5raxj244