• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Verification of Reactive Systems: Formal Methods and Algorithms

Verification of Reactive Systems: Formal Methods and Algorithms

Paperback

Series: Texts in Theoretical Computer Science. an Eatcs

FictionGeneral ComputersProgramming

ISBN10: 3642055559
ISBN13: 9783642055553
Publisher: Springer
Published: Dec 8 2010
Pages: 602
Weight: 1.89
Height: 1.25 Width: 6.14 Depth: 9.21
Language: English

The book is a foundation of the most important formalisms used for specification and verification of reactive systems. In particular, it 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.

Also in

General Computers