Issue No. 01 - January (1995 vol. 44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.368014
<p><it>Abstract—</it>We present a finite-state model for scheduling constraints in digital system design. We define a two-level hierarchy of finite-state machines: a behavior FSM's input and output events are partially ordered in time; a register-transfer FSM is a traditional FSM whose inputs and outputs are totally ordered in time. Explicit modeling of scheduling constraints is useful for both high-level synthesis and verification—we can explicitly search the space of register-transfer FSM's which implement a desired schedule. State-based models for scheduling are particularly important in the design of control-dominated systems. This paper describes the BFSM model, describes several important operations and algorithms on BFSM's and networks of communicating BFSM's, and illustrates the use of BFSM's in high-level synthesis.</p>
W. Wolf, A. Takach and M. Leeser, "An Automaton Model for Scheduling Constraints in Synchronous Machines," in IEEE Transactions on Computers, vol. 44, no. , pp. 1-12, 1995.