Interaction of Finite State Machines and Concurrency Models

Bilung Lee and Edward A. Lee

Proc. of Thirty Second Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, California, November 1998.

Prepublished version
Published version


Hierarchical concurrent finite state machines (HCFSMs) dramatically increase the usability of finite state machines (FSMs). However, most formalisms that support HCFSMs, such as Statecharts (and its variants), tightly integrate the concurrency semantics with the FSM semantics. We, in contrast, allow FSMs to be hierarchically combined with multiple concurrency models, enabling selection of the most appropriate concurrency semantics for the problem at hand. A key issue for the success of this scheme is to define how FSMs interact with various concurrency models without ambiguities. In this paper, we focus on the interaction of FSMs and three concurrency models: synchronous dataflow, discrete-event and synchronous/reactive models.
Send comments to Bilung Lee at bilung at eecs berkeley edu .
Copyright 1998 IEEE. Published in the Proceedings of Asilomar'98. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 908-562-3966.