Pastāsti draugiem par šo preci:
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2015. gada 29. septembris |
| ISBN13 | 9783031008832 |
| Izdevēji | Springer International Publishing AG |
| Lapas | 158 |
| Izmēri | 150 × 220 × 10 mm · 334 g |
| Valoda | Angļu |
Vairāk no Roderick Bloem
Rādīt visuMere med samme udgiver
Skatīt visus Roderick Bloem ( piem., Paperback Book )