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 (http://dx.doi.org/10.1080/00207170310001628570)

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.

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	5024
  Dates:	Date Event 2003 Published
  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:	08 Apr 2024 15:50
  URI:	https://strathprints.strath.ac.uk/id/eprint/5024