• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.330-335
• /
• 1993

This paper presents an efficient solution for a class of forbidden state problems by introducing a cyclic timed controlled marked graphs (TCMG's), a special class of timed controlled Petri nets (TCPN's) as a model of a class of discrete event systems (DES's). The state feedback control is synthesized, which is maximally permissive while guaranteeing the forbidden states will be avoided. The practical applications or tire theoretical results for an automated guided vehicle (ACV) coordination problem in a flexible manufacturing facility is illustrated.

• ETRI Journal
• /
• 제31권1호
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.