scientific article; zbMATH DE number 438994

From MaRDI portal
Publication:3141897





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.




Cited in
(only showing first 100 items - show all)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141897)