![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Concurrency and Hardware Design 2002
- Jordi Cortadella
, Alexandre Yakovlev, Grzegorz Rozenberg:
Concurrency and Hardware Design, Advances in Petri Nets. Lecture Notes in Computer Science 2549, Springer 2002, ISBN 3-540-00199-9
Formal Models
- Igor Benko, Jo C. Ebergen:
Composing Snippets. 1-33 - Mark B. Josephs
, Dennis P. Furey:
A Programming Approach to the Design of Asynchronous Logic Blocks. 34-60
Asynchronous Circuits
- Victor Varshavsky, Vyacheslav Marakhovsky:
GALA (Globally Asynchronous - Locally Arbitrary) Design. 61-107 - Josep Carmona, Jordi Cortadella
, Enric Pastor:
Synthesis of Reactive Systems: Application to Asynchronous Circuit Design. 108-151 - Walter Vogler, Ralf Wollowski:
Decomposition in Asynchronous Circuit Design. 152-190
Embedded System Design
- William W. LaRue, Sherry Solden, Bishnupriya Bhattacharya:
Functional and Performance Modeling of Concurrency in VCC. 191-227 - Felice Balarin, Luciano Lavagno, Claudio Passerone, Alberto L. Sangiovanni-Vincentelli, Marco Sgroi, Yosinori Watanabe:
Modeling and Designing Heterogeneous Systems. 228-273
Timed Verification and Performance Analysis
- Jesper B. Møller, Henrik Hulgaard, Henrik Reif Andersen:
Timed Verification of Asynchronous Circuits. 274-312 - Peter A. Beerel, Aiguo Xie:
Performance Analysis of Asynchronous Circuits Using Markov Chains. 313-344
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.