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

Greg Michaelson; Kevin Hammond; Jocelyn Serot

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

Greg Michaelson, Kevin Hammond, Jocelyn Serot

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings of the 2004 ACM Symposium on Applied Computing
Pages	1455-1461
Number of pages	7
Volume	2
Publication status	Published - 2004
Event	2004 ACM Symposium on Applied Computing - Nicosia, Cyprus Duration: 14 Mar 2004 → 17 Mar 2004

Conference

Conference	2004 ACM Symposium on Applied Computing
Country/Territory	Cyprus
City	Nicosia
Period	14/03/04 → 17/03/04

Keywords

Finite state automata
Functional language
Multi-process simulation

Cite this

@inproceedings{3d48b9fab7c54ccfbde31d1a55f393a9,

title = "FSM-Hume: Programming resource-limited systems using bounded automata",

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.",

keywords = "Finite state automata, Functional language, Multi-process simulation",

author = "Greg Michaelson and Kevin Hammond and Jocelyn Serot",

year = "2004",

language = "English",

volume = "2",

pages = "1455--1461",

booktitle = "Proceedings of the 2004 ACM Symposium on Applied Computing",

note = "2004 ACM Symposium on Applied Computing ; Conference date: 14-03-2004 Through 17-03-2004",

}

TY - GEN

T1 - FSM-Hume

T2 - 2004 ACM Symposium on Applied Computing

AU - Michaelson, Greg

AU - Hammond, Kevin

AU - Serot, Jocelyn

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Finite state automata

KW - Functional language

KW - Multi-process simulation

UR - http://www.scopus.com/inward/record.url?scp=2442528883&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 1455

EP - 1461

BT - Proceedings of the 2004 ACM Symposium on Applied Computing

Y2 - 14 March 2004 through 17 March 2004

ER -

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

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this