OPERATION/EVENT GRAPHS: A Design Representation for Timing Behavior

Amon, Tod Tracy; Borriello, Gaetano; Séquin, Carlo H.

doi:10.1016/b978-0-444-89208-9.50021-1

Cited by 12 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An exception is the OEgraph representation of Amon et al [14], [15] which can express the context under which timing constraints should hold through the use of a restricted set of first-order predicate calculus. OEgraphs can describe behaviors and constraints similar to those that can be described using BFSM's.…”

Section: Previous Workmentioning

confidence: 99%

Scheduling constraint generation for communicating processes

Takach

Wolf

1995

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

This paper describes a new algorithm for generation of scheduling constraints in networks of communicating processes. Our model of communication intertwines the schedules of the machines in the network: timing constraints of a machine may affect the schedules of machines communicating with it. This model of communication facilitates the modular specification of timing constraints [l]. A feasible solution to the set of constraints generated gives a schedule for each machine in the network such that all internal constraints of each machine are satisfied and communication between machines is statically coordinated whenever possible. Static scheduling of communication saves on the cost of handshake associated with dynamic synchronization. Our algorithm can handle complex, state-dependent and cyclic timing constraints. Experimental results show that our algorithm is both effective and efficient.

show abstract

Section: Previous Workmentioning

confidence: 99%

Scheduling constraint generation for communicating processes

Takach

Wolf

1995

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

show abstract

“…Amon, Borriello and Séquin introduce a similar approach to timing diagram modeling [5]: behavior and timing constraints are described separately. Another approach has been developed by Dufresne,Khordoc and Cerny [3], introducing the notion of hierarchy and concurrency in timing diagrams.…”

Section: 1: Related Previous Workmentioning

confidence: 99%

High-level modeling using extended timing diagrams - A formalism for the behavioral specification of digital hardware

Moeschler

Amann

Pellandini

Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference

View full text Add to dashboard Cite

show abstract

“…The idea of attaching timing constraints to a behavior description has been used in hardware description languages [5], [6] and in graphical specification systems [2]. …”

Section: Relation To Other Workmentioning

confidence: 99%

Specifying system behavior in CPA

McFarland

Kowalski²

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors

View full text Add to dashboard Cite

This paper describes CPA, a framework for specifying the behavior of control-oriented digital systems. CPA allows the expression of sequential behavior, data transformations and timing constraints in an integrated representation. It supports the abstract, declarative specification of behavior independent of any particular implementation. Thus it is especially useful for verifying a design against a set of extemally-defined requirements.

show abstract

OPERATION/EVENT GRAPHS: A Design Representation for Timing Behavior

Cited by 12 publications

References 10 publications

Scheduling constraint generation for communicating processes

Scheduling constraint generation for communicating processes

High-level modeling using extended timing diagrams - A formalism for the behavioral specification of digital hardware

Specifying system behavior in CPA

Contact Info

Product

Resources

About