Computer-Aided Verification of Coordinating Processes
Regular price
€181.04
A01=Robert P. Kurshan
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Algorithmic efficiency
Application software
Approximation theory
Assertion (software development)
Author_Robert P. Kurshan
automatic-update
Automaton
Automorphism
Binary decision diagram
Boolean algebra
Boolean algebra (structure)
Boolean function
Cache (computing)
Calculation
Category1=Non-Fiction
Category=PBKD
Check Point
Competent authority
Complement (set theory)
Computability
Computation
Computer
Computer data storage
Computing
Concurrent computing
COP=United States
Corollary
Data structure
Decidability (logic)
Decision problem
Delivery_Pre-order
Design methods
Design specification
Energy development
eq_isMigrated=2
eq_nobargain
Exportation (logic)
Expressive power (computer science)
Formal verification
Fundamental theorem
Funding
Generating set of a group
Heuristic
Heuristic (engineering)
Homomorphism
Implementation
Instance (computer science)
Iteration
Language_English
Lexical analysis
Mathematical induction
Memory management
Model checking
Notation
Numerical integration
PA=Temporarily unavailable
Parameter (computer programming)
Parity bit
Price_€100 and above
Programmer
PS=Active
PSPACE-complete
Report
Requirement
Result
Semantics
Server (computing)
softlaunch
Software
Software testing
Special case
State-space representation
Statement (computer science)
Strongly connected component
Structural induction
Synchronization (computer science)
System requirements
Tautology (logic)
Theorem
Time complexity
Transshipment (information security)
Variable (computer science)
Product details
- ISBN 9780691634890
- Weight: 567g
- Dimensions: 152 x 229mm
- Publication Date: 19 Apr 2016
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Hardback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
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. Originally published in 1995. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
