BibTeX
@MISC{Michaelson_chapter1,
author = {Greg Michaelson and Kevin Hammond and Jocelyn Serot},
title = {Chapter 1 The Finite State-ness of FSM-Hume},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract Hume is a domain-specific programming language targeting resourcebounded computations, such as real-time embedded systems. It is novel in being based on generalised concurrent bounded automata, controlled by transitions characterised by pattern matching on inputs and recursive function generation of outputs. FSM-Hume is a strict finite state subset of Hume, where symbols are constrained to fixed size types and transition functions are non-recursive. Here we discuss the design of FSM-Hume and show that it is indeed classically finite state. 1.1
