|
![]() |
|||
|
||||
OverviewFormal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required to behave reliably. To be acceptable in an industrial setting, formal verification must be highly algorithmic; to cope with design complexity, it must support a top-down design methodology that leads from an abstract design to its detailed implementation. That combination of requirements points directly to the widely recognized solution of automata-theoretic verification, on account of its expressiveness, computational complexity, and perhaps general utility as well. This book develops the theory of automata-theoretic verification from its foundations, with a focus on algorithms and heuristics to reduce the computational complexity of analysis. It is suitable as a text for a one-or two-semester graduate course, and is recommended reading for anyone planning to use a verification tool, such as COSPAN or SMV.An extensive bibliography that points to the most recent sources, and extensive discussions of methodology and comparisons with other techniques, make this a useful resource for research or verification tool development, as well. Originally published in 1995. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. Full Product DetailsAuthor: Robert P. KurshanPublisher: Princeton University Press Imprint: Princeton University Press Dimensions: Width: 15.20cm , Height: 1.80cm , Length: 22.90cm Weight: 0.567kg ISBN: 9780691634890ISBN 10: 0691634890 Pages: 284 Publication Date: 19 April 2016 Audience: College/higher education , Professional and scholarly , Tertiary & Higher Education , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Language: English Table of ContentsPreface1Introduction32Boolean Algebra313L-matrix454L-language515String Acceptors636[omega]-theory: L-automaton/L-process777The Selection/Resolution Model1098Reduction of Verification1539Structural Induction20310Binary Decision Diagrams215Appendices231Bibliography241Glossary263Index264ReviewsA self-contained introduction for anyone familiar with the fundamentals of the theory of machines. The book is well indexed and contains a substantial bibliography, as well as pointing to the implementation of the verification techniques in the COSPAN system. --Computing Reviews Author InformationTab Content 6Author Website:Countries AvailableAll regions |