Supervisory Control Synthesis of Timed Automata Using Forcible Events
Journal article, 2024

This paper presents an algorithm for synthesizing a supervisor for timed automata (TA) using the conventional supervisory control theory. The algorithm is directly applicable to TA without explicit transformation into finite automata, and iteratively strengthens the guards of edges labeled by controllable events and invariants of locations where the progression of time can be preempted by forcible events. The synthesized supervisor, also a TA, is controllable, maximally permissive, and guarantees a non-blocking and safe supervised plant. The use of real-valued clocks in TA makes it a practical modeling framework, however, the infinite state space brings challenges. The proposed algorithm addresses these by providing a synthesis method that avoids the state-space explosion of finite automata and the loss of information that can result from abstraction of real-time values.

Supervisory control

supervisory control

Explosions

real-time

forcible event

Semantics

Discrete-event systems

Behavioral sciences

maximally permissive

Clocks

nonblocking

Cost accounting

Automata

synthesis

Author

Aida Rashidinejad

Eindhoven University of Technology

Michel A. Reniers

Eindhoven University of Technology

Martin Fabian

Chalmers, Electrical Engineering, Systems and control

IEEE Transactions on Automatic Control

0018-9286 (ISSN) 1558-2523 (eISSN)

Vol. 69 2 1074-1080

Subject Categories

Control Engineering

Computer Science

Computer Systems

DOI

10.1109/TAC.2023.3275440

More information

Latest update

3/7/2024 9