Control law for timed marked graph constrained by marking exclusion constraint OR/AND - Université de Lorraine Access content directly
Journal Articles Buletinul Institutului Politehnic din Lasi. Sectia IV, Automatica si Calculatoare Year : 2011

Control law for timed marked graph constrained by marking exclusion constraint OR/AND

Abstract

We have already presented a contribution for synthesizing an approach of supervisory control for Discrete Event Systems (DES) modeled by Timed Place Marked Graphs subject to Marking Exclusion constraints. This paper is a continuation work in this area for building the control law for Discrete Event Systems (DES), where the time is taken into consideration. It solves a forbidden state problem characterized by one of both types of Marking Exclusion Constraint: MEC-Or and MEC-And. A computationally efficient technique to build the supervisor is proposed, which we take into consideration in the uncontrollable and/or unobservable nature of some events. From the initial state (as known marking), we build timetables that show us the timeline of tokens distribution over the system. These timetables help us build a Control Law Table (CLT). By analyzing this table, the supervisor may determine the moment of its intervention.
Fichier principal
Vignette du fichier
2011BIPDI-AutCalc Atli_et_al (Control law ...).pdf (224.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03089833 , version 1 (28-12-2020)

Identifiers

  • HAL Id : hal-03089833 , version 1

Cite

Maen Atli, Zied Achour, Alexandre Sava, Kondo Hloindo Adjallah. Control law for timed marked graph constrained by marking exclusion constraint OR/AND. Buletinul Institutului Politehnic din Lasi. Sectia IV, Automatica si Calculatoare, 2011, LVII (LXI) (4), pp.75-92. ⟨hal-03089833⟩
28 View
45 Download

Share

Gmail Facebook X LinkedIn More