An implementation of the state transition event model
Date
1997
Authors
O'Connell, Gordon Wayne
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This thesis describes the design and implementation of a state transition event machine (STEM) A STEM is an abstract machine which combines the operations of a finite state machine with certain synchronization primitives in attempt to control the execution of a collection of mutually cooperating tasks. The declaration of a STEM can describe an abstract machine requiring hundreds of individual operations. To address this problem, a precompiler was developed to convert STEM declarations into compilable implementations. The synchronization requirements of a STEM are provided by low-level primitives called cl-operations The state transition event machine generated by our precompiler can be verified by embedding the code into an event-driven simulator and analyzing the output of the simulation log.