Verification of Reactive Systems: Formal Methods and Algorithms (2004) (Texts in Theoretical Computer Science. An EATCS Series)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- This book is a solid foundation of the most important formalisms used for specification and verification of reactive systems. In particular, the text presents all important results on m-calculus, w-automata, and temporal logics, shows the relationships between these formalisms and describes state-of-the-art verification procedures for them. It also discusses advantages and disadvantages of these formalisms, and shows up their strengths and weaknesses. Most results are given with detailed proofs, so that the presentation is almost self-contained. Includes all definitions without relying on other material Proves all theorems in detail Presents detailed algorithms in pseudo-code for verification as well as translations to other formalisms
- Copyright:
- 2004
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783662107782
- Related ISBNs:
- 9783540002963
- Publisher:
- Springer Berlin Heidelberg
- Date of Addition:
- 06/28/22
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Klaus Schneider
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics
- in Philosophy