Computer-Aided Verification of Coordinating Processes : : The Automata-Theoretic Approach / / Robert P. Kurshan.
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:
Superior document: | Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1980-1999 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2014] ©1995 |
Year of Publication: | 2014 |
Edition: | Course Book |
Language: | English |
Series: | Princeton Readings in Religions ;
302 |
Online Access: | |
Physical Description: | 1 online resource (284 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Frontmatter
- Contents
- Preface
- Chapter 1. Introduction
- Chapter 2. Boolean Algebra
- Chapter 3. L-matrix
- Chapter 4. L-language
- Chapter 5. String Acceptors
- Chapter 6. ω-theory: L-automaton/L-process
- Chapter 7. The Selection/Resolution Model of Coordinating Processes
- Chapter 8. Reduction of Verification
- Chapter 9. Structural Induction
- Chapter 10. Binary Decision Diagrams
- Appendices
- Bibliography
- Glossary
- Index
- Backmatter