Abstract
This paper presents an approach to solve the least-cost transition sequences estimation problem in labelled time Petri net (LTPN) systems with unobservable transitions. Particularly, the considered LTPN system is bounded, in which each transition has a nonnegative cost and is labelled as either observable or unobservable. We first introduce a graph, called a segmented modified state class graph (SMSCG), that is a compact representation of the partial state space of an LTPN system. Based on the SMSCG and an observed time-label sequence, a method to estimate logic consistent transition sequences is proposed. By exploiting the transitions-related timing constraints in SMSCGs, a procedure for determining which logic consistent transition sequences are timing consistent with the observed time-label sequence and a given time is reported. Finally, we develop an algorithm to perform the estimation of least-cost transition sequences.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
