About the Book
Formal 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 devel
Table of Contents:
| | Preface | Introduction |
| 2 | Boolean Algebra |
| 3 | L-matrix |
| 4 | L-language |
| 5 | String Acceptors |
| 6 | [omega]-theory: L-automaton/L-process |
| 7 | The Selection/Resolution Model |
| 8 | Reduction of Verification |
| 9 | Structural Induction |
| 10 | Binary Decision Diagrams |
| | Appendices |
| | Bibliography |
| | Glossary |
| | Index
Review :
A 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
Quick View
Too Good To Be True
Prajakta Koli
AED70
Quick View
Thank You for Leaving
Rithvik Singh
AED65
Quick View
Money Myths and Mantras
Devina Mehra
AED72
Quick View
Harry Potter Box Set: The Complete Collection (Children’s Paperback)
J.K. Rowling
AED553
Quick View
Can We be Strangers Again?
Shrijeet Shandilya
AED65
Product Details - ISBN-13: 9780691034362
- Publisher: Princeton University Press
- Publisher Imprint: Princeton University Press
- Height: 254 mm
- No of Pages: 272
- Returnable: Y
- Series Title: Princeton Series in Computer Science
- Weight: 482 gr
- ISBN-10: 0691034362
- Publisher Date: 26 Feb 1995
- Binding: Hardback
- Language: English
- Returnable: Y
- Series Title: Princeton Legacy Library
- Sub Title: The Automata-Theoretic Approach
- Width: 197 mm
 Quick ViewComputer-Aided Verificati...Robert P. Kurshan AED 1,752  Quick ViewComputer-Aided Verificati...Robert P. Kurshan AED 2,693  Quick ViewComputer-Aided Verificati...Robert P. Kurshan AED 695  Quick ViewComputer-Aided Verificati...Robert Kurshan AED 1,771  Quick ViewComputer-Aided Verificati...Robert Kurshan AED 1,771  Quick ViewComputer-Aided Verificati...Edmund M Clarke AED 604  Quick ViewComputer-Aided Verificati...Edmund M Clarke AED 322  Quick ViewComputer-Aided Verificati...Edmund M Clarke AED 245  Quick ViewComputer-Aided Verificati...Edmund M. Clarke AED 607  Quick ViewComputer-Aided CMM Inspec...Anis Limaiem AED 667  Quick ViewComputer-Aided SculptureJ. P. Duncan AED 964  Quick ViewComputer-Aided Processes ...George C. Beakley AED 530  Quick ViewComputer-Aided Processes ...George C Beakley AED 838  Quick ViewComputer-aided Instructio...Robert V. Price AED 418  Quick ViewComputer-Aided Design in ...P.P. Silvester AED 1,181  Quick ViewComputer-Aided Design in ...P. P. Silvester AED 464  Quick ViewComputer-Aided Technologi...Fonte Wikipedia AED 198  Quick ViewComputer-aided Tolerancin...Fumihiko Kimura AED 2,359  Quick ViewComputer-aided LearningDavid V. Marshall AED 126  Quick ViewComputer-aided Manufactur...Steven Foster AED 161
Customer Reviews
CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE
These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").
By submitting any content to Bookswagon, you guarantee that:
- You are the sole author and owner of the intellectual property rights in the content;
- All "moral rights" that you may have in such content have been voluntarily waived by you;
- All content that you post is accurate;
- You are at least 13 years old;
- Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
You further agree that you may not submit any content:
- That is known by you to be false, inaccurate or misleading;
- That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
- That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
- That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
- For which you were compensated or granted any consideration by any unapproved third party;
- That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
- That contains any computer viruses, worms or other potentially damaging computer programs or files.
You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice,
Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set
forth above, or your violation of any law or the rights of a third party.
For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create
derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,
Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with
Privacy Policy.
All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any
content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.
Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are
generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you,
not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents,
subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.
Accept
Quick View
Confessions of Stock Market Wizards
Safir Anand
AED100
Quick View
Voice for the Voiceless
His Holiness the Dalai Lama
AED100
Quick View
The Cantonment Conspiracy
Manoj Mukund Naravane
AED107
Inspired by your browsing history
Quick View
Computer-Aided Verification of Coordinating Processes
Robert P. Kurshan
AED1,132
You've already reviewed this product!
An OTP has been sent to your
Registered Email Id:
|
