In this paper a cyclic place-timed controlled marked graph (PTCMG), which is an extended class of a cyclic controlled marked graph (CMG), is presented as a model of discrete event systems (DESs). In a PTCMG, time constraints are attached to places instead of transitions. The time required for a marked place to be marked again is represented in terms of time constraints attached to places. The times required for an unmarked place to be marked under various controls, are calculated. The necessary and sufficient condition for a current marking to be in the admissible marking set with respect to the given forbidden condition is provided, as is the necessary and sufficient condition for a current marking to be out of the admissible marking set with respect to the forbidden condition in one transition. A maximally permissive state feedback control is synthesized in a PTCMG to guarantee a larger admissible marking set than a CMG for most forbidden state problems. Practical applications are illustrated for a railroad crossing problem and an automated guided vehicle (AGV) coordination problem in a flexible manufacturing facility
Feedback control synthesis for a class of controlled Petri nets with time constraints
Rückkopplungsregelungssynthese für eine Klasse geregelter Petri-Netze mit Zeiteinschränkungen
International Technical Conference on Circuits/Systems, Computers and Communications, 1996 ; 1116-1126
1997
11 Seiten, 14 Quellen
Conference paper
English
Synthesis of feedback control logic for a class of controlled Petri nets
Tema Archive | 1990
|Controlled Petri nets and their applications - 1st part -
British Library Online Contents | 1995
|Controlled Petri nets and their applications - 2nd part -
British Library Online Contents | 1995
|Modeling traffic signal control using Petri nets
IEEE | 2004
|Modeling Traffic Signal Control Using Petri Nets
Online Contents | 2004
|