SwePub - search: WFRF:(Van Der Graaf Patrick)

Enumeration	Reference	Cover	Find
1.	Rashidinejad, Aida, et al. (author) Non-blocking Supervisory Control of Timed Automata using Forcible Events 2020 In: IFAC-PapersOnLine. - : Elsevier BV. - 2405-8963. ; 53:4, s. 356-362 Conference paper (peer-reviewed)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.

Rashidinejad, Aida, et al. (author)
Non-blocking Supervisory Control of Timed Automata using Forcible Events
2020
In: IFAC-PapersOnLine. - : Elsevier BV. - 2405-8963. ; 53:4, s. 356-362
Conference paper (peer-reviewed)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.

Träfflista för sökning "WFRF:(Van Der Graaf Patrick) "