Sold Out
Book Categories |
List of Figures | ||
List of Tables | ||
Preface | ||
Acknowledgments | ||
1 | Introduction | 1 |
2 | Related Work | 7 |
3 | The Static Model | 17 |
4 | A Well-Formed VHDL Model | 31 |
5 | The Reduction Algebra | 43 |
6 | Completeness of the Reduced Form | 55 |
7 | Interval Temporal Logic | 65 |
8 | The Dynamic Model | 69 |
9 | Applications of the Dynamic Model | 89 |
10 | A Framework for Proving Equivalences using PVS | 99 |
11 | Conclusions | 123 |
A- | 127 | |
A.1 | The relation during(b,a) holds | 127 |
A.2 | The relation finishes(b,a) holds | 140 |
A.3 | The relation overlaps(a,b) holds | 146 |
References | 151 | |
Index | 157 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionFormal Semantics and Proof Techniques for Optimizing VHDL Models
X
This Item is in Your InventoryFormal Semantics and Proof Techniques for Optimizing VHDL Models
X
You must be logged in to review the productsX
X
X
Add Formal Semantics and Proof Techniques for Optimizing VHDL Models, Formal Semantics and Proof Techniques for Optimizing VHDL Models presents a formal model of VHDL that clearly specifies both the static and dynamic semantics of VHDL. It provides a mathematical framework for representing VHDL constructs and shows how thos, Formal Semantics and Proof Techniques for Optimizing VHDL Models to the inventory that you are selling on WonderClubX
X
Add Formal Semantics and Proof Techniques for Optimizing VHDL Models, Formal Semantics and Proof Techniques for Optimizing VHDL Models presents a formal model of VHDL that clearly specifies both the static and dynamic semantics of VHDL. It provides a mathematical framework for representing VHDL constructs and shows how thos, Formal Semantics and Proof Techniques for Optimizing VHDL Models to your collection on WonderClub |