Asynchronous Data Path Models

Sokolov, Danil; Poliakov, Ivan; Yakovlev, Alex

doi:10.1109/acsd.2007.45

Cited by 7 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the definition, the tokens can propagate in the SDFS. There are three different propagation semantics introduced in [7], the spread token semantics, the antitoken semantics and the counterflow semantics. Each semantics have different circuit implementations.…”

Section: Sdfs-static Data-flow Structuresmentioning

confidence: 99%

“…Previously, the SDFS model has been introduced as an informal model to represent the structure of the asynchronous data-path [6], the structure and the semantics of this model is ambiguous. A formal definition of the structures and the syntax in SDFS has been defined in [7]. 1) There are two kinds of vertices in V, which have different semantics, R for registers and L for combinational logics and R ∪ L = V. 2) Only register vertex r ∈ R can contain a token, a token can pass through a combinational logic vertex l ∈ L, but cannot be stored in this vertex.…”

Section: Sdfs-static Data-flow Structuresmentioning

confidence: 99%

See 1 more Smart Citation

A New Description Language for Data-Driven Asynchronous Circuits and its Design Flow

Jin

Wang

2009

2009 Pacific-Asia Conference on Circuits, Communications and Systems

View full text Add to dashboard Cite

A lot of up-to-date asynchronous circuit design tools are based on the control-driven asynchronous circuit style, such as Balsa and Haste/Tangram. The control-driven approach will limit the performance of the result circuits. To improve the performance of the asynchronous circuits, a new description language-Biscotti, which is suitable for the data-driven asynchronous circuit design, has been introduced in this paper. And a data-driven asynchronous circuit design flow is also be presented here. The experimental results show that this design flow is a fast and efficient way to design the data-driven asynchronous circuit, which can achieve higher performance compared with the control-driven design approach.

show abstract

Section: Sdfs-static Data-flow Structuresmentioning

confidence: 99%

Section: Sdfs-static Data-flow Structuresmentioning

confidence: 99%

A New Description Language for Data-Driven Asynchronous Circuits and its Design Flow

Jin

Wang

2009

2009 Pacific-Asia Conference on Circuits, Communications and Systems

View full text Add to dashboard Cite

show abstract

“…This generalisation of Petri nets has been widely investigated in the literature, e.g. under the name of lending Petri net [6], and negative tokens [32] have been also called anti-tokens [25], [36] or debit tokens [7], [28]. However, to the best of the authors' knowledge, this is the first time that such a concept is associated with the stability of biochemical networks.…”

Section: Introductionmentioning

confidence: 99%

Structural polyhedral stability of a biochemical network is equivalent to finiteness of the associated generalised Petri net

Blanchini,

Devia,

Giordano

2021

Preprint

View full text Add to dashboard Cite

We consider biochemical systems associated with a generalised class of Petri nets with possibly negative token numbers. We show that the existence of a structural polyhedral Lyapunov function for the biochemical system is equivalent to the boundedness of the associated Petri net evolution or, equivalently, to the finiteness of the number of states reachable from each initial condition. For networks that do not admit a polyhedral Lyapunov function, we investigate whether it is possible to enforce polyhedral structural stability by applying a strong negative feedback on some pinned nodes: in terms of the Petri net, this is equivalent to turning pinned nodes into black holes that clear any positive or negative incoming token. If such nodes are chosen so that the transformed Petri net has bounded discrete trajectories, then there exists a stabilising pinning control: the biochemical network becomes Lyapunov stable if a sufficiently strong local negative feedback is applied to the pinned nodes. These results allow us to structurally identify the critical nodes to be locally controlled so as to ensure the stability of the whole network.

show abstract

Workcraft: A Static Data Flow Structure Editing, Visualisation and Analysis Tool

Poliakov

Sokolov

Mokhov

Petri Nets and Other Models of Concurrency – ICATPN 2007

View full text Add to dashboard Cite

show abstract

Asynchronous Data Path Models

Cited by 7 publications

References 15 publications

A New Description Language for Data-Driven Asynchronous Circuits and its Design Flow

A New Description Language for Data-Driven Asynchronous Circuits and its Design Flow

Structural polyhedral stability of a biochemical network is equivalent to finiteness of the associated generalised Petri net

Workcraft: A Static Data Flow Structure Editing, Visualisation and Analysis Tool

Contact Info

Product

Resources

About