Have one to sell? Sell yours here
Verification of Reactive Systems: Formal Methods and Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Verification of Reactive Systems: Formal Methods and Algorithms (Texts in Theoretical Computer Science. An EATCS Series) [Hardcover]

Klaus Schneider (Author)
4.0 out of 5 stars  See all reviews (1 customer review)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Hardcover --  
Paperback $109.00  

Book Description

3540002960 978-3540002963 December 11, 2003 1
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

Customers Who Viewed This Item Also Viewed


Editorial Reviews

Review

From the reviews: "The book starts with an introduction to formal methods in system design, talking about taxonomy and a classification of formal methods and systems. … Then the author introduces what he calls a unified specification language, which is propositional µ-calculus based on Kripke structure simulation, bisimulation and also quotient structures and products of Kripke structures. … it is a very helpful book that can be used both as a basis for a lecturer and as a handbook for learning about verification issues." (Manfred Broy, Mathematical Reviews, 2006 d) "Verification of Reactive Systems deals very much with the fundamental theory of its subject matter, namely automata, temporal logic, and model checking. … is focused … systematic, and thorough. This makes it very suitable for a graduate course on selected topics on formal methods. It would also be highly useful as a general reference in logic and automata theory … . is a remarkable achievement, and fills, in book-form, a glaring gap in the literature. I heartily recommend it to every serious formal methods theoretician.” (Joel Ouaknine, Software Testing, Verification and Reliability, Vol. 15 (3), 2005) "This book is in the series on theoretical computer science. … The book classifies systems into transformational systems, interactive systems, and reactive systems. … can be kept as a reference for theories on verification of computing systems, especially finite state formalisms. The book is complete with respect to its concepts, and explanations. The research oriented readers can find the book useful … . For theory oriented readers, the flow of chapters is smooth. … On the whole, the book is well written … ." (Maulik A. Dave, SIGACT News, Vol. 37 (4), 2006)

From the Back Cover

Reactive systems are becoming more and more important for essentially all areas of technical and professional activities as well as for many areas of everyday life. The design of these systems is a great challenge and requires sound compromises between safety and time-to-market. To meet these needs, early design phases nowadays include verification of given specifications against system descriptions to find potential design errors as early as possible. This book is devoted to the foundation of the most popular formal methods for the specification and verification of reactive systems. In particular, the µ-calculus, omega-automata, and temporal logics are covered in full detail; their relationship and state-of-the-art verification procedures based on these formal approaches are presented. Furthermore, the advantages and disadvantages of the formalisms from particular points of view are analyzed. Most results are given with detailed proofs, so that the presentation is almost self-contained. This book is targeted to advanced students, lecturers and researchers in the area of formal methods.

Product Details

  • Hardcover: 614 pages
  • Publisher: Springer; 1 edition (December 11, 2003)
  • Language: English
  • ISBN-10: 3540002960
  • ISBN-13: 978-3540002963
  • Product Dimensions: 9.4 x 6.5 x 1.3 inches
  • Shipping Weight: 2.3 pounds
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #3,737,182 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:    (0)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

4.0 out of 5 stars Awesome book, December 1, 2011
Amazon Verified Purchase(What's this?)
I bought this book to learn the basics of system verification
for a project that I needed to do.

The information contained in the book is very interesting, and though
the project has now been successfully completed, I am still planning
to go through the rest of the book.

It shipped quickly and arrived in very good condition, I recommend this
for anyone in system verification.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
The development of information processing systems, especially if these consist of concurrent processes, is a very complicated task. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
local model checking procedure, breakpoint construction, largest simulation relation, automaton formulas, canonical quotient structures, guarded normal form, prefix automata, deadend states, canonical selection function, prefix automaton, generating return value, generalized cofactors, existential automaton, past time modalities, largest bisimulation relation, future time operators, future time temporal operator, subsequent breakpoints, automaton hierarchy, common subformulas, recursion laws, equal expressiveness, monadic first order logic, past time operators, function fixpoint
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Downward Close
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject