Behavior tables: A basis for system representation and transformational system synthesis

Rath, Kamlesh; Tuna, M. Esen; Johnson, S.D.

doi:10.1109/iccad.1993.580170

Cited by 7 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A fragment of the state diagram from the behavioral specification of the Scheme machine is shown in Figure 6. State diagrams provide a graphical representation for abstract behavioral specifications [24].…”

Section: Example--scheme Machine Decompositionmentioning

confidence: 99%

Decomposition of Sequential Behavior UsingInterface Specification and Complementation

1995

View full text Add to dashboard Cite

Decomposition of system behavior along functional boundaries into interacting sequential components is a key step in top-down system design. In this paper, we present sequential decomposition, a method for factoring sequential components from a system specification based on interface specifications of the components. The resulting components can be independently synthesized, or realized using off-the-shelf components. We introduce interface specification language (ISL), based on finite-state machine semantics, to specify the input/output behavior of synchronous sub-systems. A component is factored from a system by embedding an implementation of the complement of its interface into the system description. The composition of a machine with its complement is shown to be isomorphic to the machine, and the composition of a machine with an implementation of its component is shown to be a safe interaction. We apply sequential decomposition to a non-trivial example, a special-purpose computer with Scheme programming language primitives as its instructions.

show abstract

Section: Example--scheme Machine Decompositionmentioning

confidence: 99%

Decomposition of Sequential Behavior UsingInterface Specification and Complementation

1995

View full text Add to dashboard Cite

show abstract

“…In [4] the authors introduced Behavior Tables to represent a nite state machine where each r o w corresponds to a state transition in the machine described by the table. In [5] the authors used relational algebra to show the simplicity and power of tabular formalisms.…”

Section: Introductionmentioning

confidence: 99%

HDL optimization using timed decision tables

Gupta

1996

Proceedings of the 33rd Annual Conference on Design Automation Conference - DAC '96

View full text Add to dashboard Cite

System-level presynthesis refers to the optimization of an input HDL description that produces an optimized HDL description suitable for subsequent synthesis tasks. In this paper, we present optimization of control ow i n behavioral HDL descriptions using external Don't Care conditions. The optimizations are carried out using a tabular model of system functionality, called Timed Decision Tables or TDTs. TDT based optimization presented here have been implemented in a program called PUMPKIN. Optimization results from several examples show a reduction of 3-88% in the size of synthesized hardware circuits depending upon the external Don't Care information supplied by the user.

show abstract

Synthesizing reconfigurable sequential machines using Tabular models

Rath¹,

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Behavior tables: A basis for system representation and transformational system synthesis

Cited by 7 publications

References 6 publications

Decomposition of Sequential Behavior UsingInterface Specification and Complementation

Decomposition of Sequential Behavior UsingInterface Specification and Complementation

HDL optimization using timed decision tables

Synthesizing reconfigurable sequential machines using Tabular models

Contact Info

Product

Resources

About