Non-blocking Supervisory Control of Timed Automata using Forcible Events

Aida Rashidinejad, P. van der Graaf, Michel A. Reniers, Martin Fabian

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)

Abstract

Real-valued clocks make the state space of timed automata (TA) infinite. Conventional supervisory control synthesis techniques are only applicable to finite automata (FA). Therefore, to synthesize a supervisor for TA using conventional techniques, an abstraction of TA to FA is required. For many applications, the abstraction of real-time values results in an explosion in the finite state space. This paper presents a supervisory control synthesis technique applied directly to TA without any abstraction. The plant is given as a TA with a set of uncontrollable events and a set of forcible events that may preempt the passage of time. To obtain a non-blocking controlled system, a synthesis algorithm is proposed that delivers a supervisor (also as a TA) avoiding the blocking states. The algorithm works by (iteratively) strengthening the guards of edges labeled by controllable events and invariants of locations where time progress can be preempted by forcible events.
Original languageEnglish
Pages (from-to)356-362
Number of pages7
JournalIFAC-PapersOnLine
Volume53
Issue number4
DOIs
Publication statusPublished - Nov 2020
Event15th International Workshop on Discrete Event Systems (WODES 2020) - Virtual, Rio de Janeiro, Brazil
Duration: 11 Nov 202013 Nov 2020
Conference number: 15

Fingerprint

Dive into the research topics of 'Non-blocking Supervisory Control of Timed Automata using Forcible Events'. Together they form a unique fingerprint.

Cite this