Supervisory Control Synthesis of Timed Automata Using Forcible Events
Artikel i vetenskaplig tidskrift, 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
Författare
[Person d57c2bf9-12e9-46de-bd3e-2b4efb180ee2 not found]
[Person ae105c61-dbd2-449b-a7e6-e409463a2c29 not found]
[Person 58ff4dd6-78a5-4457-a143-8eac84f33d6d not found]
IEEE Transactions on Automatic Control
0018-9286 (ISSN) 1558-2523 (eISSN)
Vol. 69 2 1074-1080Ämneskategorier (SSIF 2011)
Reglerteknik
Datavetenskap (datalogi)
Datorsystem
DOI
10.1109/TAC.2023.3275440