Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  proposes an approach for estimating the least-cost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each transition in the labeled net is associated with a (possibly empty) label and also with a nonnegative cost which captures its likelihood (e.g., in terms of the amount of workload or por required to execute the transition). Given full knowledge of the structure of the labeled Petri net and the observation of a sequence of labels,  aim at finding the transition firing sequence(s) that is (are) consistent with both the observed label sequence and the Petri net, and also has (have) the least total cost (i.e., the least sum of individual transition costs). The existence of unobservable transitions makes this task extremely challenging since the number of firing sequences that might be consistent can potentially be infinite. Under the assumption that the unobservable transitions in the net form an acyclic subnet and have strictly positive costs,  develop a recursive algorithm that is able to find the least-cost firing sequence(s) by reconstructing only a finite number of firing sequences. In particular, if the unobservable transitions in the net are contact-free, the proposed recursive algorithm finds the least-cost transition firing sequences with complexity that is polynomial in the length of the observed sequence of labels.
['Lingxi Li', 'Christoforos N. Hadjicostis']
I am writing a research paper on a idea Least-Cost Transition Firing Sequence Estimation in Labeled Petri Nets With Unobservable Transitions
[{"from": "human", "value": "I am writing a research paper on a idea Least-Cost Transition Firing Sequence Estimation in Labeled Petri Nets With Unobservable Transitions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  proposes an approach for estimating the least-cost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each transition in the labeled net is associated with a (possibly empty) label and also with a nonnegative cost which captures its likelihood (e.g., in terms of the amount of workload or por required to execute the transition). Given full knowledge of the structure of the labeled Petri net and the observation of a sequence of labels,  aim at finding the transition firing sequence(s) that is (are) consistent with both the observed label sequence and the Petri net, and also has (have) the least total cost (i.e., the least sum of individual transition costs). The existence of unobservable transitions makes this task extremely challenging since the number of firing sequences that might be consistent can potentially be infinite. Under the assumption that the unobservable transitions in the net form an acyclic subnet and have strictly positive costs,  develop a recursive algorithm that is able to find the least-cost firing sequence(s) by reconstructing only a finite number of firing sequences. In particular, if the unobservable transitions in the net are contact-free, the proposed recursive algorithm finds the least-cost transition firing sequences with complexity that is polynomial in the length of the observed sequence of labels."}]