An Efficient Heuristics for Minimum Time Control of Continuous Petri nets
|
|
- John Sherman
- 6 years ago
- Views:
Transcription
1 An Efficient Heuristics for Minimum Time Control of Continuous Petri nets Hanife Apaydin-Özkan, Jorge Júlvez, Cristian Mahulea, Manuel Silva Instituto de Investigación en Ingeniería de Aragon (I3A), Universidad de Zaragoza, Spain ( s: hapaydin, julvez, cmahulea, Abstract: This paper considers the problem of controlling timed continuous Petri nets under infinite server semantics. The proposed control strategy assigns piecewise constant flows to transitions in order to reach the target state. First, by using linear programming, a method driving the system from the initial to the target state through a linear trajectory is developed. Then, in order to improve the time of the trajectory, intermediate states are added by means of bilinear programming. Keywords: Timed continuous Petri nets, minimum time control, piecewise linear trajectory 1. INTRODUCTION Petri nets (PNs) are frequently used for modeling, analysis and synthesis of discrete event systems. The distributed state or marking of a PN is given by a vector of natural numbers which represent the number of tokens in each place. Similarly to most formalisms for discrete event systems, PNs suffer from the state explosion problem. One possible way to overcome this problem is fluidification, a classical relaxation technique. Continuous Petri nets are a fluid approximation of classical discrete Petri nets (David and Alla (2005); Silva and Recalde (200)). Unlike conventional PNs, a transition in a continuous Petri net can be fired in a real non integer quantity. This leads to continuous markings instead of discrete ones. Similarly to discrete PNs, a time delay can be associated to the firing of transitions, the resulting net is called timed continuous Petri net (contpn). As in discrete PNs, different server semantics can be adopted for the firing of transitions. Among them the most widely used semantics are finite server and infinite server. In Mahulea et al. (2009), it is shown that infinite server semantics provides a better approximation of the steady state throughput than finite server semantics for a wide class of Petri nets under some general conditions. A ContPN system with infinite server semantics is a subclass of Piecewise Linear Systems (PWL), with input constraints. A PWL system is composed of several linear subsystems together with switching rules. Many works This work was partially supported by CICYT - FEDER projects DPI , TIN , and by the European Communitys Seventh Framework Programme under project DISC (Grant Agreement n. INFSO-ICT-2298). The work of H.Apaydin-Özkan was supported in part by the Diputacin General de Aragón for one year stay in the Group of Zaragoza; on leave from Faculty of Electrical and Electronics Engineering, Anadolu University, Eskisehir, Turkey. This paper has been written in honor to Prof. L. Recalde, who passed away last December. deal with stability analysis or control law design of such systems (Montagner et al. (2006); Yang et al. (2006); Habets et al. (2006)). However, most of these methods cannot be directly applied to contpns, because of their particular dynamic input constraints. Control of contpns with infinite server semantics has already been considered in the literature. In Mahulea et al. (2008b) it is shown that, the optimal steady state control problem of timed contpn system can be solved by means of Linear Programming Problem (LPP) when all transitions are assumed to be controllable. The transitory control problem is also solved by means of implicit and explicit MPC control strategy (Mahulea et al. (2008a)). A Lyapunov-function-based dynamic control algorithm was proposed in (Xu et al. (2008)), which can ensure global convergence of both system states and input signals. In contrast to the method in this last reference, the technique proposed here for the computation of control law for direct linear trajectory is based on linear programming instead of nonlinear programming. Although the complexity of this new approach is significantly lower, i.e., it can be solved in polynomial time, the time of the obtained trajectory is very similar in general. Moreover, the method in (Xu et al. (2008)) requires solving a BiLinear Programming Problem (BLP) for the computation of intermediate states as our method requires. Refinement of the trajectory by means of intermediate states is carried out by a recursive algorithm which computes new intermediate states until the time can not be improved significantly. In this work, we design a control strategy which aims at driving the system from an initial state to a target one by minizing the time. The proposed strategy computes first the control actions to drive the system to the target state through a straight line. Such control actions are the result of solving a LPP. Then, as in Xu et al. (2008), in order to obtain faster trajectories, intermediate states, not necessarily on the line connecting the initial and the target marking, are computed by means of a BLP. Moreover,
2 an algorithm that recursively refines the initially obtained trajectory is given. This paper is structured as follows. Section 2 briefly introduces the required concepts of contpn systems and introduces the formulation of applied control. A LPP based method to obtain linear trajectories in order to reach target marking, m f, from initial marking m 0 is given in Section 3. In Section, the heuristics for minimizing time by means of intermediate states is considered. Finally, some conclusions and future directions are drawn in Section CONTINUOUS PETRI NETS We assume that the reader is familiar with discrete PNs. In contpn systems, the firing is not restricted to the natural numbers but to the nonnegative real numbers. 2.1 Timed Continuous Petri nets Definition 1. A continuous PN system is a pair N, m 0 where N = P, T, Pre, Post is the net structure with the set of places P, the set of transitions T, pre and post P T matrices Pre, Post R 0 and m 0 R P 0 is the initial state. Let p i, i = 1,..., P and t j, j = 1,..., T denote the places and transitions. For a place p i P and a transition t j T, Pre ij and Post ij represent the weights of the arcs from p i to t j and from t j to p i, respectively. Each place p i has a marking denoted by m i R 0. The vector of all token loads is called state or marking, and is denoted by m R P 0. For every node v P T, the sets of its input and output nodes are denoted as v and v, respectively. A transition t j T is enabled at m iff p i t j, m i > 0 and its enabling degree is given by { } mi enab(t j, m) = min p i t j Pre ij which represents the maximum amount in which t j can fire. An enabled transition t j can fire in any real amount α, with 0 < α enab(t j, m) leading to a new state m = m+α C j where C = Post Pre is the token flow matrix and C j is its j th column. If m is reachable from m 0 through a finite sequence σ, the state (or fundamental) equation is satisfied: m = m 0 + C σ, where σ R T 0 is the firing count vector, i.e., σ j is the cumulative amount of firings of t j in the sequence σ. Definition 2. A contpn system N, λ, m 0 is a continuous PN system N, m 0 together with a vector λ R T >0 where λ j is the firing rate of transition t j. The state equation has an explicit dependence on time, denoted by τ: m(τ) = m 0 + C σ(τ) which through time differentiation becomes ṁ(τ) = C σ(τ). The derivative of the firing sequence f(τ) = σ(τ) is called the firing flow. Depending on how the flow is defined, many firing semantics appear, being the most used ones infinite and finite server semantics. This paper deals with infinite server semantics for which the flow of a transition t j is defined as: f j (τ) = λ j enab(t j, m(τ)) = λ j min p i t j { } mi (τ) Pre ij Since the flow of a transition depends on its enabling degree which is based on the minimum function, a timed contpn with infinite server semantics is a PWL system with polyhedral regions and everywhere continuous vector field. The state space (or reachability set) R of a contpn system can be divided into regions 1 as follows: R = R 1... R γ where γ T j=1 t j. Intuitively, each R z denotes a region where the flow is limited by the same subset of places (one for each transition). More formally, two markings m a and m b belong to the same region R z iff [ t T and p u, p v t it holds that m a (p u ) m a (p v ) m b (p u ) m b (p v )]. For a given R z, we can define the constraint matrix Π z R P 0 as follows. Let m be an interior point of Rz, then Π z is defined as: { } 1 m i mh Π z, if = min ji = Pre ij Pre ij p h t j Pre hj (2) 0, otherwise (1) If marking m belongs to R z, we denote Π(m) = Π z the corresponding constraint matrix (if m is a border point and belongs to several regions, Π(m) is the constraint matrix of any of these regions). In the constraint matrix, each row j = 1, 2..., T has only one non-null element in the position i that corresponds to the place p i that restricts the flow of transition t j. Furthermore, the firing rate of transitions can also be represented by a diagonal matrix Λ = diag{λ 1,...λ T }. Using this notation, the nonlinear flow of the transitions at a given state m can be written as: f = Λ Π(m) m (3) Example 3. Let us consider the PN in Fig. 1. Assume λ = [ 1 3 1] T, m 0 = [ ] T and m f = [ ] T. p5 p6 p7 Fig. 1. A PN taken from (Zhou et al. (1990)) 1 These regions are disjoint except possibly on the borders. p1 p2 p3 p t1 t2 t3 t p8
3 Independently of m 0, the system dynamics is described as follows: 1 = f f 1 = λ m λ 1 min{m 5, m 1, m 8 } 2 = f 1 f 2 = λ 1 min{m 5, m 1, m 8 } λ 2 min{m 2, m 6 } 3 = f 2 f 3 = λ 2 min{m 2, m 6 } λ 3 min{m 3, m 7, m 8 } = f 3 f = λ 3 min{m 3, m 7, m 8 } λ m 5 = f 2 f 1 = λ 2 min{m 2, m 6 } λ 1 min{m 5, m 1, m 8 } 6 = f 3 f 2 = λ 3 min{m 3, m 7, m 8 } λ 2 min{m 2, m 6 } 7 = f f 3 = λ m λ 3 min{m 3, m 7, m 8 } 8 = f 2 + f f 1 f 3 = λ 2 min{m 2, m 6 } + λ m λ 1 min{m 5, m 1, m 8 } λ 3 min{m 3, m 7, m 8 } () Note that m 0 and m f are in different regions: m 0 R 1 : {m m 5 m 1, m 5 m 8, m 8 m 7, m 8 m 3, m 2 m 6 } and m f R 2 : {m m 5 m 1, m 5 m 8, m 8 m 7, m 8 m 3, m 6 m 2 }. For example, the system dynamics for R 1 are: 1 = m m 5 2 = m 5 m 2 3 = m 2 3 m 8 = 3 m 8 m 5 = m 2 m 5 6 = 3 m 8 m 2 7 = m m 8 8 = m 2 + m m m Controlled Timed Continuous Petri Nets (5) In this section we consider contpn systems subject to external control actions, and assume that the only admissible control law consists in slowing-down the firing speed of transitions (Silva and Recalde (200)). If a transition can be controlled (its flow can be reduced or even stopped), we will say that it is a controllable transition (Mahulea et al. (2008b)). Definition. The controlled flow, w, of a timed contpn is defined as w(τ) = f(τ) u(τ), with 0 u(τ) f(τ), where f is the flow of the uncontrolled system, i.e., defined as in (1), and u is the control action. Therefore, the control input u is dynamically upper bounded by the flow f of the corresponding unforced system. Under these conditions, the overall behaviour of the system in which all transitions are controllable is ruled by the following system: ṁ = C [f u] = C w (6) 0 u f The constraint 0 u f can be rewritten as 0 f u f. Defining w = f u and using (3), the constraint can be expressed as: 0 w Λ Π(m) m (7) The following sections show how to compute a control action u that drives the system from the initial marking m 0 to a desired target marking m f. Section 3 describes a method to obtain a linear trajectory. Section makes use of such a method to compute piecewise linear trajectories in order to improve the time to reach m f. Notice that in order to be reachable, m f necessarily satisfies the state equation, i.e., m f = m 0 +C σ. Our procedure consists of assigning constant controlled flow w that satisfies dynamic upper bounds. We assume that m 0 and m f are interior points of the reachability space, i.e., the markings are strictly positive. The assumption that m 0 is positive ensures that the system can move at τ = 0 in the direction of m f ; the assumption that m f is positive ensures that m f can be reached (Júlvez et al. (2003)) in finite time (Mahulea et al. (2008b)). 3. COMPUTATION OF LINEAR TRAJECTORIES In this section, we will distinguish two cases: (A) m 0 and m f are in the same region and (B) they are in different regions. In this last case the crossing points of the straight line and borders must be considered. (A) m 0 and m f are in the same region R z. Then all the states on the straight line connecting them are also interior points of R z since all the regions are convex. The following LPP computes the correspondig control law, where x = w τ f, min τ f m f = m 0 + C x 0 x j λ j Π z ji min { } m 0i, m f i τf, (8) j {1,.., T } where i satisfies Π z ji 0 (b) The equations correspond to: the time dependent equation of the straight line connecting m 0 to m f, (b) flow constraints in (7). Notice that (8)(b) is a linear constraint because m 0i and m fi are known. (B) m 0 and m f are in different regions. The line connecting m 0 and m f can be divided in several segments, each one starting in a border (or in m 0 for the first segment) and ending in a border (or in m f for the last one). Then LPP (8) is applied on each of these segments. Algorithm 1 computes the total time τ f by using LPP in (8) for the linear trajectory l from m 0 to m f which crosses n {1, 2,.., γ} borders. In this algorithm, m i c stands for state at the intersection of l and i th crossed border (starting from m 0 ) i {1, 2,.., n}. m 0 c and m n+1 c denote m 0 and m f, respectively. w i is the flow obtained from the state m i c to the state m i+1 c. Note that, if l does not cross any border, then n = 0, that is m 0 c = m 0 and m 1 c = m f. Algorithm 1 Linear trajectory Input: N, m 0, m f Compute the line l connecting m 0 and m f Compute the intersection of l and the crossed borders: m 1 c, m 2 c,...m n c m 0 c = m 0, m n+1 c = m f for i = 0 to n do Determine τ i by solving LPP in (8) with m 0 = m i c and m f = m i+1 c end for Output: τ 1, w 1, τ 2, w 2,..., τ n+1, w n+1, τ f = n+1 i=1 τ i Proposition 5. Let N, λ, m 0 be a contpn system with m 0 > 0. If m f belongs to R and m f > 0: LPP(8) is feasible The control action given by Algorithm 1 ensures that m f is reached in finite time. Proof. Since m f is a reachable marking, then there exists x such that the state equation is satisfied 8.
4 By taking τ f sufficiently large 8(b) can be satisfied since λ j Π z ji min { } m 0i, m f i > 0. Then, by (Júlvez et al. (2003)) the linear trajectory from m 0 to m f can be followed by the system since m 0 > 0 and m f > 0, i.e., all intermediate states are not spurious. Moreover, since m f > 0, by (Mahulea et al. (2008b)) m f can be reached in finite time. Example 6. Let us consider the control law design for the contpn in Ex. 3. Assume the same λ, m 0 and m f. Note that the line l connecting m 0 and m f crosses only one border: m 2 = m 6 and the crossing point is calculated as: m 1 c = [ ]T, m 0 c = m 0, m 2 c = m f. The trajectory is illustrated in Fig.2. According m m 0 m c 1 R m 2 Fig. 2. Trajectory for Ex. 6 to Algorithm 1, first LPP (8) with m 0 = m 0 c and m f = m 1 c is solved. Its constraints are: 7.33 = x x = x 1 x = x 2 x = x 3 x = x 2 x = x 3 x = x x = x 2 + x x 1 x x τ f 0 x 2.5 τ f (b) 0 x τ f 0 x 1.66 τ f The optimal solution is τ f = 0.2 t.u. and w 1 = 2.9, w 2 = 1.67, w 3 = 0, w = In the second case, i.e., m 0 = m 1 c and m f = m 2 c: 7 = x x = x 1 x = x 2 x = x 3 x = x 2 x = x 3 x = x x = x 2 + x x 1 x x 1 τ f 0 x 2 τ f (b) 0 x τ f 0 x τ f The optimal solution is τ f = 0.67 t.u. and w 1 = 1.5, w 2 = 1, w 3 = 0, w = 1. The total time to go from m 0 to m f through the line l is τ total = = 0.87 t.u. And the control is obtained as: R 2 m f m 5 (τ) 2.9 m 2 (τ) m 8 (τ), if 0 τ 0.2 m (τ) 1.67 u(τ) = m 5 (τ) 1.5 m 2 (τ) 1 3 m 8 (τ), if 0.2 < τ 0.87 m (τ) 1 (9) Fig. 3 illustrates the convergence of the marking m 1 under the designed control law, while Fig. 3(b) shows the control signal u 1, w 1 and their upper bound. m time (t.u.) u 1 & w 1 and their upper bound 6 2 upper bound u 1 w time (t.u.) 0.87 (b) Fig. 3. Evolution of m 1 and (b) u 1, w 1 and and their upper bound for Ex. 6. A HEURISTICS FOR MINIMUM TIME CONTROL This section illustrates how to compose a piecewise linear trajectory by introducing intermediate states in order to improve the time duration to reach m f. The designed control in the previous subsection takes the system from m 0 to m f through a linear trajectory by minimizing the time duration. In some cases, i.e., when initial or final state have a small value, this may limit the speed of the response. In order to improve the time spent to move from m 0 to m f, intermediate states denoted by m k where k {1, 2...s}, that do not necessarily lie on the line from m 0 to m f, are computed. The new trajectory is obtained as the union of s + 1 segments: m 0 m 1 m 2... m s m f. In this work we consider the intermediate states in the range: { R I = m m i max{m fi, m 0i }, m i min{m fi, m 0i }, } i {1, 2,.., P }, (10) Because m 0, m f > 0, all m R I are positive and reachable (Júlvez et al. (2003)). We will describe how to compute intermediate states that lie on the borders and the interior of regions, separately..1 Intermediate states on the borders Let the line from m 0 to m f cross s borders, and pass through s + 1 different regions: R 1, R 2,..., R s+1 with corresponding constraint matrices Π 1, Π 2...Π s+1. We assign constant flows for each transitions during each line segments and the intermediate states on each border: m 1, m 2...m s. Under these assumptions, the following
5 BLP with m 0 = m 0 and m s+1 = m f and with the variables m 1, m 2,...,m s 1, m s, τ k, x k = w k τ k, k {1,...s} obtains the intermediate states that yield a minimum time trajectory: s+1 min k=1 τ k m k+1 = m k + C x k+1, k {0, 1, 2,.., s} (Π k Π k+1 ) m k = 0, k {1, 2,.., s} (b) m k i mk+1 i m k i m k+1 i if m 0i m fi i { 1,2.. P }, k {0, 1, 2,.., s} if m 0i m fi i { 1,2.. P }, k {0, 1, 2,.., s} 0 x k j λ j Π k ji min{m k 1 i, m k i } τ k, with p i st. Π k ji (c) (d) 0, j {1, 2... T }, k {1, 2..s} (e) (11) The constraints correspond to the time dependent equation of the connecting m k to m k+1 : m k+1 = m k +C w k+1 τ f and m k is a reachable marking; (b) m k is on the crossed border; (c & d) m k is contained in the hypercube defined by the corners m k 1 and m k+1 ; (e) the constraints on the controlled flow..2 Interior intermediate states In the case that m 0 and m f are in the same region R z a recursive method can be used to determine intermediate states. The same recursive method can also be applied to find additional intermediate states between m k and m k+1, since they are on the borders of the same region. In this method we keep computing intermediate states until the time cannot be improved by a considerable amount. In this case, the BLP that will be solved in each step can be simplified to the following problem where m 0 and m f are known; τ 1, τ 2, m d, x 1 = w 1 τ 1, x 2 = w 2 τ 2 are variables: min τ 1 + τ 2 m d = m 0 + C x 1 m f = m d + C x 2, m d = m 0 + C σ, m d, σ 0 (b) min{m fi, m 0i } m d i max{m f i, m 0i }, i {1, 2... P } (c) 0 x 1 j λ j Π z ji min{m 0i, m d i } τ 1, with i st. Π k ji 0, j {1, 2... T } 0 x 2 j λ j Π z ji min{m d i, m fi } τ 2, with i st. Π k ji 0, j {1, 2... T } (d) (12) Algorithm 2 expresses the recursive method we proposed. It computes new intermediate states until the stopping criterion is satisfied. It is satisfied when the time of the trajectory cannot be decreased more than a given value ǫ. In the algorithm, path is a global variable storing the ordered set of couples of states in the trajectory and the relative times to reach them. The number of states in path is denoted by size(path) and the i th element of the set path is denoted by path(i). Algorithm 2 Piecewise Linear Trajectory Input: N, m 0, m f, ǫ Global variable: path Compute the line l connecting m 0 and m f Determine the number of crossed borders: s if s = 0 then Solve (8) to obtain τ f path 0 = {(m 0, 0), (m f, τ f )} else Solve (11) to obtain τ f path 0 = {(m 0, 0), (m 1, τ 1 ),..., (m f, τ f )} end if τ x = τ f, path = path 0 for i = 1 : size(path 0 ) 1 do (m x, τ x ) = path 0 (i), (m y, τ y ) = path 0 (i + 1) Call Split function with ((m x, τ x ), (m y, τ y )) end for Calculate the total time for path, i.e., τ y Output:path Split function Input: (m x, τ x ), (m y, τ y ) Solve (12) to obtain τ 1, τ 2, m d if τ y (τ 1 + τ 2 ) > ǫ then Insert (m d, τ 1 ) in path Change (m y, τ y ) in path by (m y, τ 2 ) Call Split function with ((m x, τ x ), (m d, τ 1 )) Call Split function with ((m d, τ 1 ), (m y, τ 2 )) end if Example 7. Let us consider the contpn system considered in Ex. 6, again. Since the linear trajectory between m 0 and m f crosses only one border, s = 1 and solving (11) with s = 1 yields 0.83 t.u. as a total time. And the new path is m 0 m 1 m f, where m 1 = [ ] T. For an additional intermediate state, say m 1, between m 0 and m 1, we solve (12) for m 0 = [ ] T and m f = m 1. Similarly, for an additional intermediate state between m 1 and m f, say m 2, we solve (12) for m 0 = m 1 and m f = [ ] T. And the new path m 0 m 1 m 1 m 2 m f is obtained, where m 1 = [ ] T and m 2 = [ ] T. The total time is reduced to 0.7 t.u. with the control action u(τ) = [ m 5 (τ) 1.73 m 2 (τ) m 8 (τ) m (τ) ] T for 0 τ 0.15; u(τ) = [ m 5 (τ) 1.5 m 2 (τ) m 8 (τ) m (τ) 1.5] T for 0.15 τ 0.3; u(τ) = [ m 5 (τ) 1.23 m 6 (τ) 3 m 8 (τ) m (τ) 1.227] T for 0.3 τ 0.51; u(τ) = [ m 5 (τ) 3.21 m 6 (τ) m 8 (τ) m (τ) 1] T for 0.51 τ 0.7. The trajectories for one and three intermediate states are illustrated in Fig. and Fig. (b), respectively. In these figures dotted line shows the border between R 1 and R 2. The total time duration for several intermediate states can be found in Table 1. The experiments were performed by a Matlab program running on a PC with Intel(R) Core(TM)2CPU 1.83GHz, 2.00 GB of RAM.
6 m m 0 m 1 R 1 R 2 The heuristics proposed in this paper computes first a rough piecewise linear trajectory that is refined afterwards in those intervals that allow an improvement. The heuristics makes use of BPPs to obtain intermediate states and LPPs to compute linear trajectories. The refinement of the trajectory is achieved recursively. m m m 0 m 1 m 1 R 1 m m 2 (b) Fig.. Trajectory for 1 int. state and (b)3 int. state for Ex. 7 Table 1. Intermediate States Number of int. states Total duration (t.u.) CPU time (sec.) Example 8. Let us consider the net in Fig. 5 with λ = [3 1 1] T. By using Algorithm 1, the total time to reach m f = [ ] T from m 0 = [ ] T through a linear trajectory is obtained as 2.3 t.u., with the control u(τ) = [3 m (τ) 7 m 2 (τ) m 3 (τ) 1] T for 0 τ 0.93, u(τ) = [3 m (τ) 12 m (τ) m 3 (τ) 1.71] T for 0.93 τ 1.26, u(τ) = [3 m 1 (τ) 3 m 2 (τ) m 3 (τ) 0.2] T for 1.26 τ 2.3, while m f was reached in. t.u. in (Xu et al. (2008)). The piecewise linear trajectory with intermediate states obtained by Algorithm 2 yields 1.38 t.u. Fig. 5. A PN p 2 t p 1 t 1 p R 2 5. CONCLUSION 3 m f m f p 3 t 3 REFERENCES David, R. and Alla, H. (2005). Autonomous and timed continuous Petri nets. Springer, Berlin. Habets, L., Collins, P., and van Schuppen, J. (2006). Reachability and control synthesis for piecewise-affine hybrid systems on simplices. Automatic Control, IEEE Transactions on, 51(6), doi: /tac Júlvez, J., Recalde, L., and Silva, M. (2003). On reachability in autonomous continuous Petri net systems. In W. van der Aalst and E. Best (eds.), 2 th International Conference on Application and Theory of Petri Nets (ICATPN 2003), volume 2679 of Lecture Notes in Computer Science, Springer, Eindhoven, The Netherlands. Mahulea, C., Giua, A., Recalde, L., Seatzu, C., and Silva, M. (2008a). Optimal model predictive control of timed continuous Petri nets. IEEE Transactions on Automatic Control, 53(7), Mahulea, C., Ramirez, A., Recalde, L., and M.Silva (2008b). Steady state control reference and token conservation laws in continuous Petri net systems. IEEE Transactions on Automation Science and Engineering, 5(2), Mahulea, C., Recalde, L., and Silva, M. (2009). Basic Server Semantics and Performance Monotonicity of Continuous Petri Nets. Discrete Event Dynamic Systems: Theory and Applications, 19(2), Montagner, V.F., Leite, V., Oliveira, R., and Peres, P. (2006). State feedback control of switched linear systems: An LMI approach. Journal of Computational and Applied Mathematics, 9(2), Silva, M. and Recalde, L. (200). On fluidification of Petri net models: from discrete to hybrid and continuous models. Annual Reviews in Control, 28(2), Xu, J., Recalde, L., and Silva, M. (2008). Tracking control of timed continuous Petri net systems under infinite servers semantics. In 17th World Congress of IFAC, Seoul, Korea. Yang, H., Xie, G., Chu, T., and Wang, L. (2006). Commuting and stable feedback design for switched linear systems. Journal of Computational and Applied Mathematics, 9(2), Zhou, M., DiCesare, F., and Guo, D. (1990). Modeling and performance analysis of a resource-sharing manufacturing system using stochastic Petri nets. In Fifth IEEE Symp. on Intelligent Control, Phildephia, PA. The control problem adressed in the paper consists of reaching a target state in minimum time through a piecewise linear trajectory. Besides the piecewise linear dynamics of continuous Petri nets, the control method handles the fact that the input constraints depend on the current marking, i.e., the inputs are dynamically constrained.
Approaching Minimum Time Control of Timed Continuous Petri nets
Approaching Minimum Time Control of Timed Continuous Petri nets Hanife Apaydin-Özkan, Jorge Júlvez, Cristian Mahulea, Manuel Silva Instituto de Investigación en Ingeniería de Aragon (I3A), Universidad
More informationApproaching minimum time control of timed continuous Petri nets -draft-
Approaching minimum time control of timed continuous Petri nets -draft- Hanife Apaydin-Özkan, Jorge Júlvez, C. Mahulea and Manuel Silva December 23, 2014 Abstract This paper considers the problem of controlling
More informationLinear programming techniques for analysis and control of batches Petri nets
Linear programming techniques for analysis and control of batches Petri nets Isabel Demongodin, LSIS, Univ. of Aix-Marseille, France (isabel.demongodin@lsis.org) Alessandro Giua DIEE, Univ. of Cagliari,
More informationOn Controllability of Timed Continuous Petri Nets
On Controllability of Timed Continuous Petri Nets C Renato Vázquez 1, Antonio Ramírez 2, Laura Recalde 1, and Manuel Silva 1 1 Dep de Informática e Ingeniería de Sistemas, Centro Politécnico Superior,
More informationFormal Analysis of Timed Continuous Petri Nets
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9 11, 008 Formal Analysis of Timed Continuous Petri Nets Marius Kloetzer, Cristian Mahulea, Calin Belta, Laura Recalde
More informationChapter 1 Continuous Petri nets: controllability and control
Chapter Continuous Petri nets: controllability and control Jorge Júlvez, C. Renato Vázquez, Cristian Mahulea and Manuel Silva Abstract Controllability is a property related to the capability of driving
More informationAnalysis and Simulation of Manufacturing Systems using SimHPN toolbox
Analysis and Simulation of Manufacturing Systems using SimHPN toolbox Jorge Júlvez, Cristian Mahulea, and Carlos-Renato Vázquez Abstract SimHP N is a software tool embedded in MAT- LAB that has been developed
More informationPerformance Control of Markovian Petri Nets via Fluid Models: A Stock-Level Control Example
Performance Control of Markovian Petri Nets via Fluid Models: A Stock-Level Control Example C. Renato Vázquez Manuel Silva Abstract Petri nets is a well-know formalism for studying discrete event systems.
More informationA REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS
A REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS Francesco Basile, Ciro Carbone, Pasquale Chiacchio Dipartimento di Ingegneria Elettrica e dell Informazione, Università
More informationHybrid Petri net model of a traffic intersection in a urban network
Hybrid Petri net model of a traffic intersection in a urban network C. Renato Vázquez, Herman Y. Sutarto, René Boel, Manuel Silva Abstract Control in urban traffic networks constitutes an important and
More informationOPTIMAL TOKEN ALLOCATION IN TIMED CYCLIC EVENT GRAPHS
OPTIMAL TOKEN ALLOCATION IN TIMED CYCLIC EVENT GRAPHS Alessandro Giua, Aldo Piccaluga, Carla Seatzu Department of Electrical and Electronic Engineering, University of Cagliari, Italy giua@diee.unica.it
More informationHYPENS Manual. Fausto Sessego, Alessandro Giua, Carla Seatzu. February 7, 2008
HYPENS Manual Fausto Sessego, Alessandro Giua, Carla Seatzu February 7, 28 HYPENS is an open source tool to simulate timed discrete, continuous and hybrid Petri nets. It has been developed in Matlab to
More informationModeling Continuous Systems Using Modified Petri Nets Model
Journal of Modeling & Simulation in Electrical & Electronics Engineering (MSEEE) 9 Modeling Continuous Systems Using Modified Petri Nets Model Abbas Dideban, Alireza Ahangarani Farahani, and Mohammad Razavi
More informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationModeling and Stability Analysis of a Communication Network System
Modeling and Stability Analysis of a Communication Network System Zvi Retchkiman Königsberg Instituto Politecnico Nacional e-mail: mzvi@cic.ipn.mx Abstract In this work, the modeling and stability problem
More informationModelling of Railway Network Using Petri Nets
Modelling of Railway Network Using Petri Nets MANDIRA BANIK 1, RANJAN DASGUPTA 2 1 Dept. of Computer Sc. & Engg., National Institute of Technical Teachers' Training & Research, Kolkata, West Bengal, India
More informationMODELING AND SIMULATION BY HYBRID PETRI NETS. systems, communication systems, etc). Continuous Petri nets (in which the markings are real
Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. MODELING AND SIMULATION BY HYBRID PETRI NETS Hassane Alla Latéfa Ghomri
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationIPA for Continuous Petri Nets with. Threshold-Based Flow Control
IPA for Continuous Petri Nets with 1 Threshold-Based Flow Control Alessandro Giua, Carla Seatzu, Yorai Wardi Abstract This paper considers an application of the Infinitesimal Perturbation Analysis IPA
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationControl of Hybrid Petri Nets using Max-Plus Algebra
Control of Hybrid Petri Nets using Max-Plus Algebra FABIO BALDUZZI*, ANGELA DI FEBBRARO*, ALESSANDRO GIUA, SIMONA SACONE^ *Dipartimento di Automatica e Informatica Politecnico di Torino Corso Duca degli
More informationDecidability of Single Rate Hybrid Petri Nets
Decidability of Single Rate Hybrid Petri Nets Carla Seatzu, Angela Di Febbraro, Fabio Balduzzi, Alessandro Giua Dip. di Ing. Elettrica ed Elettronica, Università di Cagliari, Italy email: {giua,seatzu}@diee.unica.it.
More informationAnalysis for Dynamic of Analog Circuits by using HSPN
Proceedings of the 11th WSEAS International Conference on CIRCUITS, Agios Nikolaos, Crete Island, Greece, July 23-25, 2007 207 Analysis for Dynamic of Analog Circuits by using HSPN MENG ZHANG, SHENGBING
More informationIMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS
IMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS D. Limon, J.M. Gomes da Silva Jr., T. Alamo and E.F. Camacho Dpto. de Ingenieria de Sistemas y Automática. Universidad de Sevilla Camino de los Descubrimientos
More informationAPPROXIMATION OF STOCHASTIC PROCESSES WITH CONTINUOUS PETRI NETS AND CLASSIFICATION METHODS
APPROXIMAION OF SOCHASIC PROCESSES WIH CONINUOUS PERI NES AND CLASSIFICAION MEHODS Dimitri Lefebvre, Edouard Leclercq, Nabil El Akchioui, Eduardo Souza de Cursis, Leila Khalij o cite this version: Dimitri
More informationElementary Siphons of Petri Nets and Deadlock Control in FMS
Journal of Computer and Communications, 2015, 3, 1-12 Published Online July 2015 in SciRes. http://www.scirp.org/journal/jcc http://dx.doi.org/10.4236/jcc.2015.37001 Elementary Siphons of Petri Nets and
More informationBisimilar Finite Abstractions of Interconnected Systems
Bisimilar Finite Abstractions of Interconnected Systems Yuichi Tazaki and Jun-ichi Imura Tokyo Institute of Technology, Ōokayama 2-12-1, Meguro, Tokyo, Japan {tazaki,imura}@cyb.mei.titech.ac.jp http://www.cyb.mei.titech.ac.jp
More informationGeorg Frey ANALYSIS OF PETRI NET BASED CONTROL ALGORITHMS
Georg Frey ANALYSIS OF PETRI NET BASED CONTROL ALGORITHMS Proceedings SDPS, Fifth World Conference on Integrated Design and Process Technologies, IEEE International Conference on Systems Integration, Dallas,
More informationA Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons
Proceedings of the 2001 IEEE International Conference on Robotics & Automation Seoul, Korea May 21-26, 2001 A Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons YiSheng Huang 1
More informationComplexity Analysis of Continuous Petri Nets
Fundamenta Informaticae 137 (2015) 1 28 1 DOI 10.3233/FI-2015-1167 IOS Press Complexity Analysis of Continuous Petri Nets Estíbaliz Fraca Instituto de Investigación en Ingeniería de Aragón (I3A) Universidad
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationNONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING. Alessandro Giua Xiaolan Xie
NONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING Alessandro Giua Xiaolan Xie Dip. Ing. Elettrica ed Elettronica, U. di Cagliari, Italy. Email: giua@diee.unica.it INRIA/MACSI Team, ISGMP, U. de Metz, France.
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationTHROUGHPUT ANALYSIS OF MANUFACTURING CELLS USING TIMED PETRI NETS
c 1994 IEEE. Published in the Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, San Antonio, TX, October 2 5, 1994. Personal use of this material is permitted. However,
More information540 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 4, APRIL Algorithmic Analysis of Nonlinear Hybrid Systems
540 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 4, APRIL 1998 Algorithmic Analysis of Nonlinear Hybrid Systems Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-Toi Abstract Hybrid systems are digital
More informationCONTINUOUS APPROXIMATION OF PEPA MODELS AND PETRI NETS
CONTINUOUS APPROXIMATION OF PEPA MODES AND PETRI NETS Vashti Galpin FCS, School of Informatics, University of Edinburgh, Scotland Email: Vashti.Galpin@ed.ac.uk KEYWORDS PEPA, Petri nets, continuous approximation,
More informationPetri Net Modeling of Irrigation Canal Networks
Petri Net Modeling of Irrigation Canal Networks Giorgio Corriga, Alessandro Giua, Giampaolo Usai DIEE: Dip. di Ingegneria Elettrica ed Elettronica Università di Cagliari P.zza d Armi 09123 CAGLIARI, Italy
More informationIMPULSIVE CONTROL OF DISCRETE-TIME NETWORKED SYSTEMS WITH COMMUNICATION DELAYS. Shumei Mu, Tianguang Chu, and Long Wang
IMPULSIVE CONTROL OF DISCRETE-TIME NETWORKED SYSTEMS WITH COMMUNICATION DELAYS Shumei Mu Tianguang Chu and Long Wang Intelligent Control Laboratory Center for Systems and Control Department of Mechanics
More informationTHE simulation of a continuous or discrete time system
770 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 28, NO. 6, DECEMBER 1998 Discrete Event Representation of Qualitative Models Using Petri Nets Alessandra Fanni, Member,
More informationOn Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays
Article On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays Thapana Nampradit and David Banjerdpongchai* Department of Electrical Engineering, Faculty of Engineering,
More informationIntuitionistic Fuzzy Estimation of the Ant Methodology
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Intuitionistic Fuzzy Estimation of the Ant Methodology S Fidanova, P Marinov Institute of Parallel Processing,
More information2 Theory. 2.1 State Space Representation S 2 S 1 S 3
In the following sections we develop the theory, illustrate the technique by applying it to a sample system, and validate the results using the method of enumeration. Notations: A-state functional (acceptable)
More informationThe ϵ-capacity of a gain matrix and tolerable disturbances: Discrete-time perturbed linear systems
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. IV (May - Jun. 2015), PP 52-62 www.iosrjournals.org The ϵ-capacity of a gain matrix and tolerable disturbances:
More informationComposition of product-form Generalized Stochastic Petri Nets: a modular approach
Composition of product-form Generalized Stochastic Petri Nets: a modular approach Università Ca Foscari di Venezia Dipartimento di Informatica Italy October 2009 Markov process: steady state analysis Problems
More informationSupervisory Control of Petri Nets with. Uncontrollable/Unobservable Transitions. John O. Moody and Panos J. Antsaklis
Supervisory Control of Petri Nets with Uncontrollable/Unobservable Transitions John O. Moody and Panos J. Antsaklis Department of Electrical Engineering University of Notre Dame, Notre Dame, IN 46556 USA
More informationFluid approximation of Petri net models with relatively small populations
Discrete Event Dyn Syst (2017) 27:525 546 DOI 10.1007/s10626-017-0238-9 Fluid approximation of Petri net models with relatively small populations Estíbaliz Fraca 1 Jorge Júlvez 1 Manuel Silva 1 Received:
More informationFrom Stochastic Processes to Stochastic Petri Nets
From Stochastic Processes to Stochastic Petri Nets Serge Haddad LSV CNRS & ENS Cachan & INRIA Saclay Advanced Course on Petri Nets, the 16th September 2010, Rostock 1 Stochastic Processes and Markov Chains
More informationResearch Article Stabilization Analysis and Synthesis of Discrete-Time Descriptor Markov Jump Systems with Partially Unknown Transition Probabilities
Research Journal of Applied Sciences, Engineering and Technology 7(4): 728-734, 214 DOI:1.1926/rjaset.7.39 ISSN: 24-7459; e-issn: 24-7467 214 Maxwell Scientific Publication Corp. Submitted: February 25,
More informationNecessary and Sufficient Conditions for Reachability on a Simplex
Necessary and Sufficient Conditions for Reachability on a Simplex Bartek Roszak a, Mireille E. Broucke a a Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto,
More informationMemoryless Control to Drive States of Delayed Continuous-time Systems within the Nonnegative Orthant
Proceedings of the 17th World Congress The International Federation of Automatic Control Seoul, Korea, July 6-11, 28 Memoryless Control to Drive States of Delayed Continuous-time Systems within the Nonnegative
More informationA Master-Slave Algorithm for the Optimal Control of Continuous-Time Switched Affine Systems
A Master-Slave Algorithm for the Optimal Control of Continuous-Time Switched Affine Systems Alberto Bemporad Dip. Ing. dell Informazione, Università di Siena Via Roma 56, 53 Siena, Italy bemporad@dii.unisi.it
More informationCONVENTIONAL stability analyses of switching power
IEEE TRANSACTIONS ON POWER ELECTRONICS, VOL. 23, NO. 3, MAY 2008 1449 Multiple Lyapunov Function Based Reaching Condition for Orbital Existence of Switching Power Converters Sudip K. Mazumder, Senior Member,
More informationGramians based model reduction for hybrid switched systems
Gramians based model reduction for hybrid switched systems Y. Chahlaoui Younes.Chahlaoui@manchester.ac.uk Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) School of Mathematics
More informationProxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
Electronic Notes in Theoretical Computer Science Vol. 85 No. 4 (2003) URL: http://www.elsevier.nl/locate/entsc/volume85.html Proxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More informationDiscrete-state Abstractions of Nonlinear Systems Using Multi-resolution Quantizer
Discrete-state Abstractions of Nonlinear Systems Using Multi-resolution Quantizer Yuichi Tazaki and Jun-ichi Imura Tokyo Institute of Technology, Ōokayama 2-12-1, Meguro, Tokyo, Japan {tazaki,imura}@cyb.mei.titech.ac.jp
More informationH State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions
IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL 11, NO 2, APRIL 2003 271 H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions Doo Jin Choi and PooGyeon
More informationFINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez
FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES Danlei Chu Tongwen Chen Horacio J Marquez Department of Electrical and Computer Engineering University of Alberta Edmonton
More informationStability Analysis and Synthesis for Scalar Linear Systems With a Quantized Feedback
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 48, NO 9, SEPTEMBER 2003 1569 Stability Analysis and Synthesis for Scalar Linear Systems With a Quantized Feedback Fabio Fagnani and Sandro Zampieri Abstract
More informationAnalysis and Control of Nonlinear Actuator Dynamics Based on the Sum of Squares Programming Method
Analysis and Control of Nonlinear Actuator Dynamics Based on the Sum of Squares Programming Method Balázs Németh and Péter Gáspár Abstract The paper analyses the reachability characteristics of the brake
More informationHybrid Control and Switched Systems. Lecture #11 Stability of switched system: Arbitrary switching
Hybrid Control and Switched Systems Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Stability under arbitrary switching Instability
More informationThe Multi-Agent Rendezvous Problem - The Asynchronous Case
43rd IEEE Conference on Decision and Control December 14-17, 2004 Atlantis, Paradise Island, Bahamas WeB03.3 The Multi-Agent Rendezvous Problem - The Asynchronous Case J. Lin and A.S. Morse Yale University
More informationTime Petri Nets. Miriam Zia School of Computer Science McGill University
Time Petri Nets Miriam Zia School of Computer Science McGill University Timing Specifications Why is time introduced in Petri nets? To model interaction between activities taking into account their start
More informationA deadlock prevention method for railway networks using monitors for colored Petri nets
A deadlock prevention method for railway networks using monitors for colored Petri nets Maria Pia Fanti Dip di Elettrotecnica ed Elettronica Politecnico di Bari, Italy fanti@deemailpolibait Abstract The
More informationReachable set computation for solving fuel consumption terminal control problem using zonotopes
Reachable set computation for solving fuel consumption terminal control problem using zonotopes Andrey F. Shorikov 1 afshorikov@mail.ru Vitaly I. Kalev 2 butahlecoq@gmail.com 1 Ural Federal University
More informationGlobal Analysis of Piecewise Linear Systems Using Impact Maps and Surface Lyapunov Functions
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 48, NO 12, DECEMBER 2003 2089 Global Analysis of Piecewise Linear Systems Using Impact Maps and Surface Lyapunov Functions Jorge M Gonçalves, Alexandre Megretski,
More informationModelling Systems by Hybrid Petri Nets: an Application to Supply Chains Mariagrazia Dotoli 1, Maria Pia Fanti 1, Alessandro Giua 2, Carla Seatzu 2
Modelling Systems by Hybrid Petri Nets: an Application to Supply Chains Mariagrazia Dotoli 1, Maria Pia Fanti 1, Alessandro Giua 2, Carla Seatzu 2 1 Dip. di Elettrotecnica ed Elettronica, Politecnico di
More informationA Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Fundamenta Informaticae XX (2004) 1 23 1 IOS Press A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs Javier Esparza Institute for Formal Methods in Computer Science
More informationA Geometric Approach to Graph Isomorphism
A Geometric Approach to Graph Isomorphism Pawan Aurora and Shashank K Mehta Indian Institute of Technology, Kanpur - 208016, India {paurora,skmehta}@cse.iitk.ac.in Abstract. We present an integer linear
More informationESC794: Special Topics: Model Predictive Control
ESC794: Special Topics: Model Predictive Control Discrete-Time Systems Hanz Richter, Professor Mechanical Engineering Department Cleveland State University Discrete-Time vs. Sampled-Data Systems A continuous-time
More informationTrajectory Tracking Control of Bimodal Piecewise Affine Systems
25 American Control Conference June 8-1, 25. Portland, OR, USA ThB17.4 Trajectory Tracking Control of Bimodal Piecewise Affine Systems Kazunori Sakurama, Toshiharu Sugie and Kazushi Nakano Abstract This
More informationPetri nets analysis using incidence matrix method inside ATOM 3
Petri nets analysis using incidence matrix method inside ATOM 3 Alejandro Bellogín Kouki Universidad Autónoma de Madrid alejandro. bellogin @ uam. es June 13, 2008 Outline 1 Incidence matrix Tools 2 State
More informationA Method for Determining Stabilizeability of a Class of Switched Systems
Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation Athens Greece August 4-6 007 7 A Method for Determining Stabilizeability of a Class of Switched Systems
More informationResource-Oriented Petri Nets in Deadlock Avoidance of AGV Systems
Proceedings of the 2001 IEEE International Conference on Robotics & Automation Seoul, Korea May 21-26, 2001 Resource-Oriented Petri Nets in Deadlock Avoidance of AGV Systems Naiqi Wu Department of Mechatronics
More informationEstimating the Region of Attraction of Ordinary Differential Equations by Quantified Constraint Solving
Estimating the Region of Attraction of Ordinary Differential Equations by Quantified Constraint Solving Henning Burchardt and Stefan Ratschan October 31, 2007 Abstract We formulate the problem of estimating
More informationInventory optimization of distribution networks with discrete-event processes by vendor-managed policies
Inventory optimization of distribution networks with discrete-event processes by vendor-managed policies Simona Sacone and Silvia Siri Department of Communications, Computer and Systems Science University
More informationScheduling of Frame-based Embedded Systems with Rechargeable Batteries
Scheduling of Frame-based Embedded Systems with Rechargeable Batteries André Allavena Computer Science Department Cornell University Ithaca, NY 14853 andre@cs.cornell.edu Daniel Mossé Department of Computer
More informationMinimizing Total Delay in Fixed-Time Controlled Traffic Networks
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks Ekkehard Köhler, Rolf H. Möhring, and Gregor Wünsch Technische Universität Berlin, Institut für Mathematik, MA 6-1, Straße des 17. Juni
More informationCHAPTER 2 -idempotent matrices
CHAPTER 2 -idempotent matrices A -idempotent matrix is defined and some of its basic characterizations are derived (see [33]) in this chapter. It is shown that if is a -idempotent matrix then it is quadripotent
More informationL 2 -induced Gains of Switched Systems and Classes of Switching Signals
L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit
More informationCycle time optimization of deterministic timed weighted marked graphs by transformation
Cycle time optimization of deterministic timed weighted marked graphs by transformation Zhou He, Zhiwu Li, Alessandro Giua, Abstract Timed marked graphs, a special class of Petri nets, are extensively
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationAnnouncements. Review: Lyap. thms so far. Review: Multiple Lyap. Fcns. Discrete-time PWL/PWA Quadratic Lyapunov Theory
EECE 571M/491M, Spring 2007 Lecture 11 Discrete-time PWL/PWA Quadratic Lyapunov Theory http://www.ece.ubc.ca/~elec571m.html moishi@ece.ubc.ca Meeko Oishi, Ph.D. Electrical and Computer Engineering University
More informationActive Fault Diagnosis for Uncertain Systems
Active Fault Diagnosis for Uncertain Systems Davide M. Raimondo 1 Joseph K. Scott 2, Richard D. Braatz 2, Roberto Marseglia 1, Lalo Magni 1, Rolf Findeisen 3 1 Identification and Control of Dynamic Systems
More informationAdaptive synchronization of chaotic neural networks with time delays via delayed feedback control
2017 º 12 È 31 4 ½ Dec. 2017 Communication on Applied Mathematics and Computation Vol.31 No.4 DOI 10.3969/j.issn.1006-6330.2017.04.002 Adaptive synchronization of chaotic neural networks with time delays
More informationStability of interval positive continuous-time linear systems
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 66, No. 1, 2018 DOI: 10.24425/119056 Stability of interval positive continuous-time linear systems T. KACZOREK Białystok University of
More informationUsing Markov Chains To Model Human Migration in a Network Equilibrium Framework
Using Markov Chains To Model Human Migration in a Network Equilibrium Framework Jie Pan Department of Mathematics and Computer Science Saint Joseph s University Philadelphia, PA 19131 Anna Nagurney School
More informationThe characteristic equation and minimal state space realization of SISO systems in the max algebra
KULeuven Department of Electrical Engineering (ESAT) SISTA Technical report 93-57a The characteristic equation and minimal state space realization of SISO systems in the max algebra B De Schutter and B
More informationCONTROL AND DEADLOCK RECOVERY OF TIMED PETRI NETS USING OBSERVERS
5 e Conférence Francophone de MOdélisation et SIMulation Modélisation et simulation pour l analyse et l optimisation des systèmes industriels et logistiques MOSIM 04 du 1 er au 3 septembre 2004 - Nantes
More informationLearning Model Predictive Control for Iterative Tasks: A Computationally Efficient Approach for Linear System
Learning Model Predictive Control for Iterative Tasks: A Computationally Efficient Approach for Linear System Ugo Rosolia Francesco Borrelli University of California at Berkeley, Berkeley, CA 94701, USA
More informationLinear Matrix Inequality Method for a Quadratic Performance Index Minimization Problem with a class of Bilinear Matrix Inequality Conditions
Journal of Physics: Conference Series PAPER OPEN ACCESS Linear Matrix Inequality Method for a Quadratic Performance Index Minimization Problem with a class of Bilinear Matrix Inequality Conditions To cite
More informationTechniques for Generic Probabilistic Inversion
Techniques for Generic Probabilistic Inversion D.Kurowicka 1, R.M. Cooke 2 1 Department of Mathematics, Delft University of Technology, Delft, The Netherlands; d.kurowicka@its.tudelft.nl 2 Department of
More informationLecture Note 7: Switching Stabilization via Control-Lyapunov Function
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 7: Switching Stabilization via Control-Lyapunov Function Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio
More informationOpen Access Database Italy. 1. Introduction
Modelling Systems by Hybrid Petri Nets: an Application to Supply Chains Mariagrazia Dotoli 1, Maria Pia Fanti 1, Alessandro Giua 2 and Carla Seatzu 2 1 Dip. di Elettrotecnica ed Elettronica, Politecnico
More informationState and Parameter Estimation Based on Filtered Transformation for a Class of Second-Order Systems
State and Parameter Estimation Based on Filtered Transformation for a Class of Second-Order Systems Mehdi Tavan, Kamel Sabahi, and Saeid Hoseinzadeh Abstract This paper addresses the problem of state and
More informationRank Tests for the Observability of Discrete-Time Jump Linear Systems with Inputs
Rank Tests for the Observability of Discrete-Time Jump Linear Systems with Inputs Ehsan Elhamifar Mihály Petreczky René Vidal Center for Imaging Science, Johns Hopkins University, Baltimore MD 21218, USA
More informationTrajectory Planning Using High-Order Polynomials under Acceleration Constraint
Journal of Optimization in Industrial Engineering (07) -6 Trajectory Planning Using High-Order Polynomials under Acceleration Constraint Hossein Barghi Jond a,*,vasif V. Nabiyev b, Rifat Benveniste c a
More informationThe matrix approach for abstract argumentation frameworks
The matrix approach for abstract argumentation frameworks Claudette CAYROL, Yuming XU IRIT Report RR- -2015-01- -FR February 2015 Abstract The matrices and the operation of dual interchange are introduced
More informationTécnicas Algebraicas para el Análisis y Control de Redes de Petri Continuas
Técnicas Algebraicas para el Análisis y Control de Redes de Petri Continuas Jorge Emilio Júlvez Bueno TESIS DOCTORAL Departamento de Informática e Ingeniería de Sistemas Universidad de Zaragoza Directores:
More informationCONTROL SYSTEMS, ROBOTICS AND AUTOMATION - Vol. VII - System Characteristics: Stability, Controllability, Observability - Jerzy Klamka
SYSTEM CHARACTERISTICS: STABILITY, CONTROLLABILITY, OBSERVABILITY Jerzy Klamka Institute of Automatic Control, Technical University, Gliwice, Poland Keywords: stability, controllability, observability,
More information