An implementation of the state transition event model

Simple item page
dc.contributor.authorO'Connell, Gordon Wayneen_US
dc.date.accessioned2024-08-15T16:35:29Z
dc.date.available2024-08-15T16:35:29Z
dc.date.copyright1997en_US
dc.date.issued1997
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractThis 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 declara­tion 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 tran­sition 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.
dc.format.extent175 pages
dc.identifier.urihttps://hdl.handle.net/1828/19161
dc.rightsAvailable to the World Wide Weben_US
dc.titleAn implementation of the state transition event modelen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
OCONNELL_Gordon_Wayne_MSc_1997_742780.pdf
Size:
36.88 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.