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...
Sábháilte in:
| Príomhchruthaitheoir: | |
|---|---|
| Formáid: | LEABHAR |
| Teanga: | English |
| Foilsithe / Cruthaithe: |
Princeton, N.J. :
Princeton University Press,
c1994.
|
| Sraith: | Princeton series in computer science
|
| Ábhair: |
| LEADER | 02440cam a2200349 a 4500 | ||
|---|---|---|---|
| 001 | c000226062 | ||
| 003 | CARM | ||
| 005 | 20061128131223.0 | ||
| 008 | 941109s1995 nju b 001 0 eng | ||
| 010 | |a 94042672 | ||
| 019 | 1 | |a 11314775 |5 LACONCORD2021 | |
| 020 | |a 0691034362 | ||
| 035 | |a (OCoLC)31607379 |5 LACONCORD2021 | ||
| 040 | |a DLC |b eng |c DLC |d DLC |d TOC | ||
| 050 | 0 | |a TS183.3 |b .K87 1994 | |
| 050 | 0 | 0 | |a TS183.3 |b .K87 1994 |
| 082 | 0 | 0 | |a 670.42 |2 20 |
| 100 | 1 | |a Kurshan, R. P., |d 1943- | |
| 245 | 1 | 0 | |a Computer-aided verification of coordinating processes : |b the automata-theoretic approach / |c Robert P. Kurshan. |
| 260 | |a Princeton, N.J. : |b Princeton University Press, |c c1994. | ||
| 300 | |a xii, 270 p. ; |c 24 cm. | ||
| 440 | 0 | |a Princeton series in computer science | |
| 504 | |a Includes bibliographical references (p. 241-262) and index. | ||
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Manufacturing processes |x Planning |x Data processing. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Expert systems (Computer science) |x Verification. | |
| 650 | 0 | |a System design. | |
| 852 | 8 | |b CARM |h A2:AB20H0 |i F01131 |p 0268204 |f BK | |
| 999 | f | f | |i f74c5bca-10d7-5fd0-8839-f63ae0ec1f3b |s 63c7ac3e-7732-53a8-b5bd-38321f0795b0 |
| 952 | f | f | |p Can circulate |a CAVAL |b CAVAL |c CAVAL |d CARM 1 Store |e F01131 |f A2:AB20H0 |h Other scheme |i book |m 0268204 |