Computer-Aided Verification of Coordinating Processes The Automata-Theoretic Approach
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 com...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Princeton, New Jersey
Princeton University Press
2014, ©1994
|
| Series: | Princeton series in computer science
Princeton Legacy Library |
| Subjects: | |
| Online Access: | |
| Collection: | DeGruyter MPG Collection - Collection details see MPG.ReNa |
| Summary: | 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 development, as well. |
|---|---|
| Physical Description: | XII, 270 pages |
| ISBN: | 978-1-4008-6404-1 |