Hierarchical Finite State Machines with Multiple Concurrency Models (1999)
Cached
Download Links
- [ptolemy.eecs.berkeley.edu]
- [www.ece.ucsb.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems |
| Citations: | 99 - 35 self |
BibTeX
@ARTICLE{Girault99hierarchicalfinite,
author = {Alain Girault and Bilung Lee and Edward A. Lee},
title = {Hierarchical Finite State Machines with Multiple Concurrency Models},
journal = {IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems},
year = {1999},
volume = {18},
pages = {742--760}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 FSM's 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.
