Hierarchical Finite State Machines with Multiple Concurrency Models
IEEE Transactions On Computer-aided Design Of Integrated Circuits And Systems,
Vol. 18, No. 6, June 1999.
Revised from Technical Memorandum UCB/ERL M97/57, August 17, 1997.
| Prepublished version |
| Published version |
ABSTRACT
This paper studies the semantics of hierarchical finite state machines (FMS's) that are composed using various concurrency models, particularly dataflow, discrete-events, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that the concurrency model can be selected independently of the decision to use hierarchical FSM's. In contrast, most formalisms that combine FSMs with concurrency models, such as Statecharts (and its variants) and hybrid systems, tightly integrate the FSM semantics with the concurrency semantics. An implementation that supports three combinations is described.Send comments to Edward A. Lee at eal at eecs berkeley edu .