• DocumentCode
    700669
  • Title

    A simplification of the untiming procedure for timed automata defining languages of finite strings

  • Author

    Laurence, M.R. ; Spathopoulos, M.P.

  • Author_Institution
    Dept. of Mech. Eng., Univ. of Strathclyde, Glasgow, UK
  • fYear
    1997
  • fDate
    1-7 July 1997
  • Firstpage
    1415
  • Lastpage
    1420
  • Abstract
    Given an Alur Timed Automaton G accepting the language LT, as defined in [1], a finite state machine G can be constructed, which accepts the language Untime(LT). G is known as the region automaton. Here we construct an alternative finite state machine G* that also accepts the language Untime(LT), but has significantly fewer states than G. The new untiming procedure involves finite timed words only.
  • Keywords
    discrete event systems; finite state machines; formal languages; Alur timed automaton; LT; defined languages; discrete event system; finite state machine; finite strings; finite timed words; language untime; region automaton; timed automata; untiming procedure simplification; Automata; Clocks; Cost accounting; Discrete-event systems; Law; Upper bound; Discrete event systems; languages; timed automata;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Conference (ECC), 1997 European
  • Conference_Location
    Brussels
  • Print_ISBN
    978-3-9524269-0-6
  • Type

    conf

  • Filename
    7082299
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=700669