FSM-Hume: Programming resource-limited systems using bounded automata

Greg Michaelson, Kevin Hammond, Jocelyn Serot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Hume is a novel domain-specific programming language targeting resource-bounded computations, such as real-time embedded systems or mobile code. It is based on generalised concurrent automata, controlled by transitions characterised by pattern matching on inputs and (recursive) function generation on outputs. This paper discusses trade-offs between expressibility and decidability in the design of FSM-Hume, a subset of Hume (or Hume layer) based on generalised linear bounded automata with statically determinable time and space use. We illustrate our approach with reference to space costing of a simple real-time simulation of a line-following autonomous vehicle.

Original languageEnglish
Title of host publicationProceedings of the 2004 ACM Symposium on Applied Computing
Pages1455-1461
Number of pages7
Volume2
Publication statusPublished - 2004
Event2004 ACM Symposium on Applied Computing - Nicosia, Cyprus
Duration: 14 Mar 200417 Mar 2004

Conference

Conference2004 ACM Symposium on Applied Computing
CountryCyprus
CityNicosia
Period14/03/0417/03/04

Keywords

  • Finite state automata
  • Functional language
  • Multi-process simulation

Fingerprint Dive into the research topics of 'FSM-Hume: Programming resource-limited systems using bounded automata'. Together they form a unique fingerprint.

  • Cite this

    Michaelson, G., Hammond, K., & Serot, J. (2004). FSM-Hume: Programming resource-limited systems using bounded automata. In Proceedings of the 2004 ACM Symposium on Applied Computing (Vol. 2, pp. 1455-1461)