
Tell your friends about this item:
Decidability of Parameterized Verification - Synthesis Lectures on Distributed Computing Theory
Roderick Bloem
Decidability of Parameterized Verification - Synthesis Lectures on Distributed Computing Theory
Roderick Bloem
While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems ????(n) parameterized by n ? N, whether, for all n ? N, the system ????(n) satisfies a specification.
Media | Books Paperback Book (Book with soft cover and glued back) |
Released | September 29, 2015 |
ISBN13 | 9783031008832 |
Publishers | Springer International Publishing AG |
Pages | 158 |
Dimensions | 334 g |
Language | English |