Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata
Contributor : Kondo Adjallah Connect in order to contact the contributor
Submitted on : Monday, December 28, 2020 - 8:11:18 PM
Last modification on : Sunday, March 27, 2022 - 4:44:02 PM
Long-term archiving on: : Monday, March 29, 2021 - 6:51:28 PM


2011BIPDI-AutCalc Atli_et_al (...
Files produced by the author(s)


  • HAL Id : hal-03089833, version 1



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, Universitatea Tehnică Gheorghe Asachi din Lasi, 2011, LVII (LXI) (4), pp.75-92. ⟨hal-03089833⟩



Record views


Files downloads