Computer-aided verification of coordinating processes : the automata-theoretic approach
著者
書誌事項
Computer-aided verification of coordinating processes : the automata-theoretic approach
Princeton University Press, c1994
大学図書館所蔵 件 / 全16件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 241-262) and index
内容説明・目次
内容説明
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.
目次
<table><TR><TD> <TD>Preface <TD>Introduction <TR><TD>2 <TD>Boolean Algebra <TR><TD>3 <TD>L-matrix <TR><TD>4 <TD>L-language <TR><TD>5 <TD>String Acceptors <TR><TD>6 <TD>[omega]-theory: L-automaton/L-process <TR><TD>7 <TD>The Selection/Resolution Model <TR><TD>8 <TD>Reduction of Verification <TR><TD>9 <TD>Structural Induction <TR><TD>10 <TD>Binary Decision Diagrams <TR><TD> <TD>Appendices <TR><TD> <TD>Bibliography <TR><TD> <TD>Glossary <TR><TD> <TD>Index
「Nielsen BookData」 より