{"product_id":"9781627057431","title":"Decidability of Parameterized Verification","description":"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 ∈ ℕ, whether, for all n ∈ ℕ, the system ??(n) satisfies a specification. In this book we consider the important case of ??(n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually depend on the parameter.","brand":"Morgan and Claypool Publishers","offers":[{"title":"Default Title","offer_id":47037013491952,"sku":"9781627057431","price":50.06,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9781627057431_p0.jpg?v=1763869962","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9781627057431","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}