| 書目名稱 | Computation Engineering | | 副標(biāo)題 | Applied Automata The | | 編輯 | Ganesh Gopalakrishnan | | 視頻video | http://file.papertrans.cn/233/232036/232036.mp4 | | 概述 | Approaches automata theory and logic as the underlying engineering mathematics for Computation Engineering.Covers classical topics such as the Rice‘s Theorem, as well as modern topics such as Model ch | | 圖書封面 |  | | 描述 | It takes more e?ort to verify that digital system designs are correct than it does to design them, and as systems get more complex the proportion of cost spent on veri?cation is increasing (one estimate is that veri?cation complexity rises as the square of design complexity). Although this veri?cation crisis was predicted decades ago, it is only recently that powerful methods based on mathematical logic and automata theory have come to the designers’ rescue. The ?rst such method was equivalence checking, which automates Boolean algebra calculations.Nextcamemodelchecking,whichcanautomatically verify that designs have – or don’t have – behaviours of interest speci?ed in temporal logic. Both these methods are available today in tools sold by all the major design automation vendors. It is an amazing fact that ideas like Boolean algebra and modal logic, originating frommathematicians andphilosophersbeforemodern computers were invented, have come to underlie computer aided tools for creating hardware designs. The recent success of ’formal’ approaches to hardware veri?cation has lead to the creation of a new methodology: assertion based design, in which formal properties are incorporated | | 出版日期 | Textbook 2006 | | 關(guān)鍵詞 | Automat; Hardware; Turing; algorithms; automata; automata theory; complexity; complexity theory; computer; co | | 版次 | 1 | | doi | https://doi.org/10.1007/0-387-32520-4 | | isbn_softcover | 978-1-4419-3741-4 | | isbn_ebook | 978-0-387-32520-0 | | copyright | Springer-Verlag US 2006 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-19 14:49
發(fā)表于 2025-3-21 18:26:53
