Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

On a simplified untiming procedure for supervisory control of timed automata when the time increases strictly monotonically

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-7179

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

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.