Spathopoulos, M.P. (2003) On a simplified untiming procedure for supervisory control of timed automata when the time increases strictly monotonically. International Journal of Control, 76 (17). pp. 1739-1748. ISSN 0020-7179Full text not available in this repository. (Request a copy from the Strathclyde author)
Given a timed automaton G accepting the timed language LT a finite state machine G' can be constructed, known as the region automaton, which accepts the untimed language Untime (LT). In this paper we construct an alternative finite state machine which also accepts the language Untime (LT), but has fewer states than G'. This is shown for languages of both finite and infinite traces given that the time values in the time sequence increase strictly monotonically. The supervisory control design for timed automata, when the simplified untiming procedure is used and the time is strictly positive, is studied.
|Keywords:||control systems, mechanical engineering, controllers, Mechanical engineering and machinery, Control and Systems Engineering, Computer Science Applications|
|Subjects:||Technology > Mechanical engineering and machinery|
|Department:||Faculty of Engineering > Mechanical and Aerospace Engineering|
|Depositing user:||Strathprints Administrator|
|Date Deposited:||20 Dec 2007|
|Last modified:||06 Jan 2017 05:09|