Computer-Aided Verification of Coordinating Processes : The Automata-Theoretic Approach (Princeton Series in Computer Science)
Virtualis Systems: fast, reliable Web hosting

Computer-Aided Verification of Coordinating Processes : The Automata-Theoretic Approach (Princeton Series in Computer Science)

This single book has all you've
been looking for, doesn't it ?


Stop wasting your time !
Get It Now !

Living in Europe? Get It Here!
Living in Deutschland? Get It Here!

by Robert P. Kurshan

Our Price: $69.50

Availability: This title usually ships within 2-3 days.

Reviews
Book Description
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.

Back to Expert Systems
Back to Artificial Intelligence
Back to Main Index

Intervelopers: offshore web development, programming and HTML coding.

In Association with Amazon.com, Amazon.co.uk, Amazon.de
Advertise at this Site
Copyright (c) by Eugene Kisly and Victor Kisly , 1999-2000