In this paper, we present an improved method for the state estimation of a labeled time Petri net (LTPN) system with unobservable transitions. Precisely, we provide a computationally efficient graph, called an observe...
详细信息
In this paper, we present an improved method for the state estimation of a labeled time Petri net (LTPN) system with unobservable transitions. Precisely, we provide a computationally efficient graph, called an observed modified state class graph (OMSCG), that represents a partial state space of an LTPN system based on the logic label sequence of an observed time-label sequence (TLS), motivated by the modified state class graph reported in the literature. Taking advantage of the OMSCG, we can effectively estimate all the transition sequences that are logically consistent with a TLS. By employing the transitions-related timing constraints of the OMSCG, we then present an approach to determine the set of transition sequences that are timing consistent with a timed observation (i.e., a TLS observed at a time instant) by solving linear programming problems. Finally, we provide an algorithm to implement the state estimation of an LTPN system under a timed observation.
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 boun...
详细信息
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.
modified state class graph collects in a compact form the main information on all the possible evolutions of a given labeled TPN system initialized at a given marking. Recently, it has been used to solve different pro...
详细信息
modified state class graph collects in a compact form the main information on all the possible evolutions of a given labeled TPN system initialized at a given marking. Recently, it has been used to solve different problems, in particular supervisor control synthesis, state estimation and system validation. It employs a symbolic characterization of the firing time intervals of the enabled transitions. This paper presents a set of MATLAB functions implementing the computation of MSCG in different ways, useful for applications. Copyright (C) 2022 The Authors.
modified state class graph collects in a compact form the main information on all the possible evolutions of a given labeled TPN system initialized at a given marking. Recently, it has been used to solve different pro...
详细信息
modified state class graph collects in a compact form the main information on all the possible evolutions of a given labeled TPN system initialized at a given marking. Recently, it has been used to solve different problems, in particular supervisor control synthesis, state estimation and system validation. It employs a symbolic characterization of the firing time intervals of the enabled transitions. This paper presents a set of MATLAB functions implementing the computation of MSCG in different ways, useful for applications.
暂无评论