Temporal Verification of Reactive Systems: SafetySpringer Science & Business Media, 06.12.2012 - 512 Seiten This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final value on termination. The family of reactive systems includes many classes of programs whose correct and reliable construction is con sidered to be particularly challenging, including concurrent programs, embedded and process control programs, and operating systems. Typical examples of such systems are an air traffic control system, programs controlling mechanical devices such as a train, or perpetually ongoing processes such as a nuclear reactor. With the expanding use of computers in safety-critical areas, where failure is potentially disastrous, correctness is crucial. This has led to the introduction of formal verification techniques, which give both users and designers of software and hardware systems greater confidence that the systems they build meet the desired specifications. Framework The approach promoted in this book is based on the use of temporal logic for specifying properties of reactive systems, and develops an extensive verification methodology for proving that a system meets its temporal specification. Reactive programs must be specified in terms of their ongoing behavior, and temporal logic provides an expressive and natural language for specifying this behavior. Our framework for specifying and verifying temporal properties of reactive systems is based on the following four components: 1. A computational model to describe the behavior of reactive systems. The model adopted in this book is that of a Fair Transition System (FTS). |
Inhalt
1 | |
Invariance Proof Methods | 81 |
Invariance Applications | 167 |
Precedence | 251 |
General Safety | 317 |
Algorithmic Verification of General Formulas 399 | 398 |
465 | |
481 | |
488 | |
Andere Ausgaben - Alle anzeigen
Temporal Verification of Reactive Systems: Safety, Band 2 Zohar Manna,Amir Pnueli Eingeschränkte Leseprobe - 1995 |
Temporal Verification of Reactive Systems: Safety Zohar Manna,Amir Pnueli Keine Leseprobe verfügbar - 2012 |
Häufige Begriffe und Wortgruppen
at_l3 at_m3 at_m4 at_m5 at-lo atom auxiliary variables await boolean channel chopstick claim computation concurrent programs Consider program construction contains critical section defined Dekker's algorithm denote diagram dining philosophers problem equivalent establish example expressed fair transition system fulfilling holds at position implies incremental inductive assertion initial integer integer square root INV-B invariant labeled loop forever Manna minimal rank mutual exclusion node noncritical l2 P-accessible P-invariant P-state valid P-valid P₁ P₂ particle past formulas Peterson's algorithm Pnueli premises presented in Fig Problem process P[i program MUX-PET1 program MUX-SEM proof prove reader is requested readers-writers problem refer requirement rule INV rule INV-P safety property satisfies semaphores sequence solution specified statement subformula subgraph successor synchronous system variables T-successor tableau temporal formula temporal logic termination transition relation verification condition virtual variables y₁