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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Princeton, N.J. :
Princeton University Press,
c1994.
|
| Series: | Princeton series in computer science
|
| Subjects: |
| 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. Of the verification methodologies in use today, that combination of requirements points to automata-theoretic verification, on account of its expressiveness; computational complexity, and general utility. This book develops the theory of automata-theoretic verification from its foundations. A principal focus is heuristics to reduce the computational complexity of analysis, essential for verification in an industrial setting. |
|---|---|
| Physical Description: | xii, 270 p. ; 24 cm. |
| Bibliography: | Includes bibliographical references (p. 241-262) and index. |
| ISBN: | 0691034362 |