Vertel uw vrienden over dit artikel:
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 | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 29 september 2015 |
| ISBN13 | 9783031008832 |
| Uitgevers | Springer International Publishing AG |
| Pagina's | 158 |
| Afmetingen | 150 × 220 × 10 mm · 334 g |
| Taal en grammatica | Engels |
Meer door Roderick Bloem
Alles tonenMere med samme udgiver
Bekijk alles van Roderick Bloem ( bijv. Paperback Book )