No label defined (Q3141897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 438994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 438994 |
Statements
1 November 1993
0 references
model checking
0 references
automatic verification
0 references
sequential circuit designs
0 references
protocols
0 references
temporal logic
0 references
concurrent systems
0 references
0.8838233351707458
0 references
0.8438337445259094
0 references
0.8438337445259094
0 references
The book deals with automatic verification of sequential circuit designs and protocols. Its aim is the verification of abstract models of such systems (represented by finite state machines), not the verification of the actual implementation. The indicated methods especially prove or disprove the validity of properties which can be expressed as formulas of the temporal logic CTL or the more general Mu-Calculus. Fixed point iterations on finite state macchines (together with inductive techniques if the systems are of arbitrary size and are generated by simple rules) are important means in this context. Finite state models of concurrent systems grow exponentially in size as the number of components of the system increases. This problem is met with an encoding of the states by Boolean variables and a representation of the encoded transition function by ROBDD's. For certain topological classes of circuits the author proves that the size of these ROBDD's can be bounded polynomially in the number of components. Apart from theoretical studies the book provides a wealth of practical examples which illustrate the methods and demonstrate their success especially with the verification and correction of protocols. The reviewer has profitted from reading this book.
0 references