Automatic Verification Methods for Finite State Systems
International Workshop, Grenoble, France. June 12-14, 1989. Proceedings (Lecture Notes in Computer Science)
Our rough guess is there are 95,500 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 22 minutes to read. With a half hour per day, this will take 13 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
95,500 words, Guess
Page Count
382 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9800708M
- ISBN-139783540521488
- ISBN-103540521488
Classifications
- LCCQA75.5-76.95
First Sentence
The theory of process calculi as started with CCS [Mil 80] resulted in a number of verification tools designs, mostly in the case of terms with finitary representation (finite automata) [CPS 89,BoC 88,GLZ 89].
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!