 |
|
|||
| Authors: | Lothar Thiele, Juergen Teich, Martin Naedele, Karsten Strehl, Dirk Ziegenbein |
| Group: | Computer Engineering |
| Type: | Techreport |
| Title: | FunState – Functions Driven by State Machines, aka SCF – State Machine Controlled Flow Diagrams |
| Year: | 1998 |
| Month: | January |
| Pub-Key: | TTNSZ98 |
| Keywords: | SCF FunState |
| Rep Nbr: | 33 |
| Institution: | Computer Engineering and Networks Lab (TIK), Swiss Federal Institute of Technology (ETH) Zurich |
| Abstract: | In this report, existing state machine and dataflow models of computation are revisited. A common representation called FunState or SCF is presented that enables the representation of several dataflow models using a mixture of functional programming and state machines. In particular, models like cyclostatic dataflow, synchronous dataflow (SDF), marked graphs, and communicating state machines as well Petri nets turn out to be special subclasses of the FunState/SCF model. The model can be extended with information on the timing of computations and timing constraints. In addition, as abstraction and refinement are defined, the new model supports a hierarchical approach to problems like scheduling, verification, and implementation. |
| Remarks: | TIK Report No. 33, January 1998 |
| Resources: | [BibTeX] [Paper as PDF] |
