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...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | |
| Язык: | English |
| Опубликовано: |
Princeton, N.J. :
Princeton University Press,
c1994.
|
| Серии: | Princeton series in computer science
|
| Предметы: |
Оглавление:
- 1. Introduction
- 2. Boolean Algebra
- 3. L-matrix
- 4. L-language
- 5. String Acceptors
- 6. [omega]-theory: L-automaton/L-process
- 7. The Selection/Resolution Model
- 8. Reduction of Verification
- 9. Structural Induction
- 10. Binary Decision Diagrams.